My sparsepp (https://github.com/greg7mdp/sparsepp) is very compact (low memory usage) and pretty fast, but it doesn't have Haskell bindings. It is a hash map built on a sparse array. Thanks, greg -----Original Message----- From: Haskell-Cafe [mailto:haskell-cafe-bounces@haskell.org] On Behalf Of Ketil Malde Sent: Sunday, April 30, 2017 3:44 AM To: haskell-cafe@haskell.org; biohaskell@biohaskell.org Subject: [Haskell-cafe] hash map/associative structure Hi, I've been using Judy arrays as a fast and even more importatnly, compact associative structure. Infortunately, I'm getting occasional segfaults, and I'm unable to find anything wrong with my code. Others also report something similar. The Debian maintainer of libjudy made a version without some dubious optimizations, but that didn't help...at least not substantially. So the question is, what is a good replacement? I just need Word64 -> Integral, but again, I expect to fill all of main memory with data, so memory compactness is important. Anything using trees and boxed values (e.g. Data.IntMap and friends) out. I only need to be able to insert, modify (add one), and finally extract the key-value pairs (e.g. 'elems'). Any suggestions? -k -- If I haven't seen further, it is by standing in the footprints of giants _______________________________________________ Haskell-Cafe mailing list To (un)subscribe, modify options or view archives go to: http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe Only members subscribed via the mailman list are allowed to post.