vector-algorithms

Efficient algorithms for vector arrays

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

Version on this page:	0.8.0.4
LTS Haskell 23.5:	0.9.0.3
Stackage Nightly 2025-01-21:	0.9.0.3
Latest on Hackage:	0.9.0.3

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.4@sha256:7d5ce5a56132a6ce18e694c357dde2eadd91a59a0f3d01b18dbd6f078753de0b,3584

Module documentation for 0.8.0.4

Data
- Data.Vector
  - Data.Vector.Algorithms

Depends on 4 packages(full list with versions):

base, bytestring, primitive, vector

Used by 10 packages in lts-17.2(full list with versions):

criterion, dense-linear-algebra, metrics, mono-traversable, poly, Rasterific, sparse-linear-algebra, statistics, subcategories, tdigest

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

Changes

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.