vector-algorithms

Efficient algorithms for vector arrays

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

Version on this page:	0.8.0.2
LTS Haskell 22.17:	0.9.0.1@rev:3
Stackage Nightly 2024-04-19:	0.9.0.1@rev:3
Latest on Hackage:	0.9.0.1@rev: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.2@sha256:0b1636af773b62b0f8f7c9ac60b55c4c9a29a842437f7f4eb956b2c6eeb34811,3488

Module documentation for 0.8.0.2

Data
- Data.Vector
  - Data.Vector.Algorithms

Depends on 4 packages(full list with versions):

base, bytestring, primitive, vector

Used by 7 packages in nightly-2019-11-28(full list with versions):

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

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.