1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177
|
#include<iostream>
#include<vector>
#include<algorithm>
#include <cassert>
#include "cards.h"
#include "ramdom.h"
using namespace std;
Card:: Card()
: rank(1),suit(spade)
{}
Card:: Card(Suits sv,unsigned int rv)
:rank(rv),suit(sv);
{}
Card:: Card(const Card& orig)
: rank(orig.rank), suit(orig.suit);
{}
Card::~Card()
{}
Card& Card:: operator = (const Card& rhs){
if(this != &rhs)
{
rank = rhs.rank;
suit = rhs.suit;
}
return *this;
}
unsigned int Card:: getRank() const;{
return rank;
}
void Card:: setRank(unsigned int rv){
assert((rv>0)&&(rv<= max_ranks));
rank = rv;
}
suits Card:: getSuit()const{
return suit;
}
void card::setSuit(suits sv){
suit = sv;
}
void Card:: insertCard(ostream& out)const{
switch(rank)
{
case 1: out<<"Ace";break;
case 11: out<<"Jack";break;
case 12: out<<"Queen";break;
case 13: out<<"King"; break;
default:
out<<rank; break;
}
switch(suit)
{
case diamond: out<<"Diamond";break;
case club: out<<"Clubs";break;
case heart: out<<"Heart";break;
case spade: out<<"Spade";break;
}
}
ostream&operator<<(ostream& out, const Card& aCard)
{
aCard.insertCard(out);
return out;
}
//make a deck of cards
Deck::Deck()
{
for(int i = 1; i<= max_ranks; i++)
{
Card c1(diamond,i);
Card c2(spade,i);
Card c3(heart,i);
Card c4(club, i);
cards.push_back(c1);
cards.push_back(c2);
cards.push_back(c3);
cards.push_back(c4);
}
}
Deck:: Deck(const Deck& orig){
operator = (orig);
}
Deck::~Deck(){}
Deck& Deck:: operator(const Deck& rhs)
{
if(this != &rhs)
{
cards = rhs.cards;
}
return *this;
}
void Deck:: shuffle(){
randomInteger randfunc;
random_shuffle(cards.begin(),cards.end(),randfunc);
}
bool Deck:: isEmpty()const{
return(cards.size()==0);
}
Card Deck:: draw(){
assert(!isEmpty());
Card retval(spade,1);
if(!isEmpty())
{
retval = cards.back();
cards.pop_back();
}
return retval;
}
const Player:: hand_size=3;
Player::Player(Deck& aDeck)
:myPoint(0);
{
for(int i = 0; i<hand_size; i++)
{
assert(!aDeck.isEmpty());
myPoker.push_back(aDeck.draw());
}
}
Player:: Player(const Player& orig)
:myPoker(orig.myPoker),myPoint(orig.mypoint);
{}
Player::~Player(){}
Player& Player:: operator=(const Player& rhs){
if(this!= &rhs)
{
myPoker = rhs.myPoker;
myPoint = rhs.myPoint;
}
return *this;
}
Card Player:: draw(){
assert(myPoker.size()>0);
randomInteger randomizer;
int removePoker = randomizer(myPoker.size());
Card draw_card = myPoker[removePoker];
myPoker[removedPoker] = myPoker.back();
myPoker.pop_back();
return draw_card;
}
void Player::addPoint(int x){
myPoint = myPoint +x;
}
void Player::point() const{
return myPoint;
}
void Player:: replaceCard(Deck& aDeck){
assert(!aDeck.isEmpty());
myPoker.push_back(aDeck.draw());
}
|