Lines Matching refs:Item
170 function BinarySearch(const Item: T; out Index: Integer): Boolean; overload;
171 function BinarySearch(const Item: T; out Index: Integer; const AComparer: IComparer<T>): Boolean; overload;
389 function InCircularRange(Bottom, Item, TopInc: Integer): Boolean;
500 Item: T;
502 for Item in List do
504 Insert(Index, Item);
721 item: TPair<TKey,TValue>;
724 for item in Collection do
725 AddOrSetValue(item.Key, item.Value);
732 item: TPair<TKey,TValue>;
735 for item in Collection do
736 AddOrSetValue(item.Key, item.Value);
760 function InCircularRange(Bottom, Item, TopInc: Integer): Boolean;
762 Result := (Bottom < Item) and (Item <= TopInc) // normal
763 or (TopInc < Bottom) and (Item > Bottom) // top wrapped
764 or (TopInc < Bottom) and (Item <= TopInc) // top and item wrapped
777 // Removing item from linear probe hash table is moderately
788 // We move the item at index into the gap, whereupon the new gap is
