random-access-list: Random-access lists in Haskell
A purely functional random-access list implementation using skew binary number representation. These lists offer indexed random-access in logarithmic time while still providing typical list functionality (head, tail, cons) in constant time. See "Purely Functional Data Structures" by Chris Okasaki.
| Versions [faq] | 0.1, 0.2 |
|---|---|
| Dependencies | array (>=0.1.0.0), base (>=3.0.1.0), containers (>=0.1.0.0) [details] |
| License | BSD-3-Clause |
| Copyright | (c) 2008, Stephan Friedrichs |
| Author | Stephan Friedrichs |
| Maintainer | Stephan Friedrichs (deduktionstheorem at web dot de) |
| Category | Data Structures |
| Uploaded | by StephanFriedrichs at 2008-06-16T20:59:44Z |
| Distributions | NixOS:0.2 |
| Downloads | 1640 total (3 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] |
Downloads
- random-access-list-0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)