blob: 4f15f93f8e7dfb3f3abad447eb5919eb43851a7f (
plain)
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
|
{-# LANGUAGE MagicHash #-}
-- !!! simple tests of primitive arrays
--
module Main ( main ) where
import GHC.Exts
import Data.Char ( chr )
import Control.Monad.ST
import Data.Array.ST
import Data.Array.Unboxed
import Data.Ratio
main = putStr
(test_chars ++ "\n" ++
test_ints ++ "\n" ++
test_addrs ++ "\n" ++
test_floats ++ "\n" ++
test_doubles ++ "\n" ++
test_ptrs ++ "\n")
-- Arr# Char# -------------------------------------------
-- (main effort is in packString#)
test_chars :: String
test_chars
= let arr# = f 1000
in
shows (lookup_range arr# 42# 416#) "\n"
where
f :: Int -> UArray Int Char
f size@(I# size#)
= runST (
-- allocate an array of the specified size
newArray_ (0, (size-1)) >>= \ arr# ->
-- fill in all elements; elem i has "i" put in it
fill_in arr# 0# (size# -# 1#) >>
-- freeze the puppy:
freeze arr#
)
fill_in :: STUArray s Int Char -> Int# -> Int# -> ST s ()
fill_in arr_in# first# last#
= if (first# ># last#)
then return ()
else writeArray arr_in# (I# first#) ((chr (I# first#))) >>
fill_in arr_in# (first# +# 1#) last#
lookup_range :: UArray Int Char -> Int# -> Int# -> [Char]
lookup_range arr from# to#
= if (from# ># to#)
then []
else (arr ! (I# from#))
: (lookup_range arr (from# +# 1#) to#)
-- Arr# Int# -------------------------------------------
test_ints :: String
test_ints
= let arr# = f 1000
in
shows (lookup_range arr# 42# 416#) "\n"
where
f :: Int -> UArray Int Int
f size@(I# size#)
= runST (
-- allocate an array of the specified size
newArray_ (0, (size-1)) >>= \ arr# ->
-- fill in all elements; elem i has i^2 put in it
fill_in arr# 0# (size# -# 1#) >>
-- freeze the puppy:
freeze arr#
)
fill_in :: STUArray s Int Int -> Int# -> Int# -> ST s ()
fill_in arr_in# first# last#
= if (first# ># last#)
then return ()
else writeArray arr_in# (I# first#) (I# (first# *# first#)) >>
fill_in arr_in# (first# +# 1#) last#
lookup_range :: UArray Int Int -> Int# -> Int# -> [Int]
lookup_range arr from# to#
= if (from# ># to#)
then []
else (arr ! (I# from#))
: (lookup_range arr (from# +# 1#) to#)
-- Arr# Addr# -------------------------------------------
test_addrs :: String
test_addrs
= let arr# = f 1000
in
shows (lookup_range arr# 42# 416#) "\n"
where
f :: Int -> UArray Int (Ptr ())
f size@(I# size#)
= runST (
-- allocate an array of the specified size
newArray_ (0, (size-1)) >>= \ arr# ->
-- fill in all elements; elem i has i^2 put in it
fill_in arr# 0# (size# -# 1#) >>
-- freeze the puppy:
freeze arr#
)
fill_in :: STUArray s Int (Ptr ()) -> Int# -> Int# -> ST s ()
fill_in arr_in# first# last#
= if (first# ># last#)
then return ()
else writeArray arr_in# (I# first#)
(Ptr (int2Addr# (first# *# first#))) >>
fill_in arr_in# (first# +# 1#) last#
lookup_range :: UArray Int (Ptr ()) -> Int# -> Int# -> [ Int ]
lookup_range arr from# to#
= let
a2i (Ptr a#) = I# (addr2Int# a#)
in
if (from# ># to#)
then []
else (a2i (arr ! (I# from#)))
: (lookup_range arr (from# +# 1#) to#)
-- Arr# Float# -------------------------------------------
test_floats :: String
test_floats
= let arr# = f 1000
in
shows (lookup_range arr# 42# 416#) "\n"
where
f :: Int -> UArray Int Float
f size@(I# size#)
= runST (
-- allocate an array of the specified size
newArray_ (0, (size-1)) >>= \ arr# ->
-- fill in all elements; elem i has "i * pi" put in it
fill_in arr# 0# (size# -# 1#) >>
-- freeze the puppy:
freeze arr#
)
fill_in :: STUArray s Int Float -> Int# -> Int# -> ST s ()
fill_in arr_in# first# last#
= if (first# ># last#)
then return ()
{- else let e = ((fromIntegral (I# first#)) * pi)
in trace (show e) $ writeFloatArray arr_in# (I# first#) e >>
fill_in arr_in# (first# +# 1#) last#
-}
else writeArray arr_in# (I# first#) ((fromIntegral (I# first#)) * pi) >>
fill_in arr_in# (first# +# 1#) last#
lookup_range :: UArray Int Float -> Int# -> Int# -> [Float]
lookup_range arr from# to#
= if (from# ># to#)
then []
else (arr ! (I# from#))
: (lookup_range arr (from# +# 1#) to#)
-- Arr# Double# -------------------------------------------
test_doubles :: String
test_doubles
= let arr# = f 1000
in
shows (lookup_range arr# 42# 416#) "\n"
where
f :: Int -> UArray Int Double
f size@(I# size#)
= runST (
-- allocate an array of the specified size
newArray_ (0, (size-1)) >>= \ arr# ->
-- fill in all elements; elem i has "i * pi" put in it
fill_in arr# 0# (size# -# 1#) >>
-- freeze the puppy:
freeze arr#
)
fill_in :: STUArray s Int Double -> Int# -> Int# -> ST s ()
fill_in arr_in# first# last#
= if (first# ># last#)
then return ()
else writeArray arr_in# (I# first#) ((fromIntegral (I# first#)) * pi) >>
fill_in arr_in# (first# +# 1#) last#
lookup_range :: UArray Int Double -> Int# -> Int# -> [Double]
lookup_range arr from# to#
= if (from# ># to#)
then []
else (arr ! (I# from#))
: (lookup_range arr (from# +# 1#) to#)
-- Arr# (Ratio Int) (ptrs) ---------------------------------
-- just like Int# test
test_ptrs :: String
test_ptrs
= let arr# = f 1000
in
shows (lookup_range arr# 42 416) "\n"
where
f :: Int -> Array Int (Ratio Int)
f size
= runST (
newArray (1, size) (3 % 5) >>= \ arr# ->
-- don't fill in the whole thing
fill_in arr# 1 400 >>
freeze arr#
)
fill_in :: STArray s Int (Ratio Int) -> Int -> Int -> ST s ()
fill_in arr_in# first last
= if (first > last)
then return ()
else writeArray arr_in# first (fromIntegral (first * first)) >>
fill_in arr_in# (first + 1) last
lookup_range :: Array Int (Ratio Int) -> Int -> Int -> [Ratio Int]
lookup_range array from too
= if (from > too)
then []
else (array ! from) : (lookup_range array (from + 1) too)
|
