@hackage / random-access-list

Random-access lists in Haskell

Latest0.2

About

Metadata

  • Last updated , by StephanFriedrichs
  • License BSD-3-Clause
  • Categories Data Structures

  • Maintained by: Stephan Friedrichs (deduktionstheorem at web dot de)

  • Lottery factor: 0

Links

Installation

This package uses the Custom cabal build type

Readme

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.