sorted-list: Type-enforced sorted lists and related functions.

[ bsd3, data, library ] [ Propose Tags ]

Type-enforced sorted lists and related functions.

These are useful for:

  • Constraining the argument of a function to be a sorted list by stating in your type that the input list is a sorted list.

  • Avoiding sorting a list twice.

  • Creating a list that is sorted from the moment of its construction, so it doesn't have to be sorted later.

  • Performing list operations keeping the input list sorted.

  • Improving those list operations that can be benefited from the ordering of its elements.

  • Creating infinite lists that are sorted!

  • And more!

If you are missing a feature, do not hesitate to ask by opening an issue at the bug-tracker.

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.2.1, 0.1.3.0, 0.1.4.0, 0.1.4.1, 0.1.4.2, 0.1.5.0, 0.1.6.0, 0.1.6.1, 0.2.0.0, 0.2.1.0
Dependencies base (>=4 && <5), deepseq [details]
License BSD-3-Clause
Author Daniel Díaz
Maintainer dhelta.diaz@gmail.com
Category Data
Home page https://github.com/Daniel-Diaz/sorted-list/blob/master/README.md
Bug tracker https://github.com/Daniel-Diaz/sorted-list/issues
Uploaded by DanielDiaz at 2018-04-25T10:54:04Z
Distributions Arch:0.2.1.0, LTSHaskell:0.2.1.0, NixOS:0.2.1.0, Stackage:0.2.1.0
Downloads 17183 total (116 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-04-29 [all 1 reports]