aya_codegen 0.1.0

Poker hand rank lookup table generator
Documentation 
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

use std::collections::HashMap;

use miniphf::CodeWriter;

use crate::{
    utils::{generate_all_ranks, insert_ranks, num_cards, ranks_to_key},
    HAND_CATEGORY_OFFSET,
};

pub struct BadugiLookup {
    ranks_lookup: HashMap<u32, u16>,
}

impl BadugiLookup {
    pub fn new() -> BadugiLookup {
        let mut table = BadugiLookup {
            ranks_lookup: HashMap::new(),
        };
        table.populate_tables();
        table
    }

    fn populate_tables(&mut self) {
        self.init_ranks_lookup();
        self.init_duplicated_ranks();
        assert_eq!(self.ranks_lookup.len(), 2379);
    }

    pub fn generate_phf(&self, c: f64, load_factor: f64) -> CodeWriter<u16> {
        let entries = self
            .ranks_lookup
            .iter()
            .map(|(k, v)| (*k as u64, *v))
            .collect::<Vec<_>>();
        miniphf::build_phf_map(entries, c, load_factor)
    }

    fn init_ranks_lookup(&mut self) {
        // 1. One Card
        let hand_value = 0;
        let one_card_hands = Self::generate_ranks(0, 1);
        insert_ranks(
            &mut self.ranks_lookup,
            &one_card_hands,
            ranks_to_key,
            hand_value,
        );

        // 2. Two Card
        let hand_value = HAND_CATEGORY_OFFSET;
        let two_card_hands = Self::generate_ranks(0, 2);
        insert_ranks(
            &mut self.ranks_lookup,
            &two_card_hands,
            ranks_to_key,
            hand_value,
        );

        // 3. Three Card
        let hand_value = 2 * HAND_CATEGORY_OFFSET;
        let three_card_hands = Self::generate_ranks(0, 3);
        insert_ranks(
            &mut self.ranks_lookup,
            &three_card_hands,
            ranks_to_key,
            hand_value,
        );

        // 4. Four Card
        let hand_value = 3 * HAND_CATEGORY_OFFSET;
        let four_card_hands = Self::generate_ranks(0, 4);
        insert_ranks(
            &mut self.ranks_lookup,
            &four_card_hands,
            ranks_to_key,
            hand_value,
        );
    }

    fn init_duplicated_ranks(&mut self) {
        let all_ranks = generate_all_ranks(2, 4);
        for ranks in all_ranks {
            let deduped_ranks = Self::dedupe_ranks(ranks);
            if ranks != deduped_ranks {
                let deduped_key = ranks_to_key(deduped_ranks);
                let hand_value = *self.ranks_lookup.get(&deduped_key).unwrap();
                self.ranks_lookup.insert(ranks_to_key(ranks), hand_value);
            }
        }
    }

    fn generate_ranks(starting_ranks: u64, hand_size: usize) -> Vec<Vec<u64>> {
        let rs: [u64; 13] = [12, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11];
        let mut result = Vec::new();

        let mut stack = vec![(starting_ranks, 13)];
        while let Some((ranks, max_rank)) = stack.pop() {
            if num_cards(ranks) == hand_size {
                result.push(vec![ranks]);
                continue;
            }

            for (i, r) in rs.iter().enumerate().take(max_rank) {
                let new_ranks = ranks + (1 << (4 * r));
                let r_rank_count = (new_ranks >> (4 * r)) & 0xf;

                if r_rank_count > 1 {
                    continue;
                }

                stack.push((new_ranks, i + 1));
            }
        }

        result
    }

    fn dedupe_ranks(ranks: u64) -> u64 {
        (0..13)
            .map(|r| u64::min((ranks >> (4 * r)) & 0xf, 1))
            .enumerate()
            .fold(0, |acc, (i, r)| acc + (r << (4 * i)))
    }
}

impl Default for BadugiLookup {
    fn default() -> BadugiLookup {
        BadugiLookup::new()
    }
}