I'm about to implement a map structure that holds unique ID's (integers) for the keys. Well, there's several ways to do this, but I'm looking for the fastest one (in respect to lookups).
I think that a binary tree would be fast, but I'm not sure if it is the fastest - does anyone have a better idea/other solution ?
I was thinking about a hash table to...
The tree structure is assumed to hold around 25000 entries.
The ID's are NOT sequentially (TList's etc. can't do)