hi_sparse_bitset 0.9.0

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
31
32
33
34
35

//! Example of using traverse() with cursor.

fn main(){
    use hi_sparse_bitset::iter::IndexCursor;
    use std::ops::ControlFlow::*;
    
    type BitSet = hi_sparse_bitset::BitSet<hi_sparse_bitset::config::_128bit>;
    let bitset = BitSet::from([1,2,3,4]);

    // copy elements from bitset in 2 element sessions.
    let mut output = Vec::new();
    let mut cursor = IndexCursor::start();

    loop{
        let mut counter = 0;
        let ctrl = 
            bitset
            .iter().move_to(cursor)
            .traverse(|i|{
                if counter == 2{
                    cursor = i.into();
                    return Break(());
                }
                counter += 1;

                output.push(i);
                Continue(())
            });
        if ctrl.is_continue(){
            break;
        }
    }

    assert_eq!(output, vec![1,2,3,4]);
}