Lines Matching refs:heap_index
31 * heap_index]. We assume that always radix_index <= heap_index. McCreight's PST
34 * overcome by using the size, i.e., heap_index - radix_index, as part of the
35 * index, so we index the tree using [(radix_index,size), heap_index].
62 * Maximum heap_index that can be stored in a PST with index_bits bits
70 * Extend a priority search tree so that it can store a node with heap_index
161 * required to represent the maximum heap_index. In the worst case, the algo
164 * If a prior node with same radix_index and heap_index is already found in
172 unsigned long radix_index, heap_index;
176 get_index(node, &radix_index, &heap_index);
179 heap_index > prio_tree_maxindex(root->index_bits))
180 return prio_tree_expand(root, node, heap_index);
188 if (r_index == radix_index && h_index == heap_index)
191 if (h_index < heap_index ||
192 (h_index == heap_index && r_index > radix_index)) {
201 h_index = heap_index;
202 heap_index = index;
206 index = heap_index - radix_index;
243 * to represent the maximum heap_index.
291 * overlap with the input interval X [radix_index, heap_index]. The enumeration
293 * proportional to # of bits required to represent the maximum heap_index) and
396 * heap_index]. Note that always radix_index <= heap_index. We do a pre-order
