Hmmm, after hearing the responses above, I bet that the memory differences come from both a) floats are larger than short strings and b) there is more structure involved in this hash, which is what is causing the faster lookup times.
Also, you might want to correct the labels in your benchmarks, lest we be led astray!
Thanks!
Dean
If we didn't reinvent the wheel, we wouldn't have rollerblades.
In reply to Re: Re: constructing large hashes
by duelafn
in thread constructing large hashes
by duelafn
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |