Getter/setter for the number of values stored in this node.

Size routines.

Insertion routines.

Getter/setter for whether this is a leaf node or not. This value doesn't change after the node is created.

Getters/setter for the child at position i in the node.

Iterator routines.

True if few used entries, less than half full

True if this is a leaf node

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

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().

Getter for the position of this node in its parent.

Getter for the parent of this node.

Reset the enlarge and shrink thresholds

Iterator routines.

* Gets the head of the list. * \return The head node. For empty lists 0 is returned. */

This is the smallest size a hashtable can be without being too crowded If you like, you can give a min #buckets as well as a min #elts

Test if this result object has a given flag set.

HTsmalloc() -- safe malloc * allocates memory, or crashes if the allocation fails. */

Size routines. Note that empty() is slightly faster than doing size()==0.

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

Deletion routines.

* Removes an element from the list. * You must already have the address of the element to remove. * \note The node content is left unchanged, includ

HTfree() -- keep track of memory use * frees memory using free, but updates count of how much memory * is being used. */

True if node has too few entries

* Gets the element at the specified position. * You must be sure that space for this position is already * allocated calling tommy_array_grow(). */

\internal * Creates a new list with a single element. * \param list The list to initialize. * \param node The node to insert. */

Swap value i in this node with value j in node x.

void judy_abort (char *msg) __attribute__ ((noreturn)); // Tell static analyser that this function will not return

* Searches an element in the trie. * You have to provide the key of the element you want to find. * If more elements with the same key are present,

Utility routines.

Attempt to insert a key/data pair into the B+ tree. This function is the same as the other insert, however if key_type == data_type then the non-templ

True if the node's slots are full