Infinitree: Infinitely deep trees for lazy stateless memoization
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.
Please see the example in the documentation at https://vegowotenks.de/projects/Infinitree/
[Skip to Readme]
Properties
| Versions | 0.1.0.0 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | adjunctions (>=4.4.3 && <4.5), base (>=4.21.0 && <4.22), containers (>=0.7 && <0.8), distributive (>=0.6.2 && <0.7), infinite-list (>=0.1.2 && <0.2), random (>=1.3.1 && <1.4) [details] |
| License | AGPL-3.0-or-later |
| Copyright | 2025 VegOwOtenks |
| Author | VegOwOtenks |
| Maintainer | hackage@vegowotenks.de |
| Category | Cache, Caching, Data Structures |
| Source repo | head: git clone https://git.jossco.de/VegOwOtenks/Infinitree |
| Uploaded | by VegOwOtenks at 2025-10-08T13:31:11Z |
Modules
[Index] [Quick Jump]
Downloads
- Infinitree-0.1.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