oreodave/big-c
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

classifier: jokers in between cards can make straights

Browse Source
This commit is contained in:
Aryadev Chavali
2026-04-01 01:01:19 +01:00
committed by oreodave
parent be7ea8ba24
commit 839bb9375c
1 changed files with 6 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
src/classifier.rs
View File

@@ -112,7 +112,7 @@ fn classify_poker_hand(num_jokers: usize, cards: &[Card]) -> Option<Hand> {
let highest_rank_freq = *counter_ranks.iter().max().unwrap(); let highest_rank_freq = *counter_ranks.iter().max().unwrap();
let num_pairs = counter_ranks.iter().filter(|&&x| x == 2).count(); let num_pairs = counter_ranks.iter().filter(|&&x| x == 2).count();
let is_straight = consecutive_ranks(playing_cards); let is_straight = consecutive_ranks(num_jokers, playing_cards);
let is_flush = highest_suit_freq == playing_cards.len() as i32; let is_flush = highest_suit_freq == playing_cards.len() as i32;
let ptype = if is_straight && is_flush || num_jokers == 4 { let ptype = if is_straight && is_flush || num_jokers == 4 {
@@ -172,13 +172,16 @@ fn match_suit(cards: &[Card]) -> bool {
.all(|other_suit| suit == other_suit) .all(|other_suit| suit == other_suit)
} }
fn consecutive_ranks(cards: &[Card]) -> bool { fn consecutive_ranks(num_jokers: i32, cards: &[Card]) -> bool {
let mut num_jokers = num_jokers;
for i in 0..(cards.len() - 1) { for i in 0..(cards.len() - 1) {
let r1 = cards[i].rank().unwrap() as i32; let r1 = cards[i].rank().unwrap() as i32;
let r2 = cards[i + 1].rank().unwrap() as i32; let r2 = cards[i + 1].rank().unwrap() as i32;
if r1 != r2 + 1 { let diff = r2 - r1;
if diff == 0 || diff - 1 > num_jokers {
return false; return false;
} }
num_jokers -= diff - 1;
} }
return true; return true;
} }