
23 Apr
2008
23 Apr
'08
4:36 p.m.
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