Lines Matching refs:nodes
19 - Splitting and collapsing nodes.
66 The implementation uses a tree of 16-pointer nodes internally that are indexed
69 what would otherwise be a series of single-occupancy nodes. Further, nodes
285 to reduce the number of nodes in it.
357 Poor scattering isn't too much of a problem as there are shortcuts and nodes
372 constructed of two types of metadata blocks: nodes and shortcuts.
388 Ignoring shortcuts for the moment, the nodes form a multilevel tree. The index
389 key space is strictly subdivided by the nodes in the tree and nodes occur on
422 In the above example, there are 7 nodes (A-G), each with 16 slots (0-f).
423 Assuming no other meta data nodes in the tree, the key space is divided thusly:
436 the appropriate nodes:
485 is a replacement for a series of single-occupancy nodes ascending through the
489 the tree contains at least 17 nodes all with key prefix '1111'. The insertion
541 (4) Insertion replacing nodes that we're actively processing. This isn't a
550 (5) Insertion replacing nodes that we're processing a dependent branch of.