BSD-3-Clause licensed by Dan Doel
This version can be pinned in stack with:vector-algorithms-0.9.0.3@sha256:3234811da39ea334aedb0639a8a3aaea91ca544950805cf2f51a41e050a61ab1,3875
Module documentation for 0.9.0.3
Used by 15 packages in
nightly-2024-11-25(full list with versions):
criterion,
data-sketches,
data-sketches-core,
dense-linear-algebra,
harpie,
mealy,
metrics,
mono-traversable,
OrderedBits,
poly,
Rasterific,
rp-tree,
statistics,
subcategories,
tdigest Efficient algorithms for sorting vector arrays. At some stage
other vector algorithms may be added.
Version 0.9.0.3 (2024-11-25)
- Fix an off-by-one error Heap.partialSort functions.
- Support latest ghcs.
Version 0.9.0.2 (2024-05-23)
- Add
TypeOperators pragma where needed.
Version 0.9.0.1 (2022-07-28)
- Allow building with vector-0.13.*.
Version 0.9.0.0 (2022-05-19)
- Add nub related functions.
- Add sortUniq related functions (sorts, then removes duplicates).
Version 0.8.0.4 (2020-12-06)
- Fix out of range access in Intro.partialSort.
- Update QuickCheck dependency bounds.
Version 0.8.0.3 (2019-12-02)
- Fix out-of-bounds access in Timsort.
Version 0.8.0.2 (2019-11-28)
- Bump upper bounds on primitive and QuickCheck.
- Expose ‘terminate’ function from ‘AmericanFlag’ module.
- Fix an off-by-one error in Data.Vector.Algorithms.Heaps.heapInsert.
