vector-algorithms

Efficient algorithms for vector arrays

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

Version on this page:0.8.0.2
LTS Haskell 24.1:0.9.1.0
Stackage Nightly 2025-07-25:0.9.1.0
Latest on Hackage:0.9.1.0

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.8.0.2@sha256:0b1636af773b62b0f8f7c9ac60b55c4c9a29a842437f7f4eb956b2c6eeb34811,3488

Module documentation for 0.8.0.2

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

Changes

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.