Main dynamic data structures

Collaboration diagram for Main dynamic data structures:

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...
class	stool::bptree::DynamicPermutation
	A dynamic data structure to store a permutation Π[0..n-1] of integers 0, 1, ..., n-1. More...
class	stool::bptree::DynamicPrefixSum< LEAF_CONTAINER, TREE_DEGREE, LEAF_CONTAINER_MAX_SIZE >
	A dynamic data structure supporting prefix-sum query on a unsigned 64-bit integer sequence S[0..n-1]. More...
class	stool::bptree::DynamicSequence64< LEAF_CONTAINER, TREE_DEGREE, LEAF_CONTAINER_MAX_SIZE >
	A dynamic data structure that maintains a sequence of 64-bit non-negative integers S[0..n-1]. More...
class	stool::bptree::DynamicWaveletTree
	A dynamic data structure supporting rank and select queries on a string T[0..n-1] over alphabet U[0..σ-1]. More...

Detailed Description