durak 0.1.0

tui card game 'durak'(fool) built with ratatui.
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

use super::card::{Card, Suit};

#[derive(Debug, Clone, PartialEq, Eq)]
pub enum PlayerType {
    Human,
    Computer,
}

#[derive(Debug, Clone)]
pub struct Player {
    pub name: String,
    pub player_type: PlayerType,
    pub hand: Vec<Card>,
}

impl Player {
    pub fn new(name: String, player_type: PlayerType) -> Self {
        Self {
            name,
            player_type,
            hand: Vec::new(),
        }
    }
    /*
     * Get the player name
     * returns: &str
     * */
    pub fn name(&self) -> &str {
        &self.name
    }

    /*
     * Get the player type
     * returns: &PlayerType: Human | Computer
     * */
    pub fn player_type(&self) -> &PlayerType {
        &self.player_type
    }

    /*
     * Get the player hand
     * returns: &Vec<Card> where a card is a struct of rank and suit
     * */
    pub fn hand(&self) -> &[Card] {
        &self.hand
    }

    pub fn add_cards(&mut self, cards: Vec<Card>) {
        self.hand.extend(cards);
        self.sort_hand();
    }

    pub fn sort_hand(&mut self) {
        // Sort by suit and then by rank
        self.hand.sort_by(|a, b| {
            if a.suit == b.suit {
                a.rank.cmp(&b.rank)
            } else {
                // Sort by suit enum order
                (a.suit as usize).cmp(&(b.suit as usize))
            }
        });
    }

    pub fn remove_card(&mut self, index: usize) -> Option<Card> {
        if index < self.hand.len() {
            Some(self.hand.remove(index))
        } else {
            None
        }
    }

    pub fn hand_size(&self) -> usize {
        self.hand.len()
    }

    pub fn is_empty_hand(&self) -> bool {
        self.hand.is_empty()
    }

    pub fn get_lowest_trump(&self, trump_suit: Suit) -> Option<(usize, Card)> {
        self.hand
            .iter()
            .enumerate()
            .filter(|(_, card)| card.suit == trump_suit)
            .min_by_key(|(_, card)| card.rank)
            .map(|(idx, &card)| (idx, card))
    }

    #[allow(dead_code)]
    pub fn get_valid_defenses(
        &self,
        attacking_card: &Card,
        trump_suit: Suit,
    ) -> Vec<(usize, Card)> {
        self.hand
            .iter()
            .enumerate()
            .filter(|(_, card)| card.can_beat(attacking_card, trump_suit))
            .map(|(idx, &card)| (idx, card))
            .collect()
    }

    #[allow(dead_code)]
    pub fn get_lowest_card(&self) -> Option<(usize, Card)> {
        if self.hand.is_empty() {
            return None;
        }
        // Find lowest non-trump card, or lowest trump if that's all we have
        self.hand
            .iter()
            .enumerate()
            .min_by_key(|(_, card)| (card.rank as usize, card.suit as usize))
            .map(|(idx, &card)| (idx, card))
    }
}