Description
Provides random access lists for Haskell. These data structures keep some list-like behavior while allowing more efficient access by position than ordinary linked lists.
It is useful for algorithms, functional data structures, editors, simulations, and code that needs persistent sequences with indexed lookup. It is a developer library and has no standalone interface.