rational-list: finite or repeating lists

[ bsd3, data-structures, library ] [ Propose Tags ] [ Report a vulnerability ]

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.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 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:55Z
Distributions
Downloads 486 total (0 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2019-10-20 [all 1 reports]