--------------------------------------------
-- bytestring-trie 0.2.2 (major bugfix)
--------------------------------------------
Another release for efficient finite maps from (byte)strings to values.
This version corrects a major bug affecting all users who merge tries.
--------------------------------------------
-- Changes (since 0.1.4)
--------------------------------------------
* Corrected a major bug in mergeBy which caused conflicting values to be
merged in the wrong order. Since this is a core function, all other
merging-based functions are affected as well (e.g., unionR, unionL,...).
The bug was filed by Gregory Crosswhite (thanks!).
* added Data.Trie.Convenience.fromListWith --- A variant of 'fromListR'
that takes a function for combining values on conflict.
* generalized the type of toListBy
* removed KeyString and KeyElem aliases
* documentation tweaks
--------------------------------------------
-- Future work
--------------------------------------------
* Worked on explicit definitions for foldl and foldr, as opposed to the
default definitions given by Foldable using Endo. The suggested
definitions are around 3x faster than the old definitions, however the
order of folding is different than foldrWithKey (which seems to have the
correct order). These definitions are not currently being used, but
perhaps the future will see faster folding functions for Tries.
--------------------------------------------
-- Links
--------------------------------------------
Homepage:
http://code.haskell.org/~wren/
Hackage:
http://hackage.haskell.org/package/bytestring-trie
Darcs:
http://community.haskell.org/~wren/bytestring-trie/
Haddock (Darcs version):
http://community.haskell.org/~wren/bytestring-trie/dist/doc/html/bytestring-trie/
--
Live well,
~wren
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
