From: Nick Brown Date: 2011-02-26T04:30:54+09:00 Subject: Re: Are Hash speeds documented? Robert Klemme wrote in post #983928: > Are you familiar with hashing in general? Sure (abstractly), but there are different ways it could be implemented. A hash map to binary trees will have faster lookup times than a hash map to arrays ("associative array")... at least it would when you're using huge amounts of data and dealing with substantial hash collisions (like me). > You can't modify internal workings of the built in Hash class unless you > start patching the C code. But of course you can create your own > implementation for custom cases. I believe Java at least lets you tune its hashmap by altering some constants at creation time. I hadn't heard about anything like this in Ruby but it sure would be nice. So it sounds like there is neither data on costs nor tuning capability available in Ruby. Maybe I'll write an uber-hash while I'm waiting on this script to finish running and share it with you all :-) -- Posted via http://www.ruby-forum.com/.