-
Remove redundant
Hashable
constraints fromintersection.*
andunion.*
. -
Various optimizations and cleanups: #458, #469, #404, #460, #456, #433
0.2.19.1 – April 2022
0.2.19.0 – April 2022
-
unionArrayBy
: Find next 1-bits withcountTrailingZeros
- This speeds up
union*
for sparsely filled nodes, while penalizingunion
operations on densely filled nodes.
- This speeds up
-
Various cleanup and documentation improvements
-
Add
HashMap.mapKeys
. Thanks, Marco Perone! -
Add instances for
NFData1
andNFData2
. Thanks, Isaac Elliott and Oleg Grenrus! -
Fix
@since
-annotation forcompose
. Thanks, @Mathnerd314!
- Add
HashMap.compose
. Thanks Alexandre Esteves.
-
Add
HashMap.isSubmapOf[By]
andHashSet.isSubsetOf
. Thanks Sven Keidel. (#282) -
Expose internal modules. (#283)
-
Documentation improvements in
Data.HashSet
, including a beginner-friendly introduction. Thanks Matt Renaud. (#267) -
HashMap.alterF
: Skip key deletion for absent keys. (#288) -
Remove custom
unsafeShift{L,R}
definitions. (#281) -
Various other documentation improvements.
-
Add
HashMap.findWithDefault
(soft-deprecatesHashMap.lookupDefault
). Thanks, Matt Renaud. -
Add
HashMap.fromListWithKey
. Thanks, Josef Svenningsson. -
Add more folding functions and use them in
Foldable
instances. Thanks, David Feuer. -
Add
HashMap.!?
, a flipped version oflookup
. Thanks, Matt Renaud. -
Add a
Bifoldable
instance forHashMap
. Thanks, Joseph Sible. -
Add a
HasCallStack
constraint to(!)
. Thanks, Roman Cheplyaka.
-
Fix a space leak affecting updates on keys with hash collisions. Thanks, Neil Mitchell. (#254)
-
Get rid of some silly thunks that could be left lying around. (#232). Thanks, David Feuer.
-
Speed up the
Hashable
instances forHashMap
andHashSet
. Thanks, Edward Amsden. -
Remove a dependency cycle hack from the benchmark suite. Thanks, Andrew Martin.
-
Improve documentation. Thanks, Tristan McLeay, Li-yao Xia, Gareth Smith, Simon Jakobi, Sergey Vinokurov, and likely others.
-
Add
HashMap.alterF
. -
Add
HashMap.keysSet
. -
Make
HashMap.Strict.traverseWithKey
force the results before installing them in the map.
-
Add
Ord/Ord1/Ord2
instances. (Thanks, Oleg Grenrus) -
Use
SmallArray#
instead ofArray#
for GHC versions 7.10 and above. (Thanks, Dmitry Ivanov) -
Adjust for
Semigroup => Monoid
proposal implementation. (Thanks, Ryan Scott)
-
Fix a strictness bug in
fromListWith
. -
Enable eager blackholing for pre-8.2 GHC versions to work around a runtime system bug. (Thanks, Ben Gamari)
-
Avoid sketchy reimplementation of
ST
when compiling with recent GHC.
-
Remove support for GHC versions before 7.8. (Thanks, Dmitry Ivanov)
-
Add internal documentaton. (Thanks, Johan Tibell)
-
Add
Eq1/2
,Show1/2
,Read1
instances withbase-4.9
-
Eq (HashSet a)
doesn't requireHashable a
anymore, onlyEq a
. -
Add
Hashable1/2
withhashable-1.2.6.0
-
Add
differenceWith
function.
-
Don't use -fregs-graphs
-
Fix benchmark compilation on stack.
-
Fix linker error related to popcnt.
-
Haddock improvements.
-
Fix benchmark compilation when downloaded from Hackage.
-
Support criterion 1.1
-
Add unionWithKey for hash maps.
-
Mark several modules as Trustworthy.
-
Add Hashable instances for HashMap and HashSet.
-
Add mapMaybe, mapMaybeWithKey, update, alter, and intersectionWithKey.
-
Add roles.
-
Add Hashable and Semigroup instances.
- Support base-4.8