| allocate_inner(unsigned short level) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| allocate_leaf() | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| allocator_ | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | private |
| allocator_type typedef | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | |
| allow_duplicates | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | static |
| begin() | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| begin() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| BTree(const allocator_type &alloc=allocator_type()) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineexplicit |
| BTree(const key_compare &kcf, const allocator_type &alloc=allocator_type()) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineexplicit |
| BTree(InputIterator first, InputIterator last, const allocator_type &alloc=allocator_type()) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| BTree(InputIterator first, InputIterator last, const key_compare &kcf, const allocator_type &alloc=allocator_type()) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| BTree(const BTree &other) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| btree_fixmerge enum value | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | private |
| btree_not_found enum value | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | private |
| btree_ok enum value | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | private |
| btree_update_lastkey enum value | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | private |
| bulk_load(Iterator ibegin, Iterator iend) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| clear() | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| clear_recursive(node *n) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| copy_recursive(const node *n) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| count(const key_type &key) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| debug | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | static |
| empty() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| end() | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| end() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| equal_range(const key_type &key) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| equal_range(const key_type &key) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| erase(const key_type &key) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| erase(iterator iter) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| erase_iter_descend(const iterator &iter, node *curr, node *left, node *right, InnerNode *left_parent, InnerNode *right_parent, InnerNode *parent, unsigned int parentslot) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| erase_one(const key_type &key) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| erase_one_descend(const key_type &key, node *curr, node *left, node *right, InnerNode *left_parent, InnerNode *right_parent, InnerNode *parent, unsigned int parentslot) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| exists(const key_type &key) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| find(const key_type &key) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| find(const key_type &key) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| find_lower(const node_type *n, const key_type &key) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| find_upper(const node_type *n, const key_type &key) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| free_node(node *n) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| get_allocator() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| get_stats() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| head_leaf_ | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | private |
| inner_node_allocator() | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| inner_slotmax | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | static |
| inner_slotmin | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | static |
| insert(const value_type &x) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| insert(iterator, const value_type &x) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| insert(InputIterator first, InputIterator last) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| insert_descend(node *n, const key_type &key, const value_type &value, key_type *splitkey, node **splitnode) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| insert_start(const key_type &key, const value_type &value) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| key_comp() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| key_compare typedef | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | |
| key_equal(const key_type &a, const key_type &b) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| key_greater(const key_type &a, const key_type &b) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| key_greaterequal(const key_type &a, const key_type &b) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| key_less(const key_type &a, const key_type &b) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| key_less_ | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | private |
| key_lessequal(const key_type &a, const key_type &b) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| key_of_value typedef | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | |
| key_type typedef | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | |
| leaf_node_allocator() | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| leaf_slotmax | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | static |
| leaf_slotmin | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | static |
| lower_bound(const key_type &key) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| lower_bound(const key_type &key) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| max_size() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| merge_inner(InnerNode *left, InnerNode *right, InnerNode *parent, unsigned int parentslot) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivatestatic |
| merge_leaves(LeafNode *left, LeafNode *right, InnerNode *parent) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| operator!=(const BTree &other) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| operator<(const BTree &other) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| operator<=(const BTree &other) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| operator=(const BTree &other) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| operator==(const BTree &other) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| operator>(const BTree &other) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| operator>=(const BTree &other) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| rbegin() | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| rbegin() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| rend() | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| rend() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| result_flags_t enum name | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | private |
| root_ | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | private |
| Self typedef | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | |
| self_verify | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | static |
| shift_left_inner(InnerNode *left, InnerNode *right, InnerNode *parent, unsigned int parentslot) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivatestatic |
| shift_left_leaf(LeafNode *left, LeafNode *right, InnerNode *parent, unsigned int parentslot) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivatestatic |
| shift_right_inner(InnerNode *left, InnerNode *right, InnerNode *parent, unsigned int parentslot) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivatestatic |
| shift_right_leaf(LeafNode *left, LeafNode *right, InnerNode *parent, unsigned int parentslot) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivatestatic |
| size() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| size_type typedef | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | |
| split_inner_node(InnerNode *inner, key_type *out_newkey, node **out_newinner, unsigned int addslot) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| split_leaf_node(LeafNode *leaf, key_type *out_newkey, node **out_newleaf) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| stats_ | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | private |
| swap(BTree &from) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| tail_leaf_ | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | private |
| TLX_BTREE_FRIENDS | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | |
| traits typedef | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | |
| upper_bound(const key_type &key) | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| upper_bound(const key_type &key) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| value_comp() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| value_type typedef | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | |
| verify() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
| verify_leaflinks() const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| verify_node(const node *n, key_type *minkey, key_type *maxkey, tree_stats &vstats) const | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inlineprivate |
| ~BTree() | BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator > | inline |
1.8.11 
