Arithmetic. The only hard part is making sure that we're not on a marked-deleted array element

Arithmetic. The only hard part is making sure that we're not on an empty or marked-deleted array element

Arithmetic. The only hard part is making sure that we're not on an empty or marked-deleted array element

Convert a normal allocator to one that has realloc_or_die()

Allocate and initialize an inner node

Allocate and initialize a leaf node

The average number of bytes used per value stored in the btree.

Return the average fill of leaves

Default constructor.

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

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

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

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

Default constructor initializing an empty B+ tree with the standard key comparison function

Default constructor.

Default constructor.

Default constructor initializing an empty B+ tree with the standard key comparison function

Default constructor.

Default constructor.

Default constructor.

Default constructor initializing an empty B+ tree with the standard key comparison function

Default constructor.

Default constructor initializing an empty B+ tree with the standard key comparison function

Default constructor.

Default constructor initializing an empty B+ tree with the standard key comparison function

Default constructor.

This is a tr1 method: the bucket a given key is in, or what bucket it would be put in, if it were to be inserted. Shrug.

This is a tr1 method: the bucket a given key is in, or what bucket it would be put in, if it were to be inserted. Shrug.

These are tr1 methods. Their idea of 'bucket' doesn't map well to what we do. We just say every bucket has 0 or 1 items in it.

These are tr1 methods. Their idea of 'bucket' doesn't map well to what we do. We just say every bucket has 0 or 1 items in it.

Utility routines.

Utility routines.

It's always nice to be able to clear a table without deallocating it

It's always nice to be able to clear a table without deallocating it

Frees all keys and all nodes of the tree

Frees all keys and all nodes of the tree

Frees all key/data pairs and all nodes of the tree

Frees all key/data pairs and all nodes of the tree

Frees all key/data pairs and all nodes of the tree

Set it so test_deleted is false. true if object used to be deleted.

Set it so test_deleted is false. true if object used to be deleted.

Clear the table without resizing it. Mimicks the stl_hashtable's behaviour when clear()-ing in that it does not modify the bucket count

Recursively free up nodes

Used to actually do the rehashing when we grow/shrink a hashtable

Used to actually do the rehashing when we grow/shrink a hashtable

Recursively copy nodes from another B+ tree object

Counts how many elements have key key. For maps, it's either 0 or 1.

Counts how many elements have key key. For maps, it's either 0 or 1.

Returns the number of items with the key \em key

Tries to locate a key in the B+ tree and returns the number of identical key entries found. As this is a unique set, count() returns either 0 or 1.

Tries to locate a key in the B+ tree and returns the number of identical key entries found.

Tries to locate a key in the B+ tree and returns the number of identical key entries found. Since this is a unique map, count() returns either 0 or 1.

Tries to locate a key in the B+ tree and returns the number of identical key entries found.

Tries to locate a key in the B+ tree and returns the number of identical key entries found.