Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the B+ tree. Uses STL magic.

Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the B+ tree. Uses STL magic.

Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the B+ tree. Uses STL magic.

Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the B+ tree. Uses STL magic.

Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the B+ tree. Uses STL magic.

We'll let you resize a hashtable -- though this makes us copy all! When you resize, you say, "make it big enough for this many more elements" Returns

We'll let you resize a hashtable -- though this makes us copy all! When you resize, you say, "make it big enough for this many more elements" Returns

We require table be not-NULL and empty before calling this.

Restore a binary image of a dumped B+ tree from an istream. The B+ tree pointers are fixed using the dump order. For dump and restore to work your key

Restore a binary image of a dumped B+ tree from an istream. The B+ tree pointers are fixed using the dump order. For dump and restore to work your key

Restore a binary image of a dumped B+ tree from an istream. The B+ tree pointers are fixed using the dump order. For dump and restore to work your key

Restore a binary image of a dumped B+ tree from an istream. The B+ tree pointers are fixed using the dump order. For dump and restore to work your key

Restore a binary image of a dumped B+ tree from an istream. The B+ tree pointers are fixed using the dump order. For dump and restore to work your key

Read the dump image and construct a tree from the node order in the serialization.

Constructor of a result with a specific flag, this can also be used as for implicit conversion.

Getter for the rightmost root node field. Only valid on the root node.

The rightmost node is stored in the root node.

Internal accessor routines.

Default constructor.

Default constructor.

Default constructor.

Set it so test_deleted is true. true if object didn't used to be deleted. TODO(csilvers): make these private (also in densehashtable.h)

Set it so test_deleted is true. true if object didn't used to be deleted.

Caller is resposible for calling reset_threshold right after set_resizing_parameters.

We need to copy values when we set the special marker for deleted elements, but, annoyingly, we can't just use the copy assignment operator because va

Annoyingly, we can't copy values around, because they might have const components (they're probably pair<const X, Y>). We use explicit destructor inv

Balance two inner nodes. The function moves key/data pairs from right to left so that both nodes are equally filled. The parent node is updated if pos

Balance two leaf nodes. The function moves key/data pairs from right to left so that both nodes are equally filled. The parent node is updated if poss

Balance two inner nodes. The function moves key/data pairs from left to right so that both nodes are equally filled. The parent node is updated if pos

Balance two leaf nodes. The function moves key/data pairs from left to right so that both nodes are equally filled. The parent node is updated if poss

Size routines.

Getter for the size root node field. Only valid on the root node.

Return the number of keys in the B+ tree

Return the number of keys in the B+ tree

Return the number of key/data pairs in the B+ tree

Return the number of key/data pairs in the B+ tree

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

"Real" constructor and default constructor

Split up an inner node into two equally-filled sibling nodes. Returns the new nodes and it's insertion key in the two parameters. Requires the slot of

Split up a leaf node into two equally-filled sibling leaves. Returns the new nodes and it's insertion key in the two parameters.

Fast swapping of two identical B+ tree objects.

Fast swapping of two identical B+ tree objects.

Fast swapping of two identical B+ tree objects.

Fast swapping of two identical B+ tree objects.

Fast swapping of two identical B+ tree objects.

* Grows and inserts a new element at the end of the array. */

* Grows and inserts a new element at the end of the array. */

* Checks if empty. * \return If the list is empty. */

* Calls the specified function for each element in the list. * * You cannot add or remove elements from the inside of the callback, * but can use i

* Calls the specified function with an argument for each element in the list. */

* Inserts an element at the head of a list. * \param list The list. * \param node The node to insert. * \param data The object containing the node.

* Gets the initialized size of the array. */

* Gets the initialized size of the array. */

* Gets the initialized size of the array. */

* Gets the initialized size of the array. * \param array Array to query. */

* Gets the number of elements. */

* Gets the number of elements. */

* Gets the number of elements. */

* Gets the number of elements. * \note This operation is O(n). */

* Gets the number of elements. */

* Gets the number of elements. */