* Gets the number of elements. */

* Integer reversible hash function for 32 bits. * Implementation of the Robert Jenkins "4-byte Integer Hashing", * from http://burtleburtle.net/bob/

* Rounds up to the next power of 2. * For the value 0, the result is undefined. * \return The smallest power of 2 not less than the specified value.

* Integer reversible hash function for 64 bits. * Implementation of the Thomas Wang "Integer Hash Function", * from http://web.archive.org/web/20071

* Rounds up to the next power of 2 for 64 bits. */

* Bit scan forward or trailing zero count. * Return the bit index of the least significant 1 bit. * * If no bit is set, the result is undefined. *

* Bit scan forward or trailing zero count for 64 bits. */

* Bit scan reverse or integer log2. * Return the bit index of the most significant 1 bit. * * If no bit is set, the result is undefined. * To forc

* Bit scan reverse or integer log2 for 64 bits. */

Zero initialized

Constructs a trie_map. Has all the typical STL overloads

Wipes and resets the nedtrie index

Default constructor.

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

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

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

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

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

last we pre-define a few icd for common utarrays of ints and strings */

Constant access to a constructed value_type comparison object. required by the STL

Constant access to a constructed value_type comparison object. Required by the STL

Constant access to a constructed value_type comparison object. required by the STL

Constant access to a constructed value_type comparison object. required by the STL

Constant access to a constructed value_type comparison object. Required by the STL

Constructor called from btree::value_comp()

Run a thorough verification of all B+ tree invariants. The program aborts via BTREE_ASSERT() if something is wrong.

Run a thorough verification of all B+ tree invariants. The program aborts via BTREE_ASSERT() if something is wrong.

Run a thorough verification of all B+ tree invariants. The program aborts via BTREE_ASSERT() if something is wrong.

Run a thorough verification of all B+ tree invariants. The program aborts via BTREE_ASSERT() if something is wrong.

Run a thorough verification of all B+ tree invariants. The program aborts via assert() if something is wrong.

Verify the double linked list of leaves.

Recursively descend down the tree and verify each node

I/O We support reading and writing hashtables to disk. NOTE that this only stores the hashtable metadata, not the stuff you've actually put in the ha

I/O We support reading and writing hashtables to disk. Alas, since I don't know how to write a hasher or key_equal, you have to make sure everything

Only meaningful if value_type is a POD.

If your keys and values are simple enough, we can write them to disk for you. "simple enough" means value_type is a POD type that contains no pointer

Destructor.

Frees up all used B+ tree memory pages

Frees up all used B+ tree memory pages

Frees up all used B+ tree memory pages

Frees up all used B+ tree memory pages

Frees up all used B+ tree memory pages