@hackage random-access-list0.1

Random-access lists in Haskell

  • Categories

  • License

    BSD-3-Clause

  • Maintainer

    Stephan Friedrichs (deduktionstheorem at web dot de)

  • Links

  • Versions

    • 0.2 Mon, 16 Jun 2008
    • 0.1 Wed, 11 Jun 2008

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.