On Wed, Feb 15, 2006 at 09:42:10AM +0100, Ketil Malde wrote: > > Not sure how relevant this is, but I see there is a recently released > hash library here that might be a candidate for FFIing? > > https://sourceforge.net/projects/goog-sparsehash/ > > | An extremely memory-efficient hash_map implementation. 2 bits/entry > | overhead! The SparseHash library contains several hash-map > | implementations, including implementations that optimize for space > | or speed.
If we want really fast maps, we should be using this. it beats the competition by far: http://judy.sourceforge.net/ John -- John Meacham - ⑆repetae.net⑆john⑈ _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
