primitive-sort: Sort primitive arrays

[ bsd3, library, software ] [ Propose Tags ]

This library provides a stable sorting algorithm for primitive arrays. When extra capabilities are available, the sort is parallelized.

The algorithm currently uses mergesort on large chunks and switches to insertion sort on small chunks. The are also novel improvements to increase the performance if the input array is already mostly sorted.

[Skip to Readme]


[Index] [Quick Jump]


Maintainer's Corner

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS],
Dependencies base (>=0.4.9 && <5), contiguous (>=0.6 && <0.7), ghc-prim, primitive (>=0.6.4 && <0.8) [details]
License BSD-3-Clause
Copyright 2018 Andrew Martin
Author Andrew Martin
Category software
Home page
Source repo head: git clone
Uploaded by andrewthad at 2021-10-18T16:30:31Z
Distributions NixOS:
Downloads 943 total (2 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2021-10-18 [all 1 reports]

Readme for primitive-sort-

[back to package description]


sorting of contiguous data structures.