sorted-list-0.2.3.1: sorted-list.cabal
name: sorted-list
version: 0.2.3.1
synopsis: Type-enforced sorted lists and related functions.
description: 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.
license: MIT
license-file: license
author: Daniel Casanueva (coding `at` danielcasanueva.eu)
maintainer: Daniel Casanueva (coding `at` danielcasanueva.eu)
bug-reports: https://codeberg.org/daniel-casanueva/sorted-list/issues
category: Data
build-type: Simple
cabal-version: 1.18
extra-doc-files: readme.md, changelog.md
library
default-language: Haskell2010
ghc-options: -Wall
build-depends: base == 4.*
, deepseq
exposed-modules: Data.SortedList
benchmark sorted-list-map-bench
default-language: Haskell2010
type: exitcode-stdio-1.0
hs-source-dirs: bench
main-is: map.hs
ghc-options: -Wall
build-depends: base == 4.*
, sorted-list
, criterion
test-suite sorted-list-tests
default-language: Haskell2010
type: exitcode-stdio-1.0
hs-source-dirs: tests
main-is: Main.hs
ghc-options: -Wall
default-extensions: ImportQualifiedPost
build-depends: base, sorted-list, QuickCheck