Skip to content
Simple Haskell package for efficiently indexable finite and infinite enumerations.
Branch: master
Clone or download
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
src/Data add maybeOf and eitherOf May 14, 2019
test remove unused Tests.hs May 14, 2019
.gitignore ignore dist/ May 17, 2019
ChangeLog.md update changelog May 14, 2019
LICENSE
README.md link to blog post in README May 17, 2019
Setup.hs initial import May 14, 2019
notes.org don't export void to avoid clashing with Control.Monad May 14, 2019
simple-enumeration.cabal change name to simple-enumeration May 17, 2019
stack.yaml first draft complete May 14, 2019

README.md

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.

You can’t perform that action at this time.