10.05.2013, 14:22
Quote:
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 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. |