Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- cards dequeue(decks* q_deck) {
- cout << q_deck->size << endl;
- cards tmp_card;
- tmp_card = q_deck->p_deck[0];
- if (&tmp_card != nullptr) {
- for (int i = 0; i < q_deck->size - 1; i++) { // TAKING CARD FROM THE BOTTOM
- q_deck->p_deck[i] = q_deck->p_deck[i + 1];
- }
- q_deck->size--;
- return tmp_card;
- }
- else return tmp_card;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement