[Gamer_Z]

Quote:

Originally Posted by kurta999 Okey, and it won't be slow if I use ~1500cmd with this method?

if a normal programwhich has thousands of function isn't slow, why should this be?
But ye, about the map: the more you store the slower the lookup.

The lookup time is O(Log(n)) with n the amount of items in the container.

To make it easier, let's say we have 100 commands in the list, this is our base for now. The lookup time will be 2.
if we have 10000 commands in the list, the lookup time will be 4. which is just 2 times slower than when we have 100 commands in the map.

Here would be a theoretical graph of access times(y) according to the amount of commands(x):



for an unordered map, if you hashing function is good, the access time will be O(1) [so always be the same], however - worst case O(n) [proportional to the amount of items in the container]. In an unordered map you trade size for speed so beware of the memory hit.