random-access-list
Version 0.2 revision 0 uploaded by StephanFriedrichs.
Package meta
- Synopsis
- Random-access lists in Haskell
- Description
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.
- Author
- Stephan Friedrichs
- Bug reports
- n/a
- Category
- Data Structures
- Copyright
- (c) 2008, Stephan Friedrichs
- Homepage
- n/a
- Maintainer
- Stephan Friedrichs (deduktionstheorem at web dot de)
- Package URL
- n/a
- Stability
- beta