|
b-tree-plus-alpha
|
A dynamic data structure supporting rank and select queries on a bit sequence. More...
#include "./bp_tree.hpp"#include "./sequence/bit_container.hpp"#include "./sequence/bit_forward_iterator.hpp"#include "./sequence/bit_deque_container.hpp"#include "stool/include/all.hpp"

Go to the source code of this file.
Classes | |
| class | stool::bptree::DynamicBitSequence< CONTAINER, CONTAINER_ITERATOR, MAX_TREE_DEGREE, MAX_BIT_CONTAINER_SIZE > |
| A dynamic data structure supporting rank and select queries on a bit sequence B[0..n-1]. More... | |
Typedefs | |
| using | stool::bptree::BDC = typename stool::bptree::BitVectorContainer< 10000ULL > |
| using | stool::bptree::DynamicBitDequeSequence = DynamicBitSequence< BDC, BDC::BitVectorContainerIterator, bptree::DEFAULT_MAX_DEGREE_OF_INTERNAL_NODE, 1024 > |
| using | stool::bptree::SimpleDynamicBitSequence = DynamicBitSequence< BDC, BDC::BitVectorContainerIterator, 62, 8192 > |
A dynamic data structure supporting rank and select queries on a bit sequence.