nested-sequence: List-like data structures with O(log(n)) random access

[ bsd3, data, data-structures, library ] [ Propose Tags ]

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.


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • 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) com
Category Data Structures, Data
Home page
Source repo head: darcs get
Uploaded by BalazsKomuves at 2016-07-09T11:43:41Z
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]