sorted-list: Type-enforced sorted lists and related functions.
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!
If you are missing a feature, do not hesitate to ask by opening an issue at the bug-tracker.
|Versions [faq]||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.*), deepseq [details]|
|Uploaded||by DanielDiaz at Sat May 28 17:39:04 UTC 2016|
|Distributions||LTSHaskell:0.2.1.0, NixOS:0.2.1.0, Stackage:0.2.1.0|
|Downloads||5170 total (287 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2016-05-28 [all 1 reports]
For package maintainers and hackage trustees