Jan-Willem Maessen wrote:
Just to clarify: divide and conquer splits one tree on the root value of
the other (possibly avoiding enforcing the balance metric until after
joining trees, though not obvious how / if that's useful)? The
definition of divide and conquer on trees without a fixed
Jan-Willem Maessen wrote:
On Apr 24, 2008, at 11:33 AM, Adrian Hey wrote:
Also, if you're likely to be using union/intersection a lot you should
know that Data.Map/Set are very slow for this because they use the
not efficient hedge algorithm :-)
OK, I'm going to bite here: What's the
On Apr 26, 2008, at 7:41 AM, Adrian Hey wrote:
Jan-Willem Maessen wrote:
On Apr 24, 2008, at 11:33 AM, Adrian Hey wrote:
Also, if you're likely to be using union/intersection a lot you
should
know that Data.Map/Set are very slow for this because they use the
not efficient hedge algorithm
On Apr 24, 2008, at 11:33 AM, Adrian Hey wrote:
Also, if you're likely to be using union/intersection a lot you should
know that Data.Map/Set are very slow for this because they use the
not efficient hedge algorithm :-)
OK, I'm going to bite here: What's the efficient algorithm for union
Don Stewart [EMAIL PROTECTED] writes:
1) what is the most performant lookup table/hashtable/dictionary solution
for Haskell?
Data.IntMap is awfully good.
Is it benchmarked anywhere? Compared to the Judy bindings, or Adrian
Hey's AVL trees, or Data.Hashtable?
I rewrote (roughly) a
On Apr 24, 2008, at 2:31 , Ketil Malde wrote:
Don Stewart [EMAIL PROTECTED] writes:
1) what is the most performant lookup table/hashtable/
dictionary solution
for Haskell?
Data.IntMap is awfully good.
Is it benchmarked anywhere? Compared to the Judy bindings, or Adrian
Hey's AVL
What are good options for concurrent dictionaries? A while ago i wrote
a concurrent hash table prototype, but there are probably better
solutions for Haskell.
Regards,
Felix
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Ketil Malde wrote:
Don Stewart [EMAIL PROTECTED] writes:
1) what is the most performant lookup table/hashtable/dictionary solution
for Haskell?
Data.IntMap is awfully good.
Is it benchmarked anywhere? Compared to the Judy bindings, or Adrian
Hey's AVL trees, or Data.Hashtable?
Dear Haskell Devs ^_^,
1) what is the most performant lookup table/hashtable/dictionary solution
for Haskell?
1.1) should I use size-balanced binary trees for that or is there a more
common way?
2) are there any established style guidelines for haskell code?
Best Regards,
Cetin Sert
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)
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
11 matches
Mail list logo
