Return the base node allocator provided during construction.

Get and change the value of shrink_factor and enlarge_factor. The description at the beginning of this file explains how to choose the values. Setti

Get and change the value of shrink_factor and enlarge_factor. The description at the beginning of this file explains how to choose the values. Setti

Utility functions to access the templated operators

Utility functions to access the templated operators

ACCESSOR FUNCTIONS for the things we templatize on, basically

ACCESSOR FUNCTIONS for the things we templatize on, basically

The height of the btree. An empty tree will have height 0.

Node allocation/deletion routines.

Set variables to initial values

Set variables to initial values

Return an allocator for inner_node objects

Insertion routines.

Insertion routines.

Insertion routines.

Inserts the item \em val

Attempt to insert a key into the B+ tree. The insert will fail if it is already present.

Attempt to insert a key into the B+ tree. As this set allows duplicates, this function never fails.

Attempt to insert a key/data pair into the B+ tree. Fails if the pair is already present.

Attempt to insert a key/data pair into the B+ tree. As this tree allows duplicates insertion never fails.

Attempt to insert a key/data pair into the B+ tree. If the tree does not allow duplicate keys, then the insert may fail if it is already present.

Private method used by insert_noresize and find_or_insert.

Private method used by insert_noresize and find_or_insert.

* @brief Insert an item into the B+ tree. * * Descend down the nodes to a leaf, insert the key/data pair in a free * slot. If the node

Inserts a value into the btree.

If you know *this is big enough to hold obj, use this routine

If you know *this is big enough to hold obj, use this routine

Start the insertion descent at the current root and handle root splits. Returns true if the item was inserted

Inserts a value into the btree only if it does not already exist. The boolean return value indicates whether insertion succeeded or failed.

True if few used entries, less than half full

True if the node's slots are full

True if node has too few entries

Constant access to the key comparison object sorting the B+ tree

Constant access to the key comparison object sorting the B+ tree

Constant access to the key comparison object sorting the B+ tree

Constant access to the key comparison object sorting the B+ tree

True if a == b ? constructed from key_less(). This requires the < relation to be a total order, otherwise the B+ tree cannot be sorted.

True if a > b ? constructed from key_less()

True if a >= b ? constructed from key_less()

True if a < b ? "constructed" from m_key_less()

True if a <= b ? constructed from key_less()

Return an allocator for leaf_node objects

The number of internal, leaf and total nodes used by the btree.

The leftmost node is stored as the parent of the root node.

We insert in the hashtable pointer to objects, because our objects are big */

Lookup routines.

Searches the B+ tree and returns an iterator to the first pair equal to or greater than key, or end() if all keys are smaller.

Searches the B+ tree and returns an iterator to the first pair equal to or greater than key, or end() if all keys are smaller.

Searches the B+ tree and returns an iterator to the first pair equal to or greater than key, or end() if all keys are smaller.