[Haskell-cafe] Pure hashtable library
jules at jellybean.co.uk
Thu Aug 28 01:45:22 EDT 2008
Jason Dusek wrote:
> I would much rather have a pure Trie that is foldable. If we
> have a Trie, we get a space efficient sorted list, too.
Well, Data.Sequence can be used as a space efficient sorted list which
is Foldable - if you make the decision to insert elements into it in a
sorted way, obviously.
It's a fingertree not a trie, of course.
What advantages would a Trie have over Data.Sequence?
More information about the Haskell-Cafe