Lines Matching refs:HashCode

242         HashCode: Integer;
256     function GetBucketIndex(const Key: TKey; HashCode: Integer): Integer;  in GetBucketIndex()
258     procedure RehashAdd(HashCode: Integer; const Key: TKey; const Value: TValue);
259     procedure DoAdd(HashCode, Index: Integer; const Key: TKey; const Value: TValue);  argument
567     if oldItems[i].HashCode <> 0 then
568       RehashAdd(oldItems[i].HashCode, oldItems[i].Key, oldItems[i].Value);
599 function TDictionary<TKey,TValue>.GetBucketIndex(const Key: TKey; HashCode: Integer): Integer;  in TDictionary()
606   start := HashCode and (Length(FItems) - 1);
610     hc := FItems[Result].HashCode;
617     if (hc = HashCode) and FComparer.Equals(FItems[Result].Key, Key) then
664 procedure TDictionary<TKey,TValue>.RehashAdd(HashCode: Integer; const Key: TKey; const Value: TValu…
668   index := not GetBucketIndex(Key, HashCode);
669   FItems[index].HashCode := HashCode;
793   FItems[index].HashCode := 0;
802     hc := FItems[index].HashCode;
812       FItems[gap].HashCode := 0;
816   FItems[gap].HashCode := 0;
848 procedure TDictionary<TKey,TValue>.DoAdd(HashCode, Index: Integer; const Key: TKey; const Value: TV…  argument
850   FItems[Index].HashCode := HashCode;
882     if (FItems[i].HashCode <> 0) and c.Equals(FItems[i].Value, Value) then
922     if FDictionary.FItems[FIndex].HashCode <> 0 then