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
use crate::card::Card; use crate::suit::Suit; use crate::player::Player; use std::slice; use rand::seq::SliceRandom; pub struct Deck(Vec<Card>); impl Deck { pub fn new() -> Deck { let mut v: Vec<Card> = Vec::new(); v.extend(Card::new_suit(&Suit::Hearts)); v.extend(Card::new_suit(&Suit::Diamonds)); v.extend(Card::new_suit(&Suit::Spades)); v.extend(Card::new_suit(&Suit::Clubs)); let mut deck = Deck(v); deck.shuffle(); deck } pub fn shuffle(&mut self) { self.0.shuffle(&mut rand::thread_rng()); } pub fn draw(&mut self) -> Option<Card> { self.0.pop() } pub fn deal_each(&mut self, players: &mut Vec<Player>) -> bool { for p in players { match self.draw() { Some(c) => p.give(c), None => return false, } } true } } impl<'a> IntoIterator for &'a Deck { type Item = &'a Card; type IntoIter = slice::Iter<'a, Card>; fn into_iter(self) -> Self::IntoIter { self.0.iter() } } #[cfg(test)] mod test { use super::*; use std::collections::HashSet; #[test] fn iter() { let deck = Deck::new(); let mut n = 0; for _ in &deck { n += 1; } assert_eq!(n, 52); assert_eq!(deck.into_iter().count(), 52); } #[test] fn unique() { let mut set: HashSet<Card> = HashSet::new(); let mut deck = Deck::new(); loop { let c = match deck.draw() { Some(x) => x, None => break, }; assert!(!set.contains(&c)); set.insert(c); } } #[test] fn shuffle() { let card = Deck::new().draw().unwrap(); let limit = 1000; let mut n = 0; while card == Deck::new().draw().unwrap() && n < limit { n += 1; } } }