nested-sequence: A list-like data structure with O(log(n)) random access
A list-like data structure implemented using a nested data type and polymorphic recursion. It supports O(log(n)) lookup while still having amortized O(1) access to the left end of the sequence. Somewhat similar to finger trees, but much simpler and more memory efficient; however, modifying the right end of the sequence is still slow.
Downloads
- nested-sequence-0.1.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.2 |
|---|---|
| Dependencies | base (>=4 && <5) [details] |
| License | BSD-3-Clause |
| Copyright | (c) 2016 Balazs Komuves, Peter Divianszky |
| Author | Balazs Komuves, Peter Divianszky |
| Maintainer | bkomuves (plus) hackage (at) gmail (dot) hu |
| Category | Data Structures, Data |
| Home page | http://code.haskell.org/~bkomuves/ |
| Source repo | head: darcs get http://code.haskell.org/~bkomuves/projects/nested-sequence/ |
| Uploaded | by BalazsKomuves at 2016-07-08T12:01:33Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 1941 total (7 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] |