Classes
class	BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >
	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

◆ TLX_BTREE_ASSERT

#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, Allocator >::reverse_iterator::key(), BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::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, Allocator >::reverse_iterator::operator*(), BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::operator*(), BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::reverse_iterator::operator->(), BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::operator->(), BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::LeafNode::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().

◆ TLX_BTREE_FRIENDS

#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.

◆ TLX_BTREE_MAX

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

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

Definition at line 60 of file btree.hpp.

◆ TLX_BTREE_PRINT

#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.