Lines Matching full:nodes

45  * The B-Tree has two types of nodes: core nodes, and leaf nodes. Core
46  * nodes have an array of children pointing to other nodes, and an array of
48  * at its children. Leaf nodes only contain data elements, and form the bottom
50  * elements in the core nodes are not copies of or references to leaf node
77 	 * Set to -1 to indicate core nodes. Other values represent first
78 	 * valid element offset for leaf nodes.
82 	 * For both leaf and core nodes, represents the number of elements in
83 	 * the node. For core nodes, they will have bth_count + 1 children.
139  * COMP   - A comparator to compare two nodes, it must return exactly: -1, 0,
174  * Allocate and deallocate caches for btree nodes.
183  * compar - function to compare two nodes, it must return exactly: -1, 0, or +1
185  * find   - optional function to accelerate searches inside B-Tree nodes
262  * Return the number of nodes in the tree
267  * Used to destroy any remaining nodes in a tree. The cookie argument should
291  * Destroys all nodes in the tree quickly. This doesn't give the caller an