MIT licensed by Florian Ragwitz
Maintained by [email protected]
This version can be pinned in stack with:data-findcycle-0.1.1.0@sha256:b71b194f1e25870a619693abe444b0bcc8fee1d4d50bc6021ae78aaf23f2143d,2169

Module documentation for 0.1.1.0

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.

Changes

Revision history for data-findcycle

0.1.1.0 – 2025-04-24

  • Add nivashPart and nivashPartWithinBounds as variants of nivash using stack partitioning.
  • Minor documentation fixes and improvements.

0.1.0.0 – 2025-03-08

  • First version. Released on an unsuspecting world.