data-findcycle: Find cycles in periodic functions (and lists)
Any function f :: a -> a where the type a has finitely many values
eventually has to be cyclic when iterated from some initial a.
This module provides a number of common algorithms and utilities to identify and work with such cycles.
Downloads
- data-findcycle-0.1.2.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1.0.0, 0.1.1.0, 0.1.2.0 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | array (>=0.5 && <0.6), base (>=4.7 && <4.23), containers (>=0.5 && <0.9), hashable (>=1.2 && <1.6), mtl (>=2.1 && <2.4), transformers (>=0.3 && <0.5), unordered-containers (>=0.2 && <0.3) [details] |
| License | MIT |
| Copyright | (c) 2025 Florian Ragwitz |
| Author | Florian Ragwitz |
| Maintainer | florian.ragwitz@gmail.com |
| Category | Data |
| Home page | https://github.com/rafl/data-findcycle |
| Source repo | head: git clone https://github.com/rafl/data-findcycle -b main |
| Uploaded | by rafl at 2025-06-01T01:12:48Z |
| Distributions | LTSHaskell:0.1.2.0, NixOS:0.1.2.0, Stackage:0.1.2.0 |
| Downloads | 40 total (3 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2025-06-01 [all 1 reports] |