Thrill  0.1
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
+ Collaboration diagram for B+ Trees:

Classes

class  btree< Key_, Value_, KeyOfValue_, Compare_, Traits_, Duplicates_, Alloc_ >
 Basic class implementing a B+ tree data structure in memory. More...
 
struct  btree_default_traits< Key, Value >
 Generates default traits for a B+ tree used as a set or map. More...
 
class  btree_map< Key_, Data_, Compare_, Traits_, Alloc_ >
 Specialized B+ tree template class implementing STL's map container. More...
 
class  btree_multimap< Key_, Data_, Compare_, Traits_, Alloc_ >
 Specialized B+ tree template class implementing STL's multimap container. More...
 
class  btree_multiset< Key_, Compare_, Traits_, Alloc_ >
 Specialized B+ tree template class implementing STL's multiset container. More...
 
class  btree_set< Key_, Compare_, Traits_, Alloc_ >
 Specialized B+ tree template class implementing STL's set container. More...
 

Macros

#define TLX_BTREE_ASSERT(x)   do { } while (0)
 Assertion only if TLX_BTREE_DEBUG is defined. This is not used in verify(). More...
 
#define TLX_BTREE_FRIENDS   friend class btree_friend
 
#define TLX_BTREE_MAX(a, b)   ((a) < (b) ? (b) : (a))
 The maximum of a and b. Used in some compile-time formulas. More...
 
#define TLX_BTREE_PRINT(x)   do { } while (0)
 Print out debug information to std::cout if TLX_BTREE_DEBUG is defined. More...
 

Detailed Description

B+ tree variants

Macro Definition Documentation

#define TLX_BTREE_ASSERT (   x)    do { } while (0)

Assertion only if TLX_BTREE_DEBUG is defined. This is not used in verify().

Definition at line 55 of file btree.hpp.

Referenced by btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::bulk_load(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::clear(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::erase_iter_descend(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::erase_one_descend(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::find_lower(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::find_upper(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::insert_descend(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::insert_start(), btree< Key_, Value_, KeyOfValue_, Compare_, Traits_, Duplicates_, Alloc_ >::reverse_iterator::key(), btree< Key_, Value_, KeyOfValue_, Compare_, Traits_, Duplicates_, Alloc_ >::const_reverse_iterator::key(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::merge_inner(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::merge_leaves(), btree< Key_, Value_, KeyOfValue_, Compare_, Traits_, Duplicates_, Alloc_ >::reverse_iterator::operator*(), btree< Key_, Value_, KeyOfValue_, Compare_, Traits_, Duplicates_, Alloc_ >::const_reverse_iterator::operator*(), btree< Key_, Value_, KeyOfValue_, Compare_, Traits_, Duplicates_, Alloc_ >::reverse_iterator::operator->(), btree< Key_, Value_, KeyOfValue_, Compare_, Traits_, Duplicates_, Alloc_ >::const_reverse_iterator::operator->(), btree< Key_, Value_, KeyOfValue_, Compare_, Traits_, Duplicates_, Alloc_ >::leaf_node::set_slot(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::shift_left_inner(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::shift_left_leaf(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::shift_right_inner(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::shift_right_leaf(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::split_inner_node(), and btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::split_leaf_node().

#define TLX_BTREE_FRIENDS   friend class btree_friend

The macro TLX_BTREE_FRIENDS can be used by outside class to access the B+ tree internals. This was added for wxBTreeDemo to be able to draw the tree.

Definition at line 66 of file btree.hpp.

#define TLX_BTREE_MAX (   a,
 
)    ((a) < (b) ? (b) : (a))

The maximum of a and b. Used in some compile-time formulas.

Definition at line 60 of file btree.hpp.

#define TLX_BTREE_PRINT (   x)    do { } while (0)

Print out debug information to std::cout if TLX_BTREE_DEBUG is defined.

Definition at line 52 of file btree.hpp.

Referenced by btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::bulk_load(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::erase(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::erase_iter_descend(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::erase_one(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::erase_one_descend(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::find_lower(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::find_upper(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::insert_descend(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::merge_inner(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::merge_leaves(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::shift_left_inner(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::shift_left_leaf(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::shift_right_inner(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::shift_right_leaf(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::split_inner_node(), btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::split_leaf_node(), and btree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type >::verify_node().