hi_sparse_bitset 0.7.5

Hierarchical sparse bitset. Incredibly high performance. Compact memory usage.
Documentation 
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

fn main(){
    use itertools::assert_equal;

    use hi_sparse_bitset::reduce;    
    use hi_sparse_bitset::ops::*;
    
    type BitSet = hi_sparse_bitset::BitSet<hi_sparse_bitset::config::_128bit>;
    let bitset1 = BitSet::from([1,2,3,4]);
    let bitset2 = BitSet::from([3,4,5,6]);
    let bitset3 = BitSet::from([3,4,7,8]);
    let bitset4 = BitSet::from([4,9,10]);
    let bitsets = [bitset1, bitset2, bitset3];
    
    // reduce on bitsets iterator
    let intersection = reduce(And, bitsets.iter()).unwrap();
    assert_equal(&intersection, [3,4]);
    
    // operation between different types
    let union = intersection | &bitset4;
    assert_equal(&union, [3,4,9,10]);
    
    // partially traverse iterator, and save position to cursor.
    let mut iter = union.iter();
    assert_equal(iter.by_ref().take(2), [3,4]);
    let cursor = iter.cursor();
    
    // resume iteration from cursor position
    let iter = union.iter().move_to(cursor);
    assert_equal(iter, [9,10]);
}