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 [RSS] [faq] 0.1.0.0, 0.1.1.0
Dependencies base (>=0.4.9 && <5), contiguous (==0.6.*), 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 NixOS:0.1.0.0
Downloads 819 total (14 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2021-10-18 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates


Readme for primitive-sort-0.1.1.0

[back to package description]

primitive-sort

sorting of contiguous data structures.