summaryrefslogtreecommitdiffstats
path: root/card.cpp
blob: 3c4854d1258308fae43aa94b0292fd0014ba45cc (plain)
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
/*
 * card.cpp
 *
 *
 */

#include "card.h"

Card::Card(void) : type(""), rank(0)
{

}

Card::Card(string &str)
{
    type = str;
}

string Card::getType(void)
{
    return type;
}

void Card::rankCard(void)
{
    char c;
    c = getType()[0];

    switch (c)
    {
    case 'A':
        rank = 13;
        break;
    case 'K':
        rank = 12;
        break;
    case 'Q':
        rank = 11;
        break;
    case 'J':
        rank = 10;
        break;
    case 'T':
        rank = 9;
        break;
    case '9':
        rank = 8;
        break;
    case '8':
        rank = 7;
        break;
    case '7':
        rank = 6;
        break;
    case '6':
        rank = 5;
        break;
    case '5':
        rank = 4;
        break;
    case '4':
        rank = 3;
        break;
    case '3':
        rank = 2;
        break;
    case '2':
        rank = 1;
        break;
    default:
        std::cerr << "something went wrong while ranking a card" << endl;
        break;
    } 
}

enum Suit Card::getSuit(void)
{
    enum Suit whatSuit = Undef;
    char c = type[1];

    switch (c)
    {
    case 'C':
        whatSuit = Clubs;
        break;
    case 'D':
        whatSuit = Diamond;
        break;
    case 'H':
        whatSuit = Hearts;
        break;
    case 'S':
        whatSuit = Spades;
        break;
    default:
        cout << "could not determine the suit of the card" << endl;
    }

    return whatSuit;
}

void Card::sortCards(Card **cards)
{
    /* bubble sort */
    int i, j;
    Card *tmp;

    for (i = 0; i < 5; i++)
        for (j = 0; j < 5-i-1; j++)
            if (cards[j]->rank < cards[j+1]->rank)
            {
                tmp = cards[j];
                cards[j] = cards[j+1];
                cards[j+1] = tmp;
            }
}