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 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147
mod bucket; use bucket::Bucket; use rand::{thread_rng, Rng}; use std::collections::hash_map::DefaultHasher; use std::hash::{Hash, Hasher}; const MAXKICKS: i32 = 500; pub struct CuckooFilter { buckets: Vec<Bucket>, bucket_size: usize, num_buckets: usize, filled: usize, } impl CuckooFilter { pub fn new(capacity: usize) -> CuckooFilter { let mut buckets: Vec<Bucket> = Vec::new(); for _ in 0..100 { buckets.push(Bucket::new(capacity)) } CuckooFilter { buckets: buckets, bucket_size: 8, num_buckets: 100, filled: 0, } } pub fn insert<M: Into<Vec<u8>>>(&mut self, m: M) -> bool { let value = m.into(); let (mut fingerprint, index, alt_index) = fingerprint_i1_i2(value, self.num_buckets); self.buckets.get_mut(index); if self.buckets[index].insert(fingerprint) || self.buckets[alt_index].insert(fingerprint) { self.filled += 1; return true; } let mut rand_index = thread_rng().gen_range(index, alt_index); for _ in 0..MAXKICKS { let num: usize = thread_rng().gen_range(0, self.bucket_size); let removed_fp = fingerprint; let bucket = self.buckets[rand_index].clone(); fingerprint = match bucket.bucket[num] { Some(x) => x, None => return false, }; self.buckets[rand_index].bucket[num] = Some(removed_fp); rand_index = thread_rng().gen_range(index, alt_index); if self.buckets[rand_index].insert(fingerprint) { self.filled += 1; return true; } } false } pub fn contains<M: Into<Vec<u8>>>(&self, m: M) -> bool { let value = m.into(); let (fingerprint, index, alt_index) = fingerprint_i1_i2(value, self.num_buckets); let bucket = self.buckets[index].clone(); let bucket_alt = self.buckets[alt_index].clone(); bucket.contains(Some(fingerprint)) || bucket_alt.contains(Some(fingerprint)) } pub fn remove<M: Into<Vec<u8>>>(&mut self, m: M) -> bool { let value = m.into(); let (fingerprint, index, alt_index) = fingerprint_i1_i2(value, self.num_buckets); if self.buckets[index].delete(fingerprint) || self.buckets[alt_index].delete(fingerprint) { self.filled -= 1; return true; } false } } fn alt_index(fingerprint: u8, index: usize, num_bucket: usize) -> usize { let mut hasher = DefaultHasher::new(); fingerprint.hash(&mut hasher); let hash = hasher.finish() as usize; ((index) ^ hash) % num_bucket } fn fingerprint_i1_i2(value: Vec<u8>, num_bucket: usize) -> (u8, usize, usize) { let mut hasher = DefaultHasher::new(); value.hash(&mut hasher); let hash = hasher.finish(); let hasher = hash % 255 + 1; let fingerprint = hasher as u8; let index1 = hash as usize % num_bucket; let alt_index = alt_index(fingerprint, index1, num_bucket); (fingerprint, index1, alt_index) } #[cfg(test)] mod tests { use super::*; #[test] fn test_insert() -> Result<(), String> { let x = "ola"; let mut bucket = CuckooFilter::new(4); bucket.insert(x); assert_eq!(bucket.contains(x), true); assert_eq!(bucket.filled, 1); Ok(()) } #[test] fn test_contains() -> Result<(), String> { let x = "ola"; let mut bucket = CuckooFilter::new(4); bucket.insert(x); assert_eq!(bucket.contains(x), true); assert_eq!(bucket.contains("not_ola"), false); assert_eq!(bucket.filled, 1); Ok(()) } #[test] fn test_remove() -> Result<(), String> { let x = "ola"; let mut bucket = CuckooFilter::new(4); bucket.insert(x); bucket.remove(x); assert_eq!(bucket.contains(x), false); assert_eq!(bucket.contains("not_ola"), false); assert_eq!(bucket.filled, 0); Ok(()) } }