Commit Graph

12 Commits

Author SHA1 Message Date
Aryadev Chavali
99bfd9ed37 card: rearrange 2026-04-05 04:45:51 +01:00
Aryadev Chavali
04cf388f59 card: move all_same_rank and add documentation 2026-04-05 04:45:51 +01:00
Aryadev Chavali
69c012e47a *: young clippy back at it again 2026-04-02 02:25:48 +01:00
Aryadev Chavali
52285de6be card: refactor to lift PlayingCard as it's own type
Now that playing cards are their own type, we can map a sequence of
Cards over to their PlayingCards, which should make the classifier a
bit nicer.
2026-04-02 02:22:35 +01:00
Aryadev Chavali
2356d78592 card: new card constructor 2026-04-01 06:20:22 +01:00
Aryadev Chavali
14d66cf171 classifier: permit loop-around straights
Our classifier now permits straights like (A(S), 2(D), 3(C), 4(S),
5(H)).
2026-04-01 06:20:22 +01:00
Aryadev Chavali
dd0011d1f2 card|classifier: young clippy up in this mf 2026-04-01 06:20:22 +01:00
Aryadev Chavali
be7ea8ba24 card: implement display methods for rank, suit, card 2026-04-01 06:20:22 +01:00
Aryadev Chavali
b66c1c7706 card: add rank and suit destructors
They're Option since card may be a joker, but this is supremely
helpful.
2026-04-01 06:20:22 +01:00
Aryadev Chavali
dfc5761246 card: make Card::PlayingCard variant struct-like for more clarity. 2026-04-01 06:20:22 +01:00
Aryadev Chavali
7009d14965 derive partialeq for rank and suit (obvious impl) 2026-04-01 06:20:22 +01:00
Aryadev Chavali
3259448dca card: a sufficient API for cards
The mathematical result that underpins this is a bijective map between
the positive integers and a unique playing card.
2026-04-01 06:20:22 +01:00