Don't worry, hashes are among the fastest structures for such lookup purposes — provided you use them correctly, i.e. don't search/iterate through all the keys to check if an entry exists ;)
In reply to Re: need for speed - how fast is a hash
by Anonyrnous Monk
in thread need for speed - how fast is a hash
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |