vector-algorithms

Efficient algorithms for vector arrays

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

Version on this page:	0.9.0.1@rev:1
LTS Haskell 23.21:	0.9.1.0
Stackage Nightly 2025-05-11:	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.9.0.1@sha256:34cc5851ebf2eb80fc62cbb5c6dbe59ab837f1d5366a6c3bf1e09cf34805aaae,3670

Module documentation for 0.9.0.1

Data
- Data.Vector
  - Data.Vector.Algorithms

Depends on 5 packages(full list with versions):

base, bitvec, bytestring, primitive, vector

Used by 12 packages in nightly-2023-02-03(full list with versions):

criterion, data-sketches, data-sketches-core, dense-linear-algebra, metrics, mono-traversable, OrderedBits, poly, Rasterific, rp-tree, statistics, subcategories

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

Changes

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.