CONSTRUCTORS -- as required by the specs, we take a size, but also let you specify a hashfunction, key comparator, and key extractor. We also define

"Real" constructor and default constructor

"Real" constructor and default constructor

Dump the btree to the specified ostream. Requires that operator<< is defined for Key and Value.

Dump the contents of the B+ tree out onto an ostream as a binary image. The image contains memory pointers which will be fixed when the image is resto

Dump the contents of the B+ tree out onto an ostream as a binary image. The image contains memory pointers which will be fixed when the image is resto

Dump the contents of the B+ tree out onto an ostream as a binary image. The image contains memory pointers which will be fixed when the image is resto

Dump the contents of the B+ tree out onto an ostream as a binary image. The image contains memory pointers which will be fixed when the image is resto

Dump the contents of the B+ tree out onto an ostream as a binary image. The image contains memory pointers which will be fixed when the image is resto

Recursively descend down the tree and dump each node in a precise order

Returns true if there is at least one key in the B+ tree

Returns true if there is at least one key in the B+ tree

Returns true if there is at least one key/data pair in the B+ tree

Returns true if there is at least one key/data pair in the B+ tree

Returns true if there is at least one key/data pair in the B+ tree

TODO(sjackman): return a key_type rather than a value_type

Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B+ tree.

Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B+ tree.

Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B+ tree.

Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B+ tree.

Finds the range of values which compare equal to key. The first member of the returned pair is equal to lower_bound(key). The second member pair of th

Likewise, equal_range doesn't really make sense for us. Oh well.

Likewise, equal_range doesn't really make sense for us. Oh well.

Searches the B+ tree and returns both lower_bound() and upper_bound().

Searches the B+ tree and returns both lower_bound() and upper_bound().

Searches the B+ tree and returns both lower_bound() and upper_bound().

Searches the B+ tree and returns both lower_bound() and upper_bound().

Searches the B+ tree and returns both lower_bound() and upper_bound().

Deletion routines.

Deletion routines.

DELETION ROUTINES

DELETION ROUTINES

std::pair<iterator, iterator> equal_range(const key_type &key); std::pair<const_iterator, const_iterator> equal_range(const key_type &key) const; Remo

Erases all the key/data pairs associated with the given key.

Erases all the entries of the given key. This is implemented using erase_one() and thus not very efficient.

Erases all the key/data pairs associated with the given key. This is implemented using erase_one().

Erases all the key/data pairs associated with the given key. This is implemented using erase_one() and thus not very efficient.

Erases all the key/data pairs associated with the given key. This is implemented using erase_one().

@brief Erase one key/data pair referenced by an iterator in the B+ * tree. * * Descends down the tree in search of an iterator. During

Erases the key from the set. As this is a unique set, there is no difference to erase().

Erases one (the first) entry of the given key.

Erases the key/data pairs associated with the given key. For this unique-associative map there is no difference to erase().

Erases one (the first) of the key/data pairs associated with the given key.

Erases one (the first) of the key/data pairs associated with the given key.

@brief Erase one (the first) key/data pair in the B+ tree matching key. * * Descends down the tree in search of key. During the descent the

Non-STL function checking whether a key is in the B+ tree. The same as (find(k) != end()) or (count() != 0).

Non-STL function checking whether a key is in the B+ tree. The same as (find(k) != end()) or (count() != 0).

Non-STL function checking whether a key is in the B+ tree. The same as (find(k) != end()) or (count() != 0).

Non-STL function checking whether a key is in the B+ tree. The same as (find(k) != end()) or (count() != 0).

Non-STL function checking whether a key is in the B+ tree. The same as (find(k) != end()) or (count() != 0).

Lookup routines.

Lookup routines.

Finds the item with key \em key

Tries to locate a key in the B+ tree and returns an iterator to the key slot if found. If unsuccessful it returns end().

Tries to locate a key in the B+ tree and returns an iterator to the key slot if found. If unsuccessful it returns end().

Tries to locate a key in the B+ tree and returns an iterator to the key/data slot if found. If unsuccessful it returns end().

Tries to locate a key in the B+ tree and returns an iterator to the key/data slot if found. If unsuccessful it returns end().

Returns a pair of positions: 1st where the object is, 2nd where it would go if you wanted to insert it. 1st is ILLEGAL_BUCKET if object is not found;

Returns a pair of positions: 1st where the object is, 2nd where it would go if you wanted to insert it. 1st is ILLEGAL_BUCKET if object is not found;

Correctly free either inner or leaf node, destructs all contained key and value objects

The fullness of the btree. Computed as the number of elements in the btree divided by the maximum number of elements a tree with the current number of

Return the base node allocator provided during construction.

Return the base node allocator provided during construction.

Return the base node allocator provided during construction.