0.2.21

• API enhancements:

  • Add HashMap.lookupKey and HashSet.lookupElement
  • Add differenceWithKey
  • Add disjoint

• Performance improvements:

  • HashSet.fromList: Use unsafeInsert
  • Use tree-diffing for difference
  • Remove some unnecessary forcing of HashMaps
  • Remove the Array.index function
  • hashWithSalt: Ensure that the salt Int is unboxed

• Documentation changes:

  • Turn some comments into docstrings
  • Reword disclaimer regarding hash collision attacks
  • Update time complexity of some HashSet functions
  • Update instructions for code inspection

• 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 Eq constraints
  • Refactor delete
  • difference[With]: Undo constraint relaxation

0.2.20.1

• Fix infinite loop in isSubmapOf[By] / isSubsetOf on 32-bit platforms.
  To fix this bug and potentially other similar bugs, we return to a branching factor of 16 on 32-bit platforms.

• Relax bounds for GHC 9.12

• Require hashable >= 1.4

• Documentation changes:

  • Fix documentation about branching factor in Data.HashMap.Strict
  • Improve documentation for Data.HashMap.compose
  • Fixes docs of Data.HashMap.Lazy.fromList: it takes O(n * log(n))
  • Add disclaimer to Data.HashSet.toList

• Remove bad isSubmapOf testcase

0.2.19.1

• Fix bug in intersection[With[Key]]

• Improve docs of bit twiddling functions

0.2.19.0

• Make intersections much faster

• Fix undefined behaviour on 32-bit platforms

• Speed up some array-appending operations: #407, #409

• Use MathJax format for complexity annotations

0.2.18.0

• Fix strictness properties of Strict.mapMaybe[WithKey]

• Fix strictness properties of Strict.alterFEager

• Fix space leaks in union[With[Key]]

• Fix space leak in Lazy.fromListWith

• Speed up difference* and intersection* with unsafeInsert

• unionArrayBy: Find next 1-bits with countTrailingZeros

  • This speeds up union* for sparsely filled nodes, while penalizing union operations on densely filled nodes.

• Reduce reboxing in internal array operations

• Reduce code size of array operations in union*

0.2.17.0

• Define dataCast1 for HashMap

• Add Lift instances for Template Haskell

• Add definitions for stimes

• Expose internal constructors for HashSet, Array and MArray

• Tweak internal Array.insertM function

• Drop support for GHC 8.0

• Drop support for hashable < 1.2.5

• Various cleanup and documentation improvements

0.2.16.0

• Increase maximum branching factor from 16 to 32

• Tweak union.goDifferentHash

• Fix debug mode bounds check in cloneM

• Remove some old internal compatibility code

0.2.15.0

• Add security advisory regarding hash collision attacks

• Add support for hashable 1.4

• Drop support for GHC < 8

0.2.14.0

• Add HashMap.mapKeys. Thanks, Marco Perone!

• Add instances for NFData1 and NFData2. Thanks, Isaac Elliott and Oleg Grenrus!

• Fix @since-annotation for compose. Thanks, @Mathnerd314!

0.2.13.0

• Add HashMap.compose. Thanks Alexandre Esteves.