Lines Matching refs:tree

17    - Basic internal tree layout.
66 The implementation uses a tree of 16-pointer nodes internally that are indexed
68 tree.  To improve memory efficiency, shortcuts can be emplaced to skip over
93 preallocated metadata blocks that will be installed in the internal tree and
94 keeps track of the metadata blocks that will be removed from the tree when the
284      The internal tree will be packed down if possible as part of the iteration
331      This walks through the array's internal tree directly to the object
355 The better the scattering, the wider and lower the internal tree will be.
371 The associative array data structure has an internal tree.  This tree is
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
423 Assuming no other meta data nodes in the tree, the key space is divided thusly:
488 It is possible for the root of the tree to be a shortcut - say, for example,
489 the tree contains at least 17 nodes all with key prefix '1111'.  The insertion
504 sufficiently similar, then a shortcut will be inserted into the tree.
516 proceed rootwards through the tree, going to the parent node, slot N + 1 to