Thanks Don...<br>You are amazing... o_O always so quick with replies...<br>I was using GraphViz to generate some directed graphs*, knowing what to use for a dict/map will help speed things up!<br>Cetin<br><br>* (for analytic tableaux in Okitsune+)<br>
+ (need a better name, maybe I should ask Haskell-Cafe for one in the near future)<br><br><div class="gmail_quote">2008/4/23 Don Stewart &lt;<a href="mailto:dons@galois.com">dons@galois.com</a>&gt;:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
cetin.sert:<br>
<div class="Ih2E3d">&gt; &nbsp; &nbsp;Dear Haskell Devs ^_^,<br>
&gt;<br>
&gt; &nbsp; &nbsp;1) what is the most performant lookup table/hashtable/dictionary solution<br>
&gt; &nbsp; &nbsp;for Haskell?<br>
<br>
</div>Data.IntMap is awfully good.<br>
<div class="Ih2E3d"><br>
&gt; &nbsp; &nbsp;1.1) should I use size-balanced binary trees for that or is there a more<br>
&gt; &nbsp; &nbsp;common way?<br>
<br>
</div>I would. Data.Map/Data.IntMap<br>
<div class="Ih2E3d"><br>
&gt; &nbsp; &nbsp;2) are there any established style guidelines for haskell code?<br>
<br>
</div><a href="http://haskell.org/haskellwiki/Category:Style" target="_blank">http://haskell.org/haskellwiki/Category:Style</a><br>
<br>
Or pick an author you like, and look at their code on<br>
<a href="http://hackage.haskell.org" target="_blank">hackage.haskell.org</a><br>
<font color="#888888"><br>
<br>
-- Don<br>
</font></blockquote></div><br>