algorithm 0.1.18

about algorithm data structure, now has ttl with lru/lru-k/lfu/arc and slab/rbtree/roaring_bitmap/timer_wheelss, 关于算法常用的数据结构
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22


use algorithm::BitMap;

fn main() {
    // let mut map = BitMap::new(10240);
    // map.add_many(&vec![1, 2, 3, 4, 10]);
    // assert!(map.contains(&1));
    // assert!(!map.contains(&5));
    // assert!(map.contains(&10));
    // map.add_range(7, 16);
    // assert!(!map.contains(&6));
    // assert!(map.contains(&7));
    // assert!(map.contains(&16));
    // assert!(!map.contains(&17));

    let mut map = BitMap::new(10240);
    map.add(7);
    map.add_range(9, 12);
    map.add_many(&vec![20, 100, 300]);
    println!("value = {:?}", map.iter().collect::<Vec<_>>());
    assert!(map.iter().collect::<Vec<_>>() == vec![7, 9, 10, 11, 12, 20, 100, 300]);
}