openpql-range-parser 0.1.0

Poker Range Notation Parser
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

use super::{
    Array, Card, From, Idx, Rank16, RankDiff, VarCondition, VarConditionRank,
    ast::RankConst,
};

#[derive(Debug, Default, Clone, PartialEq, Eq)]
pub enum ConstrainRank<const N: usize>
where
    [Idx; N]: Array<Item = Idx>,
{
    Match(Rank16),
    Diff(Idx, RankDiff),
    Var(VarConditionRank<N>),
    #[default]
    Nil,
}

pub const fn rank_diff(lhs: Card, rhs: Card) -> RankDiff {
    (lhs.rank as RankDiff) - (rhs.rank as RankDiff)
}

impl<const N: usize> ConstrainRank<N>
where
    [Idx; N]: Array<Item = Idx>,
{
    #[inline]
    pub fn reject(&self, cs: &[Card], perm: &[Idx], i: usize) -> bool {
        match self {
            Self::Match(r16) => {
                if !r16.contains_rank(cs[i].rank) {
                    return true;
                }
            }

            Self::Diff(original_idx, d) => {
                if let Some(j) = perm.iter().position(|k| original_idx == k)
                    && rank_diff(cs[j], cs[i]) != *d
                {
                    return true;
                }
            }

            Self::Var(VarConditionRank(VarCondition {
                equal,
                not_equal,
                banned,
                ..
            })) => {
                if banned.contains_rank(cs[i].rank) {
                    return true;
                }

                for original_idx in equal {
                    if let Some(j) = perm.iter().position(|k| original_idx == k)
                        && cs[i].rank != cs[j].rank
                    {
                        return true;
                    }
                }

                for original_idx in not_equal {
                    if let Some(j) = perm.iter().position(|k| original_idx == k)
                        && cs[i].rank == cs[j].rank
                    {
                        return true;
                    }
                }
            }

            Self::Nil => (),
        }

        false
    }
}

impl<const N: usize> From<Rank16> for ConstrainRank<N>
where
    [Idx; N]: Array<Item = Idx>,
{
    fn from(r: Rank16) -> Self {
        Self::Match(r)
    }
}

impl<const N: usize> From<RankConst> for ConstrainRank<N>
where
    [Idx; N]: Array<Item = Idx>,
{
    fn from(r: RankConst) -> Self {
        Self::Match(Rank16::from(1 << r as u8))
    }
}