#include #include #include #include #include #include #include #include #include template std::string to_String(T number) { std::stringstream ss; ss << number; return ss.str(); } static void display(std::string stringToDisplay) { std::cout << stringToDisplay; } class Card { public: enum class SUIT : int { NONE = 0, CLUB = 1, DIAMOND = 2, HEART = 3, SPADE = 4, }; enum class RANK : int { NZERO = 0, NONE = 1, TWO = 2, THREE = 3, FOUR = 4, FIVE = 5, SIX = 6, SEVEN = 7, EIGHT = 8, NINE = 9, TEN = 10, JACK = 11, QUEEN = 12, KING = 13, ACE = 14, }; Card(SUIT, RANK); ~Card() {} std::string toString(); int suit(); int rank(); std::string suitStr(); std::string rankStr(); private: const std::array suitString{ { "*", "c","d","h","s" } }; const std::array rankString{ { "*", "*", "2","3","4","5", "6", "7","8","9","10","J","Q","K","A" } }; int mValue; // value = 10*rank + suit }; Card::Card(SUIT suit, RANK rank) : mValue(int(rank) * 10 + int(suit)) { } int Card::suit() { return (mValue % 10); } int Card::rank() { return (mValue / 10); } std::string Card::suitStr() { //return string representation of cards suit; return suitString[mValue % 10]; } std::string Card::rankStr() { //return string representation of cards rank; return rankString[mValue / 10]; } std::string Card::toString() { return std::string(rankString[mValue / 10] + suitString[mValue % 10]); } class Deck { public: Deck(); ~Deck(); std::string toString(int); int currentCard(); void shuffle(std::default_random_engine); //shuffle array Card* deal(); private: const static int NCARDS = 52; std::vector mCards; int mCurrentCard; //simulate the taking of each card from the top of a deck of cards }; Deck::Deck() { //initialize deck int i{ 0 }; // card numner in array mCurrentCard = 0; //go through each suit for (int suit = int(Card::SUIT::CLUB); suit <= int(Card::SUIT::SPADE); ++suit) { //go through each rank for (int rank = int(Card::RANK::TWO); rank <= int(Card::RANK::ACE); ++rank) { //place card in deck mCards.push_back(new Card(Card::SUIT(suit), Card::RANK(rank))); } } } Deck::~Deck() { } int Deck::currentCard() { return mCurrentCard; } void Deck::shuffle(std::default_random_engine rng) { std::shuffle(std::begin(mCards), std::end(mCards), rng); mCurrentCard = 0; } Card* Deck::deal() { //return pointer currentCard, advance to nextcard if (mCurrentCard <= NCARDS - 1) { return mCards[mCurrentCard++]; } else { return nullptr; } } std::string Deck::toString(int startPos) { std::string s{ "" }; int column{ 0 }; // current column of the cards being displayed(used for placing a newline) //iterate through array, starting at position for (std::vector::iterator iter = std::next(mCards.begin(), startPos); iter != mCards.end(); ++iter) { s += ((*iter)->toString() + " "); ++column; if (column > 12) { s += "\n"; column = 0; } } return s; } class Hand { public: Hand(); ~Hand(); //add card bool addCard(Card*); //discard card bool removeCard(Card*); //view hand - returns card as a string void clear(); int count() //current amount of cards in hand { int retVal{ 0 }; for (const auto& card : mCards) { retVal++; } return retVal; } std::string toString(); void sortBySuit(); void sortByRank(); std::vector cards() { return mCards; } private: std::vector mCards; //players hand }; Hand::Hand() { //mCards.reserve(5); } Hand::~Hand() { for (auto& card : mCards) { delete card; } mCards.clear(); } bool Hand::addCard(Card* card) { bool retVal = false; //check to see how many cards to hand already has if (mCards.size() < 5) { mCards.push_back(card); //search for card in hand if (std::find(mCards.begin(), mCards.end(), card) != mCards.end()) retVal = true; } return retVal; } bool Hand::removeCard(Card* card) { bool retVal = false; //search for the card in the current hand std::vector::iterator pos = std::find(mCards.begin(), mCards.end(), card); if (pos != mCards.end()) { //found the card. erase it from the array mCards.erase(pos); retVal = true; } return retVal; } void Hand::clear() { mCards.erase(mCards.begin(), mCards.end()); } std::string Hand::toString() { std::string retVal; for (const auto& card : mCards) { retVal += card->toString() + " "; } return retVal; } void Hand::sortBySuit() { int i, j, min_j; for (i = 0; i < int(mCards.size()); ++i) { //find the array element with min value among hand[i] min_j = i; //assume elem i (hand[i]) is the minimum for (j = i + 1; j < int(mCards.size()); ++j) { if (mCards[j]->suit() < mCards[min_j]->suit()) { min_j = j; //we found a smaller suit value, update min_j } } //swap h[i] and h[min_j] Card* temp = mCards[i]; mCards[i] = mCards[min_j]; mCards[min_j] = temp; } } void Hand::sortByRank() { int i, j, min_j; for (i = 0; i < int(mCards.size()); ++i) { //find the array element with min value among hand[i] min_j = i; //assume elem i (hand[i]) is the minimum for (j = i + 1; j < int(mCards.size()); ++j) { if (mCards[j]->rank() < mCards[min_j]->rank()) { min_j = j; //we found a smaller suit value, update min_j } } //swap h[i] and h[min_j] Card* temp = mCards[i]; mCards[i] = mCards[min_j]; mCards[min_j] = temp; } } int main(int argc, char* argv[]) { Deck newDeck; Hand newHand; int seed {std::chrono::system_clock::now().time_since_epoch().count()}; std::default_random_engine eng{seed}; display("Deck contents\n" + newDeck.toString(newDeck.currentCard()) + "\n"); display("Whoops, we forgot to shuffle\nShuffling\n\n"); //shuffle the deck newDeck.shuffle(eng); display("Deck contents\n" + newDeck.toString(newDeck.currentCard()) + "\n"); // deal 5 cards for(int i{0}; i < 5; ++i) { newHand.addCard(newDeck.deal()); } display("Dealing 5 cards from top of deck:\n" + newHand.toString() + "\n\n"); display("Remaining deck contents\n" + newDeck.toString(newDeck.currentCard()) + "\n"); return 0; }