Comments on: Very fast, scalable mutable maps and hashes for Haskell http://donsbot.wordpress.com/2009/09/26/very-fast-scalable-mutable-maps-and-hashes-for-haskell/ A Journal of Haskell Programming Mon, 03 Oct 2011 02:09:43 +0000 hourly 1 http://wordpress.com/ By: Top Posts « WordPress.com http://donsbot.wordpress.com/2009/09/26/very-fast-scalable-mutable-maps-and-hashes-for-haskell/#comment-222 Tue, 29 Sep 2009 00:38:51 +0000 http://donsbot.wordpress.com/?p=356#comment-222 [...] Very fast, scalable mutable maps and hashes for Haskell I’m at HacPDX working on judy, a finite-map like interface to the classic judy arrays library, which provides [...] [...]

]]> By: Fast mutable collections for Haskell: more benchmarks « Control.Monad.Writer http://donsbot.wordpress.com/2009/09/26/very-fast-scalable-mutable-maps-and-hashes-for-haskell/#comment-212 Sun, 27 Sep 2009 19:58:47 +0000 http://donsbot.wordpress.com/?p=356#comment-212 [...] at HacPDX I did more work on the Judy bindings described yesterday. Here is judy 0.2.1 up (lunchtime release). These are bindings to the (in)famous judy arrays [...]

]]> By: dons00 http://donsbot.wordpress.com/2009/09/26/very-fast-scalable-mutable-maps-and-hashes-for-haskell/#comment-211 Sun, 27 Sep 2009 15:22:32 +0000 http://donsbot.wordpress.com/?p=356#comment-211 Ben Marsh: the graphs are generated by criterion using the Haskell chart library: http://hackage.haskell.org/package/Chart

]]> By: Ben Marsh http://donsbot.wordpress.com/2009/09/26/very-fast-scalable-mutable-maps-and-hashes-for-haskell/#comment-210 Sun, 27 Sep 2009 13:10:24 +0000 http://donsbot.wordpress.com/?p=356#comment-210 Can you please tell me what you used for doing the graphs in this post?

]]> By: Jason http://donsbot.wordpress.com/2009/09/26/very-fast-scalable-mutable-maps-and-hashes-for-haskell/#comment-208 Sun, 27 Sep 2009 06:30:36 +0000 http://donsbot.wordpress.com/?p=356#comment-208 Interesting. Hopefully you’ll be at HacPDX again tomorrow. I’ve been profiling a bit of darcs code that uses Data.Map but seems to generate a lot of garbage and take a long time. Perhaps with judy arrays we can see significant savings in both dimensions.

]]> By: Max Bolingbroke http://donsbot.wordpress.com/2009/09/26/very-fast-scalable-mutable-maps-and-hashes-for-haskell/#comment-207 Sun, 27 Sep 2009 05:39:57 +0000 http://donsbot.wordpress.com/?p=356#comment-207 I’m also here here to plead for a ST interface. I’ve actually ported Data.HashTable to ST before because I needed a halfway decent mutable collection type – having a properly tested mutable collection that actually performs well would be a godsend.

]]> By: dons00 http://donsbot.wordpress.com/2009/09/26/very-fast-scalable-mutable-maps-and-hashes-for-haskell/#comment-206 Sun, 27 Sep 2009 03:38:09 +0000 http://donsbot.wordpress.com/?p=356#comment-206 There’s no reason for it to be in IO. I’m using the IO as a base layer, but the plan is to add a freeze(), and an ST mode.

How does that sound?

]]> By: augustss http://donsbot.wordpress.com/2009/09/26/very-fast-scalable-mutable-maps-and-hashes-for-haskell/#comment-205 Sun, 27 Sep 2009 03:27:53 +0000 http://donsbot.wordpress.com/?p=356#comment-205 I wish the bindings were not in IO, but in some monad with a run. Is there something fundamental about Judy that forces IO? Like global variables?

]]>