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]
Versions [faq] 0.1.0.0
Dependencies base (>=0.4.9 && <5), contiguous (>=0.2 && <0.4), ghc-prim, primitive (>=0.6.4.0) [details]
License BSD-3-Clause
Copyright 2018 Andrew Martin
Author Andrew Martin
Maintainer andrew.thaddeus@gmail.com
Revised Revision 2 made by andrewthad at Thu Sep 6 16:20:08 UTC 2018
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 Thu May 31 13:59:08 UTC 2018
Distributions NixOS:0.1.0.0
Downloads 119 total (19 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2018-05-31 [all 1 reports]

Modules

[Index]

Downloads

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'.

Maintainer's Corner

For package maintainers and hackage trustees


Readme for primitive-sort-0.1.0.0

[back to package description]

mergesort