sorted-list

Type-enforced sorted lists and related functions.

https://github.com/Daniel-Diaz/sorted-list/blob/master/README.md

Version on this page:0.2.0.0
LTS Haskell 24.17:0.2.3.1
Stackage Nightly 2025-10-26:0.3.1.0
Latest on Hackage:0.3.1.0

See all snapshots sorted-list appears in

BSD-3-Clause licensed by Daniel Díaz
Maintained by [email protected]
This version can be pinned in stack with:sorted-list-0.2.0.0@sha256:9706e88c15017daab2a08f69cd6aef00dd1d6738d32474d4b8c10ec298e8ee9d,2070

Module documentation for 0.2.0.0

Depends on 2 packages(full list with versions):
base, deepseq

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.