stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates > Member List

This is the complete list of members for stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >, including all inherited members.

allocate_inner(unsigned short l)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
allocate_leaf()	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
allow_duplicates	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[static]
begin()	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
begin() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
btree()	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
btree(const key_compare &kcf)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
btree(InputIterator first, InputIterator last)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
btree(InputIterator first, InputIterator last, const key_compare &kcf)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
btree(const btree_self &other)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
btree_fixmerge enum value	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[private]
btree_not_found enum value	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[private]
btree_ok enum value	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[private]
btree_self typedef	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >
btree_update_lastkey enum value	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[private]
clear()	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
clear_recursive(node *n)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
copy_recursive(const node *n)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
count(const key_type &key) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
data_type typedef	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >
debug	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[static]
dump(std::ostream &os) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
dump_node(std::ostream &os, const node *n) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
empty() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
end()	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
end() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
equal_range(const key_type &key)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
equal_range(const key_type &key) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
erase(const key_type &key)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
erase(iterator iter)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
erase(iterator, iterator)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
erase_one(const key_type &key)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[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 >	[inline, private]
exists(const key_type &key) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
find(const key_type &key)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
find(const key_type &key) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
find_lower(const node_type *n, const key_type &key) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
find_upper(const node_type *n, const key_type &key) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
free_node(node *n)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
get_stats() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
headleaf	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[private]
innerslotmax	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[static]
insert(const pair_type &x)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
insert(const key_type &key, const data_type &data)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
insert(iterator, const pair_type &x)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
insert(InputIterator first, InputIterator last)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
insert2(const key_type &key, const data_type &data)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
insert2(iterator, const key_type &key, const data_type &data)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[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 >	[inline, private]
insert_start(const key_type &key, const data_type &value)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
key_comp() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
key_compare typedef	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >
key_equal(const key_type &a, const key_type &b) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
key_greater(const key_type &a, const key_type &b) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
key_greaterequal(const key_type &a, const key_type b) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
key_less	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[private]
key_lessequal(const key_type &a, const key_type b) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
key_type typedef	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >
leafslotmax	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[static]
lower_bound(const key_type &key)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
lower_bound(const key_type &key) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
max_size() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
merge_inner(inner_node *left, inner_node *right, inner_node *parent, unsigned int parentslot)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private, static]
merge_leaves(leaf_node *left, leaf_node *right, inner_node *parent)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
mininnerslots	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[static]
minleafslots	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[static]
operator!=(const btree_self &other) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
operator<(const btree_self &other) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
operator<=(const btree_self &other) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
operator=(const btree_self &other)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
operator==(const btree_self &other) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
operator>(const btree_self &other) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
operator>=(const btree_self &other) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
pair_to_value_type typedef	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[private]
pair_type typedef	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >
print(std::ostream &os) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
print_leaves(std::ostream &os) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
print_node(std::ostream &os, const node *node, unsigned int depth=0, bool recursive=false)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private, static]
rbegin()	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
rbegin() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
rend()	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
rend() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
restore(std::istream &is)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
restore_node(std::istream &is)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
result_flags_t enum name	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[private]
root	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[private]
selfverify	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[static]
shift_left_inner(inner_node *left, inner_node *right, inner_node *parent, unsigned int parentslot)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[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 >	[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 >	[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 >	[inline, private, static]
size() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
size_type typedef	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >
split_inner_node(inner_node *inner, key_type *_newkey, node **_newinner, unsigned int addslot)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
split_leaf_node(leaf_node *leaf, key_type *_newkey, node **_newleaf)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline, private]
stats	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[private]
swap(btree_self &from)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
tailleaf	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[private]
traits typedef	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >
upper_bound(const key_type &key)	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
upper_bound(const key_type &key) const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
value_comp() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
value_type typedef	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >
verify() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]
verify_leaflinks() const	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[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 >	[inline, private]
~btree()	stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >	[inline]