Lines Matching full:there

104     /// guaranteed that there is a place to do an insertion at the specified
107     /// If there is no space in this subtree for the extra piece, the extra tree
115     /// If there is no space in this subtree for the extra piece, the extra tree
120     /// guaranteed that there is a split at Offset.
204     /// guaranteed that there is a place to do an insertion at the specified
207     /// If there is no space in this subtree for the extra piece, the extra tree
215     /// If there is no space in this subtree for the extra piece, the extra tree
220     /// guaranteed that there is a split at Offset.
231 /// guaranteed that there is a place to do an insertion at the specified
234 /// If there is no space in this subtree for the extra piece, the extra tree
237   // Find the insertion point.  We are guaranteed that there is a split at the  in split()
240     // Fastpath for a common case.  There is already a splitpoint at the end.  in split()
252   // If there is already a split point at the specified offset, just return  in split()
274 /// If there is no space in this subtree for the extra piece, the extra tree
280     // Find the insertion point.  We are guaranteed that there is a split at the  in insert()
336 /// guaranteed that there is a split at Offset.
338   // Since we are guaranteed that there is a split at Offset, we start by  in erase()
339   // finding the Piece that starts there.  in erase()
441     /// guaranteed that there is a place to do an insertion at the specified
444     /// If there is no space in this subtree for the extra piece, the extra tree
452     /// If there is no space in this subtree for the extra piece, the extra tree
461     /// guaranteed that there is a split at Offset.
472 /// guaranteed that there is a place to do an insertion at the specified
475 /// If there is no space in this subtree for the extra piece, the extra tree
487   // If already split there, we're done.  in split()
501 /// If there is no space in this subtree for the extra piece, the extra tree
505   // Find the insertion point.  We are guaranteed that there is a split at the  in insert()
571 /// guaranteed that there is a split at Offset.
628 /// guaranteed that there is a place to do an insertion at the specified
631 /// If there is no space in this subtree for the extra piece, the extra tree
644 /// If there is no space in this subtree for the extra piece, the extra tree
655 /// guaranteed that there is a split at Offset.