Basic non-strict arrays.
Note: The Data.Array.IArray module provides a more general interface to immutable arrays: it defines operations with the same names as those defined below, but with more general types, and also defines Array instances of the relevant classes. To use that more general interface, import Data.Array.IArray but not Data.Array.
|Immutable non-strict arrays|
Haskell provides indexable arrays, which may be thought of as functions whose domains are isomorphic to contiguous subsets of the integers. Functions restricted in this way can be implemented efficiently; in particular, a programmer may reasonably expect rapid access to the components. To ensure the possibility of such an implementation, arrays are treated as data, not as general functions.
Unfortunately, due to technical limitations, there are no docs here currently, but you can find them in the GHC.Arr module in the base packages (which provides the actual implementations).
|Produced by Haddock version 2.3.0|