Releases: haskell-unordered-containers/unordered-containers
Releases · haskell-unordered-containers/unordered-containers
0.2.20.1
-
Fix infinite loop in
isSubmapOf[By]/isSubsetOfon 32-bit platforms.
To fix this bug and potentially other similar bugs, we return to a branching factor of 16 on 32-bit platforms. -
Documentation changes:
0.2.19.1
0.2.19.0
0.2.18.0
-
unionArrayBy: Find next 1-bits withcountTrailingZeros- This speeds up
union*for sparsely filled nodes, while penalizingunionoperations on densely filled nodes.
- This speeds up
0.2.17.0
0.2.16.0
0.2.15.0
0.2.14.0
-
Add
HashMap.mapKeys. Thanks, Marco Perone! -
Add instances for
NFData1andNFData2. Thanks, Isaac Elliott and Oleg Grenrus!
0.2.13.0
- Add
HashMap.compose. Thanks Alexandre Esteves.
0.2.12.0
-
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.