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

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

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

[Skip to Readme]

Properties

Versions	0.1, 0.1, 0.2, 0.2.1
Change log	ChangeLog.md
Dependencies	base (>=4.7 && <5) [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 2019-05-17T14:04:10Z

Modules

[Index] [Quick Jump]

Data
- Data.Enumeration

Downloads

simple-enumeration-0.1.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

BrentYorgey

For package maintainers and hackage trustees

edit package information

Readme for simple-enumeration-0.1

[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.