Lines Matching refs:pointers

11 1. Objects are opaque pointers.  The implementation does not care where they
52 pack leaf object pointers into spare space in the node rather than making an
187 pointers internally.
340 can contain mixtures of leaves and metadata pointers.
434 pointers - even if some of those leaves would like to be in the same slot.
436 A node can contain a heterogeneous mix of leaves and metadata pointers.
437 Metadata pointers must be in the slots that match their subdivisions of key
477 Each node has a maximum capacity of 16 leaves and metadata pointers.  If the
523    new layout until we follow the back pointers - at which point we've
525    leaves in a node before following any of its metadata pointers).
531    This won't affect us until we follow the back pointers.  Similar to (4).
534    back pointers will get us back to the parent of the new node before we