ڧ ܧݧ <funny.falcon / gmail.com> wrote:
> Fixing hash function is much simpler. Unordered hash with open addressing
> could be much faster and have size not bigger than any binary tree
> (simplified specialized khash). Hope that inline hash will fix logarithmic
> search time is ridiculous.

I meant using binary tree for tiny per-class method tables/cache,
not a giant global cache.  I think we'll always need good hash,
so yeah, maybe deriving ID from sym.to_s.hash is better than
current increment.