random-access-list: Random-access lists in Haskell

[ bsd3, data-structures, library ] [ Propose Tags ]
Versions 0.1, 0.2
Dependencies array (>=, base (>=, containers (>= [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 Wed Jun 11 22:22:46 UTC 2008
Distributions NixOS:0.2
Downloads 889 total (11 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

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.




Maintainer's Corner

For package maintainers and hackage trustees