Bot releases are visible (Hide)
foldr'
and foldl'
for Map
and Set
are now strict everywhere they
should be, and we have detailed tests to make sure they stay that way.
(Thanks, coot.)
The Ord IntSet
instance, which was broken in 0.6.3.1, has been
repaired.
Ord a => Ord (Tree a)
(Thanks, Ericson2314.)Published by sjakobi about 4 years ago
compose
with lazy variants.
compose
closer in line with functions like union
and intersection
which don't evaluate any map values. (Thanks, Simon Jakobi)Add reverseTopSort
to Data.Graph
(Thanks, James Parker)
Expose traverseMaybeWithKey
from Data.IntMap.{Lazy,Strict}
(Thanks, Simon
Jakobi)
Improvements to the testsuite: #663, #662 (Thanks, Bertram Felgenhauer)
Fix build with stack test
(Thanks, Simon Jakobi)
Published by sjakobi over 4 years ago
Fix traverse
and traverseWithKey
for IntMap
, which would
previously produce invalid IntMap
s when the input contained
negative keys (Thanks, Felix Paulusma).
Fix the traversal order of various functions for Data.IntMap
:
traverseWithKey
, traverseMaybeWithKey
, filterWithKeyA
,
minimum
, maximum
, mapAccum
, mapAccumWithKey
, mapAccumL
,
mapAccumRWithKey
, mergeA
(Thanks, Felix Paulusma, Simon Jakobi).
Add compose
for Map
and IntMap
(Thanks, Alexandre Esteves).
Add alterF
for Set
and IntSet
(Thanks, Simon Jakobi).
Add Data.IntSet.mapMonotonic
(Thanks, Javran Cheng).
Add instance Bifoldable Map
(Thanks, Joseph C. Sible).
Make (<*)
for Data.Sequence
incrementally asymptotically optimal.
This finally completes the task, begun in December 2014, of making all
the Applicative
methods for sequences asymptotically optimal
even when their results are consumed incrementally. Many thanks to
Li-Yao Xia and Bertram Felgenhauer for helping to clean up and begin
to document this rather tricky code.
Speed up fromList
and related functions in Data.IntSet
, Data.IntMap
and Data.IntMap.Strict
(Thanks, Bertram Felgenhauer).
Use count{Leading,Trailing}Zeros
in Data.IntSet
internals (Thanks, Alex
Biehl).
Reduce usage of the Forest
type synonym in Data.Tree
(Thanks, David
Feuer).
Address a Core lint warning for foldToMaybeTree
(Thanks, Matthew Pickering).
Improve documentation (Thanks to Daniel Wagner, Johannes Waldmann, Steve Mao,
Gabriel Greif, Jean-Baptiste Mazon, Ziyang Liu, Matt Renaud, Li-Yao Xia).
Improvements to the testsuite and benchmarks (Thanks, Bertram Felgenhauer,
Simon Jakobi, Johannes Waldmann).
Canonicalise Seq
's Monoid
instance (Thanks, Fumiaki Kinoshita).
Published by treeowl over 6 years ago
Published by treeowl about 8 years ago