nested-sequence: List-like data structures with O(log(n)) random access
List-like data structures implemented using nested data types and polymorphic
recursion. Also called "n-ary random access lists". They 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 the ternary and
quaternary versions are also more memory efficient; however, modifying
the right end of the sequence is still slow. See Data.Nested.Seq
for general comments and Data.Nested.Seq.Binary.Lazy for an explanation
of the data structure.
Modules
[Index]
Downloads
- nested-sequence-0.2.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] |
Tested with | ghc ==7.10.3 |
License | BSD-3-Clause |
Copyright | (c) 2016 Balazs Komuves, Peter Divianszky |
Author | Balazs Komuves, Peter Divianszky |
Maintainer | bkomuves (plus) hackage (at) gmail (dot) com |
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-09T11:43:41Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 1984 total (1 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] |