random-access-list

Random-access lists in Haskell

Latest on Hackage:0.2

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD3 licensed by Stephan Friedrichs
Maintained by Stephan Friedrichs (deduktionstheorem at web dot de)

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.

Depends on:
Used by 1 package:
comments powered byDisqus