Lines Matching full:auxiliary

47  * We implement code here for creating and maintaining auxiliary search trees
60  * AUXILIARY SEARCH TREES:
88  * Nodes in the auxiliary search tree must contain both a key to compare against
111  * key our auxiliary search tree node corresponds to, and key p, the key
112  * immediately preceding n.  The lowest bit we need to store in the auxiliary
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
134  * We need one node per 128 bytes in the btree node, which means the auxiliary
137  * Constructing these auxiliary search trees is moderately expensive, and we
142  * within each byte range works the same as with the auxiliary search trees.