Lines Matching refs:t

145 ``false`` if it doesn't.
174 This initialises the base structure for an associative array.  It can't fail.
272 The function will return ``0`` if successful and ``-ENOMEM`` if there wasn't
326 The index key can be of any form, but since the algorithms aren't told how long
339 Poor scattering isn't too much of a problem as there are shortcuts and nodes
509    The metadata blocks don't change otherwise.  An old leaf won't be freed
513    metadata blocks don't change otherwise.  The old leaf won't be freed until
516 3. Insertion replacing part of a subtree that we haven't yet entered.  This
517    may involve replacement of part of that subtree - but that won't affect
518    the iteration as we won't have reached the pointer to it yet and the
521 4. Insertion replacing nodes that we're actively processing.  This isn't a
522    problem as we've passed the anchoring pointer and won't switch onto the
531    This won't affect us until we follow the back pointers.  Similar to (4).
533 6. Deletion collapsing a branch under us.  This doesn't affect us because the
536    unchanged - and will still be rooted on the same slot, so we shouldn't
546    However, when we're changing a shortcut into a node this isn't a problem
547    as shortcuts only have one slot and so the parent slot number isn't used