Lines Matching defs:tree
77 * into, we construct a binary search tree in an array - traversing a binary
78 * search tree in an array gives excellent locality of reference and is very
86 * when traversing this tree.
88 * Nodes in the auxiliary search tree must contain both a key to compare against
93 * search tree corresponds to precisely BSET_CACHELINE bytes in the set. We have
94 * a function (to_inorder()) that takes the index of a node in a binary tree and
100 * search tree at every iteration we know that both our search key and the key
103 * at the root of the tree).
111 * key our auxiliary search tree node corresponds to, and key p, the key
113 * search tree is the highest bit that differs between n and p.
116 * comparison. But we'd really like our nodes in the auxiliary search tree to be
127 * The keys in the auxiliary search tree are stored in (software) floating
138 * don't want to be constantly rebuilding the search tree for the last set
159 * We construct a binary tree in an array as if the array
165 /* size of the binary tree and prev array */
173 struct bkey_float *tree;
176 * The nodes in the bset tree point to specific keys - this
225 * Sets of sorted keys - the real btree node - plus a binary search tree
227 * set[0] is special; set[0]->tree, set[0]->prev and set[0]->data point