Advertisement
Guest User

Untitled

a guest
Dec 7th, 2019
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.35 KB | None | 0 0
  1. cards dequeue(decks* q_deck) {
  2.  
  3. cout << q_deck->size << endl;
  4. cards tmp_card;
  5. tmp_card = q_deck->p_deck[0];
  6. if (&tmp_card != nullptr) {
  7. for (int i = 0; i < q_deck->size - 1; i++) { // TAKING CARD FROM THE BOTTOM
  8. q_deck->p_deck[i] = q_deck->p_deck[i + 1];
  9. }
  10. q_deck->size--;
  11. return tmp_card;
  12. }
  13. else return tmp_card;
  14. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement