Comments on: Some initial tests of Tries http://coder.bsimmons.name/blog/2009/04/some-initial-tests-of-tries/ fragmentary ideas ䷿ intellectual what-nots ䷷ and haskell programming ䷴ Thu, 22 Jul 2010 21:36:05 +0000 http://wordpress.org/?v=2.9.1 hourly 1 By: Initial tests of Tries: Follow Up - LAMBDAPHONE http://coder.bsimmons.name/blog/2009/04/some-initial-tests-of-tries/comment-page-1/#comment-26 Initial tests of Tries: Follow Up - LAMBDAPHONE Sat, 18 Apr 2009 20:23:11 +0000 http://coder.bsimmons.name/blog/?p=96#comment-26 [...] is to wrap up my previous post about Tries and my attempts at an implementation, and to summarize some of the things I think I learned about [...]

blockquote {
margin: 2em;
padding: .1em 1.5em;
position: relative;
background: #2F2F2F;
}
">

[...] is to wrap up my previous post about Tries and my attempts at an implementation, and to summarize some of the things I think I learned about [...]

]]> By: jberryman http://coder.bsimmons.name/blog/2009/04/some-initial-tests-of-tries/comment-page-1/#comment-25 jberryman Thu, 16 Apr 2009 21:05:39 +0000 http://coder.bsimmons.name/blog/?p=96#comment-25 Another update. I realized that the Value field in Data.Map is not strict like I was assuming. This might be giving Data.Map an edge in this test. Another update. I realized that the Value field in Data.Map is not strict like I was assuming. This might be giving Data.Map an edge in this test.

]]> By: jberryman http://coder.bsimmons.name/blog/2009/04/some-initial-tests-of-tries/comment-page-1/#comment-24 jberryman Thu, 16 Apr 2009 19:41:23 +0000 http://coder.bsimmons.name/blog/?p=96#comment-24 Updated post with results of testing association lists, vs Data.Maps vs. simple unbalanced binary trees for storing branches. The small input text had 17,000+ words. Maybe it would be interesting to see at what point unbalanced trees or lists become more efficient. Updated post with results of testing association lists, vs Data.Maps vs. simple unbalanced binary trees for storing branches. The small input text had 17,000+ words. Maybe it would be interesting to see at what point unbalanced trees or lists become more efficient.

]]> By: Magnus Jonsson http://coder.bsimmons.name/blog/2009/04/some-initial-tests-of-tries/comment-page-1/#comment-23 Magnus Jonsson Thu, 16 Apr 2009 13:24:26 +0000 http://coder.bsimmons.name/blog/?p=96#comment-23 jberryman, I don't think ghci does very many optimizations, so you may be giving yourself a harder challenge than necessary. Data.Map would lose against itself. jberryman, I don’t think ghci does very many optimizations, so you may be giving yourself a harder challenge than necessary. Data.Map would lose against itself.

]]> By: augustss http://coder.bsimmons.name/blog/2009/04/some-initial-tests-of-tries/comment-page-1/#comment-22 augustss Thu, 16 Apr 2009 08:24:05 +0000 http://coder.bsimmons.name/blog/?p=96#comment-22 Never use ghci for testing performance. Use compilation with optimization. Never use ghci for testing performance. Use compilation with optimization.

]]>