Is there a generic equivalent to THashedStringList?

[asdf121]

Hello,
I've some working code with a THashedStringList (was TStringList before) which is used to save a few hundreds of last inputs on my service. It's used to avoid double entries in a fast way with the hashing.
Now I was thinking about using a generic version like TDictionary for it as it has a better readability and I've read that you should better use generics if you write new code/do a refactoring.

So I'm adding my key=value pair to the THashedStringList as

Code: Pascal  [Select][+][-]

1. Insert(0, key + '=' + value);

For cleanup I use the following code:

Code: Pascal  [Select][+][-]

1.       i := THashedStringList.Count - 1;
2.       if i > 1000 then
3.       begin
4.         while i > 500 do
5.         begin
6.           THashedStringList.Delete(i);
7.           i := THashedStringList.Count - 1;
8.         end;
9.       end;

For the key and value I do

Code: Pascal  [Select][+][-]

1. i := IndexOfName(key);
2. value := ValueFromIndex[i];

But now my question, is there any equivalent version which uses generics where I can delete the oldest entries like I actually do?

I thought about using TDictionary<int id, TRecord<key,value>> but then I don't benefit from the hashing and have to think about the insertion of id. The same issue with hashing when I use a TList with TDictionary entries.

Thanks in advance! 

[Thaddy]

From generics.collections
- THashMap
- TFastHashMap
- TObjectHashMap
- THashSet may also be an option

[asdf121]

Oh, seems I forgot to mention that it should work in FPC and Delphi. 

[Thaddy]

generics.collections is supposed to be Delphi compatible? But indeed, Delphi lags a bit. In that case your stuck with a TList<T> or a TDictionary<Tkey,TValue>