, including all inherited members.
| allocate_inner(unsigned short level) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| allocate_leaf() | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| allocator_type typedef | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | |
| allow_duplicates | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [static] |
| begin() | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| begin() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| btree(const allocator_type &alloc=allocator_type()) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, explicit] |
| btree(const key_compare &kcf, const allocator_type &alloc=allocator_type()) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, explicit] |
| btree(InputIterator first, InputIterator last, const allocator_type &alloc=allocator_type()) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| btree(InputIterator first, InputIterator last, const key_compare &kcf, const allocator_type &alloc=allocator_type()) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| btree(const btree_self &other) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| btree_fixmerge enum value | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| btree_not_found enum value | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| btree_ok enum value | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| btree_self typedef | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | |
| btree_update_lastkey enum value | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| bulk_load(Iterator ibegin, Iterator iend) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| clear() | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| clear_recursive(node *n) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| copy_recursive(const node *n) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| count(const key_type &key) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| data_copy(InputIterator first, InputIterator last, OutputIterator result) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private, static] |
| data_copy_backward(InputIterator first, InputIterator last, OutputIterator result) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private, static] |
| data_type typedef | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | |
| debug | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [static] |
| dump(std::ostream &os) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| dump_node(std::ostream &os, const node *n) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| empty() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| end() | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| end() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| equal_range(const key_type &key) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| equal_range(const key_type &key) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| erase(const key_type &key) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| erase(iterator iter) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| erase(iterator, iterator) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| erase_iter_descend(const iterator &iter, node *curr, node *left, node *right, inner_node *leftparent, inner_node *rightparent, inner_node *parent, unsigned int parentslot) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| erase_one(const key_type &key) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| erase_one_descend(const key_type &key, node *curr, node *left, node *right, inner_node *leftparent, inner_node *rightparent, inner_node *parent, unsigned int parentslot) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| exists(const key_type &key) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| find(const key_type &key) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| find(const key_type &key) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| find_lower(const node_type *n, const key_type &key) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| find_upper(const node_type *n, const key_type &key) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| free_node(node *n) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| get_allocator() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| get_stats() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| inner_node_allocator() | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| innerslotmax | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [static] |
| insert(const pair_type &x) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| insert(const key_type &key, const data_type &data) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| insert(iterator, const pair_type &x) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| insert(InputIterator first, InputIterator last) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| insert2(const key_type &key, const data_type &data) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| insert2(iterator, const key_type &key, const data_type &data) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| insert_descend(node *n, const key_type &key, const data_type &value, key_type *splitkey, node **splitnode) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| insert_start(const key_type &key, const data_type &value) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| key_comp() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| key_compare typedef | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | |
| key_equal(const key_type &a, const key_type &b) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| key_greater(const key_type &a, const key_type &b) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| key_greaterequal(const key_type &a, const key_type b) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| key_less(const key_type &a, const key_type b) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| key_lessequal(const key_type &a, const key_type b) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| key_type typedef | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | |
| leaf_node_allocator() | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| leafslotmax | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [static] |
| lower_bound(const key_type &key) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| lower_bound(const key_type &key) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| m_allocator | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| m_headleaf | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| m_key_less | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| m_root | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| m_stats | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| m_tailleaf | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| max_size() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| merge_inner(inner_node *left, inner_node *right, inner_node *parent, unsigned int parentslot) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private, static] |
| merge_leaves(leaf_node *left, leaf_node *right, inner_node *parent) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| mininnerslots | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [static] |
| minleafslots | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [static] |
| operator!=(const btree_self &other) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| operator<(const btree_self &other) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| operator<=(const btree_self &other) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| operator=(const btree_self &other) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| operator==(const btree_self &other) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| operator>(const btree_self &other) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| operator>=(const btree_self &other) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| pair_to_value_type typedef | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| pair_type typedef | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | |
| print(std::ostream &os) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| print_leaves(std::ostream &os) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| print_node(std::ostream &os, const node *node, unsigned int depth=0, bool recursive=false) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private, static] |
| rbegin() | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| rbegin() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| rend() | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| rend() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| restore(std::istream &is) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| restore_node(std::istream &is) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| result_flags_t enum name | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [private] |
| selfverify | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [static] |
| shift_left_inner(inner_node *left, inner_node *right, inner_node *parent, unsigned int parentslot) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private, static] |
| shift_left_leaf(leaf_node *left, leaf_node *right, inner_node *parent, unsigned int parentslot) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private, static] |
| shift_right_inner(inner_node *left, inner_node *right, inner_node *parent, unsigned int parentslot) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private, static] |
| shift_right_leaf(leaf_node *left, leaf_node *right, inner_node *parent, unsigned int parentslot) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private, static] |
| size() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| size_type typedef | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | |
| split_inner_node(inner_node *inner, key_type *_newkey, node **_newinner, unsigned int addslot) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| split_leaf_node(leaf_node *leaf, key_type *_newkey, node **_newleaf) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| swap(btree_self &from) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| traits typedef | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | |
| upper_bound(const key_type &key) | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| upper_bound(const key_type &key) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| used_as_set | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [static] |
| value_comp() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| value_type typedef | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | |
| verify() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |
| verify_leaflinks() const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| verify_node(const node *n, key_type *minkey, key_type *maxkey, tree_stats &vstats) const | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline, private] |
| ~btree() | stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc, _UsedAsSet > | [inline] |