Bit vector  0.9
Fast and space efficient dynamic bit vector library.
bv::node< leaf_type, dtype, leaf_size, branches > Member List

This is the complete list of members for bv::node< leaf_type, dtype, leaf_size, branches >, including all inherited members.

append_all(node *other)bv::node< leaf_type, dtype, leaf_size, branches >inline
append_child(child *new_child)bv::node< leaf_type, dtype, leaf_size, branches >inline
at(dtype index) constbv::node< leaf_type, dtype, leaf_size, branches >inline
bits_size() constbv::node< leaf_type, dtype, leaf_size, branches >inline
branching typedef (defined in bv::node< leaf_type, dtype, leaf_size, branches >)bv::node< leaf_type, dtype, leaf_size, branches >protected
child(uint8_t i)bv::node< leaf_type, dtype, leaf_size, branches >inline
child_count() constbv::node< leaf_type, dtype, leaf_size, branches >inline
child_count_bv::node< leaf_type, dtype, leaf_size, branches >protected
child_sizes()bv::node< leaf_type, dtype, leaf_size, branches >inline
child_sizes_bv::node< leaf_type, dtype, leaf_size, branches >protected
child_sums()bv::node< leaf_type, dtype, leaf_size, branches >inline
child_sums_bv::node< leaf_type, dtype, leaf_size, branches >protected
children()bv::node< leaf_type, dtype, leaf_size, branches >inline
children_bv::node< leaf_type, dtype, leaf_size, branches >protected
clear_first(uint8_t elems)bv::node< leaf_type, dtype, leaf_size, branches >inline
clear_last(uint8_t elems)bv::node< leaf_type, dtype, leaf_size, branches >inline
deallocate(allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inline
flush() (defined in bv::node< leaf_type, dtype, leaf_size, branches >)bv::node< leaf_type, dtype, leaf_size, branches >inline
generate_query_structure(qds *qs) (defined in bv::node< leaf_type, dtype, leaf_size, branches >)bv::node< leaf_type, dtype, leaf_size, branches >inline
has_leaves(bool leaves)bv::node< leaf_type, dtype, leaf_size, branches >inline
has_leaves() constbv::node< leaf_type, dtype, leaf_size, branches >inline
insert(dtype index, bool value, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inline
leaf_insert(dtype index, bool value, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
leaf_remove(dtype index, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
merge_leaves(leaf_type *a, leaf_type *b, uint8_t idx, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
merge_nodes(node *a, node *b, uint8_t idx, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
meta_data_bv::node< leaf_type, dtype, leaf_size, branches >protected
node()bv::node< leaf_type, dtype, leaf_size, branches >inline
node_insert(dtype index, bool value, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
node_remove(dtype index, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
p_sum() constbv::node< leaf_type, dtype, leaf_size, branches >inline
print(bool internal_only) constbv::node< leaf_type, dtype, leaf_size, branches >inline
rank(dtype index) constbv::node< leaf_type, dtype, leaf_size, branches >inline
rebalance_leaf(uint8_t index, leaf_type *leaf, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
rebalance_leaves_left(leaf_type *a, leaf_type *b, uint8_t idx, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
rebalance_leaves_right(leaf_type *a, leaf_type *b, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
rebalance_node(uint8_t index, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
rebalance_nodes_left(node *a, node *b, uint8_t idx)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
rebalance_nodes_right(node *a, node *b, uint8_t idx)bv::node< leaf_type, dtype, leaf_size, branches >inlineprotected
remove(dtype index, allocator *alloc)bv::node< leaf_type, dtype, leaf_size, branches >inline
select(dtype count) constbv::node< leaf_type, dtype, leaf_size, branches >inline
set(dtype index, bool v)bv::node< leaf_type, dtype, leaf_size, branches >inline
size() constbv::node< leaf_type, dtype, leaf_size, branches >inline
transfer_append(node *other, uint8_t elems)bv::node< leaf_type, dtype, leaf_size, branches >inline
transfer_prepend(node *other, uint8_t elems)bv::node< leaf_type, dtype, leaf_size, branches >inline
validate() constbv::node< leaf_type, dtype, leaf_size, branches >inline