[Haskell-cafe] lookup tables & style guidelines

[Cetin Sert]

Thanks Don...
You are amazing... o_O always so quick with replies...
I was using GraphViz to generate some directed graphs*, knowing what to use
for a dict/map will help speed things up!
Cetin

* (for analytic tableaux in Okitsune+)
+ (need a better name, maybe I should ask Haskell-Cafe for one in the near
future)

2008/4/23 Don Stewart <dons at galois.com>:

> cetin.sert:
> >    Dear Haskell Devs ^_^,
> >
> >    1) what is the most performant lookup table/hashtable/dictionary
> solution
> >    for Haskell?
>
> Data.IntMap is awfully good.
>
> >    1.1) should I use size-balanced binary trees for that or is there a
> more
> >    common way?
>
> I would. Data.Map/Data.IntMap
>
> >    2) are there any established style guidelines for haskell code?
>
> http://haskell.org/haskellwiki/Category:Style
>
> Or pick an author you like, and look at their code on
> hackage.haskell.org
>
>
> -- Don
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20080423/9ae7c40d/attachment.htm