Lines Matching full:nodes
44 * The B-Tree has two types of nodes: core nodes, and leaf nodes. Core
45 * nodes have an array of children pointing to other nodes, and an array of
47 * at its children. Leaf nodes only contain data elements, and form the bottom
49 * elements in the core nodes are not copies of or references to leaf node
76 * Set to -1 to indicate core nodes. Other values represent first
77 * valid element offset for leaf nodes.
81 * For both leaf and core nodes, represents the number of elements in
82 * the node. For core nodes, they will have bth_count + 1 children.
138 * COMP - A comparator to compare two nodes, it must return exactly: -1, 0,
173 * Allocate and deallocate caches for btree nodes.
182 * compar - function to compare two nodes, it must return exactly: -1, 0, or +1
184 * find - optional function to accelerate searches inside B-Tree nodes
261 * Return the number of nodes in the tree
266 * Used to destroy any remaining nodes in a tree. The cookie argument should
290 * Destroys all nodes in the tree quickly. This doesn't give the caller an