Lines Matching refs:gap
769 gap, index, hc, bucket: Integer;
784 // gap refers to the hole that needs filling-in by shifting items down.
787 // our gap and our index (so that they'd be moved before their bucket).
788 // We move the item at index into the gap, whereupon the new gap is
795 gap := index;
807 if not InCircularRange(gap, bucket, index) then
809 FItems[gap] := FItems[index];
810 gap := index;
811 // The gap moved, but we still need to find it to terminate.
812 FItems[gap].HashCode := 0;
816 FItems[gap].HashCode := 0;
817 FItems[gap].Key := Default(TKey);
818 oldValue := FItems[gap].Value;
819 FItems[gap].Value := Default(TValue);
