Releases: haskell-unordered-containers/unordered-containers
Releases · haskell-unordered-containers/unordered-containers
0.2.21
-
API enhancements:
-
Performance improvements:
-
Documentation changes:
-
Other changes:
- Drop support for GHC < 8.10
- Address deprecation warnings and other warnings
- Optimize indexing in arrays of length 2
- Introduce
ShiftedHash - New "fine-grained" benchmarks
- Make it compile with MicroHs. Thanks, @augustss!
- Remove redundant
Eqconstraints - Refactor
delete difference[With]: Undo constraint relaxation
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.