primitive-sort: Sort primitive arrays
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]
Downloads
- primitive-sort-0.1.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.2.1, 0.1.2.2, 0.1.2.3, 0.1.2.4 |
|---|---|
| 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 |
| Maintainer | andrew.thaddeus@gmail.com |
| Category | software |
| Home page | https://github.com/andrewthad/primitive-sort |
| Source repo | head: git clone https://github.com/andrewthad/primitive-sort |
| Uploaded | by andrewthad at 2021-10-18T16:30:31Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 3 indirect [details] |
| Downloads | 1453 total (1 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] |