2 % (c) The AQUA Project, Glasgow University, 1994-1999
5 \section[Array]{Module @Array@}
8 {-# OPTIONS -fno-implicit-prelude #-}
13 module Ix -- export all of Ix
14 , Array -- Array type is abstract
16 , array -- :: (Ix a) => (a,a) -> [(a,b)] -> Array a b
17 , listArray -- :: (Ix a) => (a,a) -> [b] -> Array a b
18 , (!) -- :: (Ix a) => Array a b -> a -> b
19 , bounds -- :: (Ix a) => Array a b -> (a,a)
20 , indices -- :: (Ix a) => Array a b -> [a]
21 , elems -- :: (Ix a) => Array a b -> [b]
22 , assocs -- :: (Ix a) => Array a b -> [(a,b)]
23 , accumArray -- :: (Ix a) => (b -> c -> b) -> b -> (a,a) -> [(a,c)] -> Array a b
24 , (//) -- :: (Ix a) => Array a b -> [(a,b)] -> Array a b
25 , accum -- :: (Ix a) => (b -> c -> b) -> Array a b -> [(a,c)] -> Array a b
26 , ixmap -- :: (Ix a, Ix b) => (a,a) -> (a -> b) -> Array b c -> Array a b
30 -- Ix a => Functor (Array a)
31 -- (Ix a, Eq b) => Eq (Array a b)
32 -- (Ix a, Ord b) => Ord (Array a b)
33 -- (Ix a, Show a, Show b) => Show (Array a b)
34 -- (Ix a, Read a, Read b) => Read (Array a b)
37 -- Implementation checked wrt. Haskell 98 lib report, 1/99.
45 import PrelArr -- Most of the hard work is done here
48 import privileged Prelude ( PrimArray
53 , primUnsafeFreezeArray
66 %*********************************************************
68 \subsection{Definitions of array, !, bounds}
70 %*********************************************************
75 {-# SPECIALISE listArray :: (Int,Int) -> [b] -> Array Int b #-}
76 listArray :: (Ix a) => (a,a) -> [b] -> Array a b
77 listArray b vs = array b (zip (range b) vs)
80 elems :: (Ix a) => Array a b -> [b]
81 elems a = [a!i | i <- indices a]
83 ixmap :: (Ix a, Ix b) => (a,a) -> (a -> b) -> Array b c -> Array a c
84 ixmap b f a = array b [(i, a ! f i) | i <- range b]
88 %*********************************************************
90 \subsection{Instance declarations for Array type}
92 %*********************************************************
97 data Array ix elt = Array (ix,ix) (PrimArray elt)
99 array :: Ix a => (a,a) -> [(a,b)] -> Array a b
100 array ixs@(ix_start, ix_end) ivs = runST (do
101 { mut_arr <- primNewArray (rangeSize ixs) arrEleBottom
102 ; mapM_ (\ (i,v) -> primWriteArray mut_arr (index ixs i) v) ivs
103 ; arr <- primUnsafeFreezeArray mut_arr
104 ; return (Array ixs arr)
108 arrEleBottom = error "(Array.!): undefined array element"
110 listArray :: Ix a => (a,a) -> [b] -> Array a b
111 listArray b vs = array b (zipWith (\ a b -> (a,b)) (range b) vs)
113 (!) :: Ix a => Array a b -> a -> b
114 (Array bounds arr) ! i = primIndexArray arr (index bounds i)
116 bounds :: Ix a => Array a b -> (a,a)
117 bounds (Array b _) = b
119 indices :: Ix a => Array a b -> [a]
120 indices = range . bounds
122 elems :: Ix a => Array a b -> [b]
123 elems a = [a!i | i <- indices a]
125 assocs :: Ix a => Array a b -> [(a,b)]
126 assocs a = [(i, a!i) | i <- indices a]
128 (//) :: Ix a => Array a b -> [(a,b)] -> Array a b
129 a // us = array (bounds a)
130 ([(i,a!i) | i <- indices a \\ [i | (i,_) <- us]]
133 accum :: Ix a => (b -> c -> b) -> Array a b -> [(a,c)] -> Array a b
134 accum f = foldl (\a (i,v) -> a // [(i,f (a!i) v)])
136 accumArray :: Ix a => (b -> c -> b) -> b -> (a,a) -> [(a,c)] -> Array a b
137 accumArray f z b = accum f (array b [(i,z) | i <- range b])
139 ixmap :: (Ix a, Ix b) => (a,a) -> (a -> b) -> Array b c -> Array a c
140 ixmap b f a = array b [(i, a ! f i) | i <- range b]
143 instance (Ix a) => Functor (Array a) where
144 fmap f a = array (bounds a) [(i, f(a!i)) | i <- indices a]
146 instance (Ix a, Eq b) => Eq (Array a b) where
147 a == a' = assocs a == assocs a'
149 instance (Ix a, Ord b) => Ord (Array a b) where
150 a <= a' = assocs a <= assocs a'
153 instance (Ix a, Show a, Show b) => Show (Array a b) where
154 showsPrec p a = showParen (p > 9) (
155 showString "array " .
156 shows (bounds a) . showChar ' ' .
159 instance (Ix a, Read a, Read b) => Read (Array a b) where
160 readsPrec p = readParen (p > 9)
161 (\r -> [(array b as, u) | ("array",s) <- lex r,