vector-algorithms

Efficient algorithms for vector arrays

https://github.com/erikd/vector-algorithms/

Version on this page:0.9.0.2
LTS Haskell 22.26:0.9.0.2@rev:1
Stackage Nightly 2024-06-17:0.9.0.2@rev:1
Latest on Hackage:0.9.0.2@rev:1

See all snapshots vector-algorithms appears in

BSD-3-Clause licensed by Dan Doel
Maintained by Dan Doel <[email protected]> Erik de Castro Lopo
This version can be pinned in stack with:vector-algorithms-0.9.0.2@sha256:51fea338a64dd79ac8437753291427706d3b81b46208d6b003156a5cefac7dc8,3859

Module documentation for 0.9.0.2

Efficient algorithms for sorting vector arrays. At some stage other vector algorithms may be added.

Changes

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.