vector-algorithms

Efficient algorithms for vector arrays

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

Version on this page:	0.8.0.3
LTS Haskell 22.39:	0.9.0.2@rev:1
Stackage Nightly 2024-10-31:	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.8.0.3@sha256:477ef5ac82fdd28a39536ed0a767faec3425802827abee485be31db5bc6f5e90,3488

Module documentation for 0.8.0.3

Data
- Data.Vector
  - Data.Vector.Algorithms

Depends on 4 packages(full list with versions):

base, bytestring, primitive, vector

Used by 9 packages in lts-15.3(full list with versions):

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

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

Changes

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.