1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
-----------------------------------------------------------------------------
-- Standard Library: Array operations
--
-- Suitable for use with Hugs 1.4.
-----------------------------------------------------------------------------
module Array (
module Ix, -- export all of Ix
Array, array, listArray, (!), bounds, indices, elems, assocs,
accumArray, (//), accum, ixmap ) where
import Ix
import List( (\\) )
infixl 9 !, //
data Array a b -- Arrays are implemented as a primitive type
array :: Ix a => (a,a) -> [(a,b)] -> Array a b
listArray :: Ix a => (a,a) -> [b] -> Array a b
(!) :: Ix a => Array a b -> a -> b
bounds :: Ix a => Array a b -> (a,a)
indices :: Ix a => Array a b -> [a]
elems :: Ix a => Array a b -> [b]
assocs :: Ix a => Array a b -> [(a,b)]
(//) :: Ix a => Array a b -> [(a,b)] -> Array a b
accum :: Ix a => (b -> c -> b) -> Array a b -> [(a,c)] -> Array a b
accumArray :: Ix a => (b -> c -> b) -> b -> (a,a) -> [(a,c)] -> Array a b
ixmap :: (Ix a, Ix b) => (a,a) -> (a -> b) -> Array b c -> Array a c
primitive primArray :: [(a,b)] -> (a,a) -> (a -> Int) -> Array a b
primitive primUpdate :: [(a,b)] -> Array a b -> (a -> Int) -> Array a b
primitive primAccum
:: [(a,c)] -> Array a b -> (b -> c -> b) -> (a -> Int) -> Array a b
primitive primAccumArray
:: [(a,c)] -> (a,a) -> b -> (b -> c -> b) -> (a -> Int) -> Array a b
primitive primSubscript
:: ((a,a) -> a -> Int) -> Array a b -> a -> b
primitive primBounds :: Array a b -> (a,a)
primitive primElems :: Array a b -> [b]
primitive primAmap :: (b -> c) -> Array a b -> Array a c
array bounds assocs = primArray assocs bounds (index bounds)
listArray b vs = array b (zip (range b) vs)
(!) = primSubscript index
bounds = primBounds
indices = range . bounds
elems = primElems
assocs a = zip (indices a) (elems a)
accumArray f z b as = primAccumArray as b z f (index b)
a // as = primUpdate as a (index (bounds a))
accum f a as = primAccum as a f (index (bounds a))
amap = primAmap
ixmap b f a = array b [ (i, a ! f i) | i <- range b ]
instance (Ix a) => Functor (Array a) where
map = primAmap
instance (Ix a, Eq b) => Eq (Array a b) where
a == a' = assocs a == assocs a'
instance (Ix a, Ord b) => Ord (Array a b) where
a <= a' = assocs a <= assocs a'
instance (Ix a, Show a, Show b) => Show (Array a b) where
showsPrec p a = showParen (p > 9) (
showString "array " .
shows (bounds a) . showChar ' ' .
shows (assocs a) )
--instance (Ix a, Read a, Read b) => Read (Array a b) where
-- readsPrec p = readParen (p > 9)
-- (\r -> [(array b as, u) | ("array",s) <- lex r,
-- (b,t) <- reads s,
-- (as,u) <- reads t ])
-----------------------------------------------------------------------------
|
