rational-list: finite or repeating lists
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.
A rational list is a list that is either finite or of the form
xs ++ cycle ys where xs and ys are finite lists and ys
is non-empty. Such lists have a finite representation, supporting
list operations that terminate even for infinite lists, and are
often more efficient.
Properties
| Versions | 1.0.0.0, 1.0.0.0 |
|---|---|
| Change log | changelog.md |
| Dependencies | base (>=4.11 && <6), containers [details] |
| License | BSD-3-Clause |
| Author | Ross Paterson |
| Maintainer | Ross Paterson <R.Paterson@city.ac.uk> |
| Category | Data Structures |
| Bug tracker | http://hub.darcs.net/ross/rational-list/issues |
| Source repo | head: darcs get http://hub.darcs.net/ross/rational-list |
| Uploaded | by RossPaterson at 2019-10-20T21:14:02Z |
Modules
[Index] [Quick Jump]
Downloads
- rational-list-1.0.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees