From: Roger Pack <rogerpack2005@...>
Date: 2009-12-17T08:53:28+09:00
Subject: Re: [ANN] google_hash 0.1.1 -- it has a #each!

Aldric Giacomoni wrote:
> Roger Pack wrote:
>> Pleased to announce the initial release of a "google_hash" gem.

> Neat. Does it keep the order in which the elements were entered? Is it
> sortable?

Nope.  What would be the requirements for something you're looking for?

Shot wrote:
> I have a big need for a fast Set of integers/bignums

You just need fast iteration? Fast insertion?

Yeah it should be doable.

The google hash lib itself has both Hashes and Sets--I just have focused 
on the Hash stuff as of yet, but hope to do them all (with more types) 
eventually.

With just int (or double) you could reasonably easily store your keys 
and/oor values as native.

With Bignum I'm not totally sure how they're stored in memory, but with 
some hacking it is probably possible to "store them away" (i.e. store a 
copy of them on entry so that Ruby is no longer memory tracking them).

What would the ideal be in terms of requirements? (oh and feel free to 
checkout the code/fork/file issues -- http://github.com/rdp/google_hash 
)

Enjoy.
-r
-- 
Posted via http://www.ruby-forum.com/.