>>57 constant time insertion, lookup, and deletion.
If you're using array as storage, insertion is just adding more cells at the end or replacing unused(zero) cells
while deletion is zeroing the cell.Lookup is obviously faster(its just goto base+index*cell_size) while hashmap require spending time with hashfunctions.
_______________________________________
http://bayimg.com/image/aadbjaace.jpg
Velox Et Astrum gamedev forum:
http://etastrum.phpbb3now.com
Doctor, will you tell these fools? I'm not crazy. Make them listen to me before it's too late.