ralist: Random access list with a list compatible interface.
Random access list with a list compatible interface. Random access list have same complexity as lists with some exceptions, the notable one being that (!!) is O(log n) instead of O(n). RALists have to be finite.
Downloads
- ralist-0.3.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1.0.0, 0.2.0.0, 0.2.1.0, 0.2.1.1, 0.3.0.0, 0.4.0.0 (info) |
|---|---|
| Change log | changelog.md |
| Dependencies | base (>=4.12 && <6), deepseq (>=1.4.4.0 && <1.5), indexed-traversable (>=0.1 && <0.2), transformers (>=0.5 && <0.6) [details] |
| License | BSD-3-Clause |
| Author | Lennart Augustsson, Carter Schonwald |
| Maintainer | Carter Schonwald |
| Category | Data Structures |
| Home page | http://github.com/cartazio/ralist |
| Source repo | head: git clone https://github.com/cartazio/ralist.git |
| Uploaded | by CarterSchonwald at 2021-01-12T19:28:17Z |
| Distributions | |
| Reverse Dependencies | 2 direct, 0 indirect [details] |
| Downloads | 3092 total (32 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |