Deck

[pluta-lesnura] / src / lib.rs

diff --git a/src/lib.rs b/src/lib.rs
index 7d12d9af8195bf5e19d10c7b592b359ccd014149..b7dc954b6d430de16bfc2f0ccccdd3e027f41c24 100644 (file)
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -1,5 +1,66 @@
-pub fn add(left: usize, right: usize) -> usize {
-    left + right
+use rand::Rng;
+
+pub const NUM_RANKS: u8 = 13;
+pub const NUM_SUITS: u8 = 4;
+pub const NUM_CARDS: u8 = NUM_RANKS * NUM_SUITS;
+
+#[derive(Clone, Copy, Eq, PartialEq)]
+pub struct Rank(u8);
+
+#[derive(Clone, Copy, Eq, PartialEq)]
+pub struct Suit(u8);
+
+#[derive(Clone, Copy, Eq, PartialEq)]
+pub struct Card(u8);
+impl Card {
+    #[must_use]
+    pub fn rank(&self) -> Rank {
+        Rank(self.0 >> 2)
+    }
+    #[must_use]
+    pub fn suit(&self) -> Suit {
+        Suit(self.0 & 3)
+    }
+}
+
+#[must_use]
+pub fn deck() -> Vec<Card> {
+    (0..NUM_CARDS).map(Card).collect()
+}
+
+#[derive(Clone, Copy)]
+pub struct PathLength(Rank);
+
+#[derive(Clone, Copy, Default)]
+pub struct PathLengthInfo(u16);
+impl PathLengthInfo {
+    #[must_use]
+    pub fn is_showing(&self, i: Rank) -> bool {
+        (self.0 >> i.0) & 1 == 1
+    }
+    fn reveal(&mut self, i: Rank) {
+        self.0 |= 1 << i.0;
+    }
+    pub fn reveal_random(&mut self, true_length: PathLength) -> Option<Rank> {
+        let showing = u8::try_from(self.0.count_ones()).expect("There aren't that many bits");
+        let not_showing = NUM_RANKS - showing;
+        if not_showing <= 1 {
+            return None;
+        }
+
+        let mut show = rand::thread_rng().gen_range(0..not_showing - 1);
+        for i in 0..NUM_RANKS {
+            let r = Rank(i);
+            if !self.is_showing(r) && r != true_length.0 {
+                if show == 0 {
+                    self.reveal(r);
+                    return Some(r);
+                }
+                show -= 1;
+            }
+        }
+        unreachable!()
+    }
 }
 
 #[cfg(test)]
@@ -7,8 +68,25 @@ mod tests {
     use super::*;
 
     #[test]
-    fn it_works() {
-        let result = add(2, 2);
-        assert_eq!(result, 4);
+    fn path_length_info_random_reveal() {
+        let length = PathLength(Rank(7));
+        let mut pli = PathLengthInfo::default();
+        for _ in 0..12 {
+            let old_pli = PathLengthInfo::clone(&pli);
+            match pli.reveal_random(length) {
+                None => panic!("Nothing revealed?"),
+                Some(r) => {
+                    assert!(!old_pli.is_showing(r));
+                    assert!(pli.is_showing(r));
+                }
+            }
+            assert_eq!(pli.0.count_ones(), 1 + old_pli.0.count_ones());
+        }
+        assert!(pli.reveal_random(length).is_none());
+    }
+
+    #[test]
+    fn test_deck() {
+        let _d = deck();
     }
 }