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
mod binarysearchtree; mod sequencetree; pub use sequencetree::SequenceTree; pub use sequencetree::Node; #[cfg(test)] mod tests { extern crate rand; use rand::{Rng, prelude::{SeedableRng, StdRng} }; use std::time::{Duration, Instant}; use crate::binarysearchtree::BTree; use crate::sequencetree::SequenceTree; const TEST_SCALE: u64 = 10_000; const KEY_MAX_LEN: usize = 30; const CHARSET: &[u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZ\ abcdefghijklmnopqrstuvwxyz\ 0123456789)(*&^%$#@!~_-.,[]{}:+|"; fn pretty_print_int(i: u64) -> String { let mut s = String::new(); let i_str = i.to_string(); let a = i_str.chars().rev().enumerate(); for (idx, val) in a { if idx != 0 && idx % 3 == 0 { s.insert(0, ','); } s.insert(0, val); } s } fn gen_str(rng: &mut StdRng) -> String { (0..rng.gen_range(3, KEY_MAX_LEN) ) .map(|_| { let idx = rng.gen_range(0, CHARSET.len()); CHARSET[idx] as char }) .collect() } #[test] fn deletion() { let mut st: SequenceTree<char, u64> = SequenceTree::new(); let key: Vec<char> = String::from("amit").chars().collect(); st.set(key.to_owned(), 55); println!("{:?}", st.get(key.to_owned())); st.del(key.to_owned()); println!("{:?}", st.get(key)); } #[test] fn accuracy() { println!("########TEST PARAMS: \n\tkeys: {} \n\tkey_len_range: {} to {} \n\tcharset_len: {}", pretty_print_int(TEST_SCALE), 3, KEY_MAX_LEN, CHARSET.len()); let keys_seed = [0u8; 32]; let mut keys_rng: StdRng = SeedableRng::from_seed(keys_seed); let values_seed = [1u8; 32]; let mut values_rng: StdRng = SeedableRng::from_seed(values_seed); use crate::sequencetree::SequenceTree; let mut st: SequenceTree<char, String> = SequenceTree::new(); for _ in 0u64 .. TEST_SCALE { st.set(gen_str(&mut keys_rng).chars().collect(), gen_str(&mut values_rng)); } keys_rng = SeedableRng::from_seed(keys_seed); values_rng = SeedableRng::from_seed(values_seed); for _ in 0u64 .. TEST_SCALE { match st.get (gen_str(&mut keys_rng).chars().collect()) { Some(val) => assert_eq!(val, &gen_str(&mut values_rng)), None => panic!("key not found") }; } } #[test] fn read_write_speed() { println!("########TEST PARAMS: \n\tkeys: {} \n\tkey_len_range: {} to {} \n\tcharset_len: {}", pretty_print_int(TEST_SCALE), 3, KEY_MAX_LEN, CHARSET.len()); use std::collections::HashMap; use crate::sequencetree::SequenceTree; println!("\n--------HASH MAP--------"); let mut hm: HashMap<String, String> = HashMap::new(); let seed = [0u8; 32]; let mut rng: StdRng = SeedableRng::from_seed(seed); let mut start: Instant = Instant::now(); for i in 0u64 .. TEST_SCALE { hm.insert(gen_str(&mut rng), format!("value{}",i)); } println!("store time {:?} ms", start.elapsed().as_millis()); rng = SeedableRng::from_seed(seed); start = Instant::now(); for _ in 0u64 .. TEST_SCALE { hm.get(gen_str(&mut rng).as_str()); } println!("fetch time {:?} ms", start.elapsed().as_millis()); println!("\n--------SEQUENCE TREE--------"); let mut st: SequenceTree<char, String> = SequenceTree::new(); rng = SeedableRng::from_seed(seed); start = Instant::now(); for i in 0u64 .. TEST_SCALE { st.set(gen_str(&mut rng).chars().collect(), format!("value{}", i)); } println!("store time {:?} ms", start.elapsed().as_millis()); rng = SeedableRng::from_seed(seed); start = Instant::now(); for i in 0u64 .. TEST_SCALE { st.get(gen_str(&mut rng).chars().collect()); } println!("fetch time {:?} ms", start.elapsed().as_millis()); rng = SeedableRng::from_seed(seed); let lim = 30; let mut key = String::new(); for _ in 0 .. lim { key = gen_str(&mut rng); } } }