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.

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS],,,,,,,,,,,,,,,
Change log
Dependencies base (>=4 && <5), deepseq [details]
License BSD-3-Clause
Author Daniel Casanueva (daniel.casanueva `at`
Maintainer Daniel Casanueva (daniel.casanueva `at`
Category Data
Bug tracker
Uploaded by DanielDiaz at 2023-10-15T19:22:45Z
Distributions Arch:, LTSHaskell:, NixOS:, Stackage:
Reverse Dependencies 12 direct, 51 indirect [details]
Downloads 20253 total (200 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2023-10-15 [all 1 reports]

Readme for sorted-list-

[back to package description]


Type-enforced sorted lists and related functions.