use super::{EqSeen, HashSeen, Seen};
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
struct Hashable(&'static str, i64);
#[derive(Debug, Clone, PartialEq)]
struct Unhashable(f64);
#[test]
fn both_mechanisms_admit_once_and_refuse_the_repeat() {
fn walk<K: Clone, D: Seen<K>>(keys: &[K]) -> Vec<bool> {
let mut seen = D::empty();
keys.iter().map(|key| seen.admit(key)).collect()
}
let keys = [
Hashable("m1", 1),
Hashable("m1", 2),
Hashable("m1", 1),
Hashable("m2", 1),
Hashable("m1", 2),
];
let admitted = vec![true, true, false, true, false];
assert_eq!(walk::<_, HashSeen<_>>(&keys), admitted);
assert_eq!(walk::<_, EqSeen<_>>(&keys), admitted);
}
#[test]
fn the_equality_mechanism_takes_a_key_that_cannot_hash() {
let mut seen = EqSeen::empty();
assert!(seen.admit(&Unhashable(0.5)));
assert!(seen.admit(&Unhashable(0.25)));
assert!(!seen.admit(&Unhashable(0.5)));
}
#[test]
fn a_membership_starts_empty() {
let mut hashed: HashSeen<Hashable> = Seen::empty();
let mut listed: EqSeen<Hashable> = Seen::empty();
assert!(hashed.admit(&Hashable("m1", 1)));
assert!(listed.admit(&Hashable("m1", 1)));
}