Log Message:
## [0.2.19.1] – April 2022

* [Fix bug in `intersection[With[Key]]`]

* [Improve docs of bit twiddling functions]

## [0.2.19.0] – April 2022

* [Make intersections much faster]

* [Fix undefined behaviour on 32-bit platforms]

* Speed up some array-appending operations: [#407]

* [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