simple-enumeration: Finite or countably infinite sequences of values.

[ bsd3, data, library ] [ Propose Tags ]

Finite or countably infinite sequences of values, supporting efficient indexing and random sampling.


[Skip to Readme]
Versions [faq] 0.1, 0.2
Change log ChangeLog.md
Dependencies base (>=4.7 && <5), integer-gmp [details]
License BSD-3-Clause
Copyright 2019 Brent Yorgey
Author Brent Yorgey
Maintainer byorgey@gmail.com
Category Data
Home page https://github.com/byorgey/enumeration#readme
Bug tracker https://github.com/byorgey/enumeration/issues
Source repo head: git clone https://github.com/byorgey/enumeration
Uploaded by BrentYorgey at Wed Jul 3 21:07:06 UTC 2019
Distributions NixOS:0.2
Downloads 81 total (47 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-07-03 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for simple-enumeration-0.2

[back to package description]

Lightweight, efficiently indexable enumerations

This package defines a type of enumerations, along with combinators for building and manipulating them. An enumeration is a finite or countably infinite sequence of values, represented as a function from an index to a value. Hence it is possible to work with even very large finite sets. Enumerations also naturally support (uniform) random sampling.

Note the goal of this package is not to enumerate values of Haskell types; there already exist many other packages to do that. Rather, the goal is simply to provide an abstract framework for working with enumerations of any values at all.

See the documentation for examples; see the announcement blog post for additional examples and discussion.