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]
|Dependencies||base (>=0.4.9 && <5), contiguous (>=0.2 && <0.5), ghc-prim, primitive (>=0.6.4.0) [details]|
|Copyright||2018 Andrew Martin|
|Revised||Revision 3 made by andrewthad at Thu May 23 17:03:17 UTC 2019|
|Source repo||head: git clone https://github.com/andrewthad/primitive-sort|
|Uploaded||by andrewthad at Thu May 31 13:59:08 UTC 2018|
|Downloads||196 total (10 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2018-05-31 [all 1 reports]
- primitive-sort-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees