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.1.0
LTS Haskell 23.19:0.2.3.1
Stackage Nightly 2025-04-24:0.2.3.1
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.1.0@sha256:a1b67c647ec22b81fff5e3a5c43c397cd4011d6d0c13562855d17c13c5962d62,2070

Module documentation for 0.2.1.0

Depends on 2 packages(full list with versions):
base, deepseq
Used by 1 package in lts-14.27(full list with versions):
haskell-lsp

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.