hibit_tree 0.1.0-beta.1

Hierarchical bitmap tree. Integer-key map that can intersect FAST.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

/*use hi_sparse_array::level::{IntrusiveListLevel, SingleBlockLevel};
use hi_sparse_array::level_block::{Block, SmallBlock};
use hi_sparse_array::SparseArray;

type Lvl0Block = Block<u64, [u8; 64]>;
type Lvl1Block = Block<u64, [u16; 64]>;
type Lvl2Block = Block<u64, [u32; 64]>;
type Lvls = (SingleBlockLevel<Lvl0Block>, IntrusiveListLevel<Lvl1Block>, IntrusiveListLevel<Lvl2Block>);

type CompactLvl1Block = SmallBlock<u64, [u8;1], [u16;64], [u16;7]>;
type CompactLvl2Block = SmallBlock<u64, [u8;1], [u32;64], [u32;7]>;
type CompactLvls = (
    SingleBlockLevel<Lvl0Block>, 
    IntrusiveListLevel<CompactLvl1Block>, 
    IntrusiveListLevel<CompactLvl2Block>
);*/
use hibit_tree::config::_64bit;
use hibit_tree::Tree;

// TODO: switch to Compact on flag for CI. 
//pub type Array<Data> = SparseTree<config::width_64::depth_3, Data>;
pub type Array<Data> = Tree<Data, _64bit<3>>;
pub const RANGE: usize = 260_000;