| array-0.2.0.0: Mutable and immutable arrays | Source code | Contents | Index

Data.Array

Portability | portable
Stability | provisional
Maintainer | libraries@haskell.org

Contents

Immutable non-strict arrays

Description
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.
Synopsis

module Data.Ix
Array (Array)
array
listArray
accumArray
!
bounds
indices
elems
assocs
//
accum
ixmap

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.

Since most array functions involve the class `Ix`, this module is exported from Data.Array so that modules need not import both Data.Array and Data.Ix.

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).

module Data.Ix
Array (Array)
array
listArray
accumArray
!
bounds
indices
elems
assocs
//
accum
ixmap
Produced by Haddock version 2.4.2