primitive-sort: Sort primitive arrays
This library provides a stable sorting algorithm for primitive arrays. The algorithm currently uses mergesort on large chunks and switches to insertion sort on small chunks. There are also novel improvements to increase the performance if the input array is already mostly sorted.
[Skip to Readme]
Downloads
- primitive-sort-0.1.2.4.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 |
---|---|
Change log | CHANGELOG.md |
Dependencies | base (>=0.4.16 && <5), contiguous (>=0.6 && <0.7), primitive (>=0.6.4 && <0.10) [details] |
Tested with | ghc ==9.4.8 || ==9.6.3 || ==9.8.1 |
License | BSD-3-Clause |
Copyright | 2018 Andrew Martin |
Author | Andrew Martin |
Maintainer | amartin@layer3com.com |
Category | software |
Home page | https://github.com/byteverse/primitive-sort |
Bug tracker | https://github.com/byteverse/primitive-sort/issues |
Source repo | head: git clone git://github.com/byteverse/primitive-sort.git |
Uploaded | by l3c_amartin at 2024-02-07T17:02:59Z |
Distributions | |
Reverse Dependencies | 1 direct, 3 indirect [details] |
Downloads | 1395 total (18 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2024-02-07 [all 1 reports] |