patch applied (packages/containers): O(n) fromAscList IntSet /
IntMap
Ian Lynagh
igloo at earth.li
Fri Jan 16 18:10:33 EST 2009
Wed May 21 12:59:41 PDT 2008 sedillard at gmail.com
* O(n) fromAscList IntSet / IntMap
Added algorithm by Scott Dillard and Bertram Felgenhauer to build IntSets and
IntMaps from sorted input in linear time. Also changed quickcheck prop_Ordered
(no longer a tautology!) to include negative and duplicate keys.
M ./Data/IntMap.hs -12 +40
M ./Data/IntSet.hs -7 +32
M ./Data/Set.hs +1
View patch online:
http://darcs.haskell.org/packages/containers/_darcs/patches/20080521195941-889e6-68b4cf584ea08486fd109d09f56b0261ebfb4d1f.gz
More information about the Cvs-libraries
mailing list