1 {-# OPTIONS_GHC -fparr -funbox-strict-fields #-}
3 -----------------------------------------------------------------------------
6 -- Copyright : (c) 2001-2002 Manuel M T Chakravarty & Gabriele Keller
7 -- License : see libraries/base/LICENSE
9 -- Maintainer : Manuel M. T. Chakravarty <chak@cse.unsw.edu.au>
10 -- Stability : internal
11 -- Portability : non-portable (GHC Extensions)
13 -- Basic implementation of Parallel Arrays.
15 -- This module has two functions: (1) It defines the interface to the
16 -- parallel array extension of the Prelude and (2) it provides a vanilla
17 -- implementation of parallel arrays that does not require to flatten the
18 -- array code. The implementation is not very optimised.
20 --- DOCU ----------------------------------------------------------------------
22 -- Language: Haskell 98 plus unboxed values and parallel arrays
24 -- The semantic difference between standard Haskell arrays (aka "lazy
25 -- arrays") and parallel arrays (aka "strict arrays") is that the evaluation
26 -- of two different elements of a lazy array is independent, whereas in a
27 -- strict array either non or all elements are evaluated. In other words,
28 -- when a parallel array is evaluated to WHNF, all its elements will be
29 -- evaluated to WHNF. The name parallel array indicates that all array
30 -- elements may, in general, be evaluated to WHNF in parallel without any
31 -- need to resort to speculative evaluation. This parallel evaluation
32 -- semantics is also beneficial in the sequential case, as it facilitates
33 -- loop-based array processing as known from classic array-based languages,
36 -- The interface of this module is essentially a variant of the list
37 -- component of the Prelude, but also includes some functions (such as
38 -- permutations) that are not provided for lists. The following list
39 -- operations are not supported on parallel arrays, as they would require the
40 -- availability of infinite parallel arrays: `iterate', `repeat', and `cycle'.
42 -- The current implementation is quite simple and entirely based on boxed
43 -- arrays. One disadvantage of boxed arrays is that they require to
44 -- immediately initialise all newly allocated arrays with an error thunk to
45 -- keep the garbage collector happy, even if it is guaranteed that the array
46 -- is fully initialised with different values before passing over the
47 -- user-visible interface boundary. Currently, no effort is made to use
48 -- raw memory copy operations to speed things up.
50 --- TODO ----------------------------------------------------------------------
52 -- * We probably want a standard library `PArray' in addition to the prelude
53 -- extension in the same way as the standard library `List' complements the
54 -- list functions from the prelude.
56 -- * Currently, functions that emphasis the constructor-based definition of
57 -- lists (such as, head, last, tail, and init) are not supported.
59 -- Is it worthwhile to support the string processing functions lines,
60 -- words, unlines, and unwords? (Currently, they are not implemented.)
62 -- It can, however, be argued that it would be worthwhile to include them
63 -- for completeness' sake; maybe only in the standard library `PArray'.
65 -- * Prescans are often more useful for array programming than scans. Shall
66 -- we include them into the Prelude or the library?
68 -- * Due to the use of the iterator `loop', we could define some fusion rules
71 -- * We might want to add bounds checks that can be deactivated.
75 -- [::], -- Built-in syntax
77 mapP, -- :: (a -> b) -> [:a:] -> [:b:]
78 (+:+), -- :: [:a:] -> [:a:] -> [:a:]
79 filterP, -- :: (a -> Bool) -> [:a:] -> [:a:]
80 concatP, -- :: [:[:a:]:] -> [:a:]
81 concatMapP, -- :: (a -> [:b:]) -> [:a:] -> [:b:]
82 -- head, last, tail, init, -- it's not wise to use them on arrays
83 nullP, -- :: [:a:] -> Bool
84 lengthP, -- :: [:a:] -> Int
85 (!:), -- :: [:a:] -> Int -> a
86 foldlP, -- :: (a -> b -> a) -> a -> [:b:] -> a
87 foldl1P, -- :: (a -> a -> a) -> [:a:] -> a
88 scanlP, -- :: (a -> b -> a) -> a -> [:b:] -> [:a:]
89 scanl1P, -- :: (a -> a -> a) -> [:a:] -> [:a:]
90 foldrP, -- :: (a -> b -> b) -> b -> [:a:] -> b
91 foldr1P, -- :: (a -> a -> a) -> [:a:] -> a
92 scanrP, -- :: (a -> b -> b) -> b -> [:a:] -> [:b:]
93 scanr1P, -- :: (a -> a -> a) -> [:a:] -> [:a:]
94 -- iterate, repeat, -- parallel arrays must be finite
95 singletonP, -- :: a -> [:a:]
97 replicateP, -- :: Int -> a -> [:a:]
98 -- cycle, -- parallel arrays must be finite
99 takeP, -- :: Int -> [:a:] -> [:a:]
100 dropP, -- :: Int -> [:a:] -> [:a:]
101 splitAtP, -- :: Int -> [:a:] -> ([:a:],[:a:])
102 takeWhileP, -- :: (a -> Bool) -> [:a:] -> [:a:]
103 dropWhileP, -- :: (a -> Bool) -> [:a:] -> [:a:]
104 spanP, -- :: (a -> Bool) -> [:a:] -> ([:a:], [:a:])
105 breakP, -- :: (a -> Bool) -> [:a:] -> ([:a:], [:a:])
106 -- lines, words, unlines, unwords, -- is string processing really needed
107 reverseP, -- :: [:a:] -> [:a:]
108 andP, -- :: [:Bool:] -> Bool
109 orP, -- :: [:Bool:] -> Bool
110 anyP, -- :: (a -> Bool) -> [:a:] -> Bool
111 allP, -- :: (a -> Bool) -> [:a:] -> Bool
112 elemP, -- :: (Eq a) => a -> [:a:] -> Bool
113 notElemP, -- :: (Eq a) => a -> [:a:] -> Bool
114 lookupP, -- :: (Eq a) => a -> [:(a, b):] -> Maybe b
115 sumP, -- :: (Num a) => [:a:] -> a
116 productP, -- :: (Num a) => [:a:] -> a
117 maximumP, -- :: (Ord a) => [:a:] -> a
118 minimumP, -- :: (Ord a) => [:a:] -> a
119 zipP, -- :: [:a:] -> [:b:] -> [:(a, b) :]
120 zip3P, -- :: [:a:] -> [:b:] -> [:c:] -> [:(a, b, c):]
121 zipWithP, -- :: (a -> b -> c) -> [:a:] -> [:b:] -> [:c:]
122 zipWith3P, -- :: (a -> b -> c -> d) -> [:a:]->[:b:]->[:c:]->[:d:]
123 unzipP, -- :: [:(a, b) :] -> ([:a:], [:b:])
124 unzip3P, -- :: [:(a, b, c):] -> ([:a:], [:b:], [:c:])
126 -- overloaded functions
128 enumFromToP, -- :: Enum a => a -> a -> [:a:]
129 enumFromThenToP, -- :: Enum a => a -> a -> a -> [:a:]
131 -- the following functions are not available on lists
133 toP, -- :: [a] -> [:a:]
134 fromP, -- :: [:a:] -> [a]
135 sliceP, -- :: Int -> Int -> [:e:] -> [:e:]
136 foldP, -- :: (e -> e -> e) -> e -> [:e:] -> e
137 fold1P, -- :: (e -> e -> e) -> [:e:] -> e
138 permuteP, -- :: [:Int:] -> [:e:] -> [:e:]
139 bpermuteP, -- :: [:Int:] -> [:e:] -> [:e:]
140 dpermuteP, -- :: [:Int:] -> [:e:] -> [:e:] -> [:e:]
141 crossP, -- :: [:a:] -> [:b:] -> [:(a, b):]
142 crossMapP, -- :: [:a:] -> (a -> [:b:]) -> [:(a, b):]
143 indexOfP -- :: (a -> Bool) -> [:a:] -> [:Int:]
150 import GHC.ST ( ST(..), STRep, runST )
151 import GHC.Exts ( Int#, Array#, Int(I#), MutableArray#, newArray#,
152 unsafeFreezeArray#, indexArray#, writeArray#, (<#), (>=#) )
156 infix 4 `elemP`, `notElemP`
159 -- representation of parallel arrays
160 -- ---------------------------------
162 -- this rather straight forward implementation maps parallel arrays to the
163 -- internal representation used for standard Haskell arrays in GHC's Prelude
164 -- (EXPORTED ABSTRACTLY)
166 -- * This definition *must* be kept in sync with `TysWiredIn.parrTyCon'!
168 data [::] e = PArr Int# (Array# e)
171 -- exported operations on parallel arrays
172 -- --------------------------------------
174 -- operations corresponding to list operations
177 mapP :: (a -> b) -> [:a:] -> [:b:]
178 mapP f = fst . loop (mapEFL f) noAL
180 (+:+) :: [:a:] -> [:a:] -> [:a:]
181 a1 +:+ a2 = fst $ loop (mapEFL sel) noAL (enumFromToP 0 (len1 + len2 - 1))
182 -- we can't use the [:x..y:] form here for tedious
183 -- reasons to do with the typechecker and the fact that
184 -- `enumFromToP' is defined in the same module
189 sel i | i < len1 = a1!:i
190 | otherwise = a2!:(i - len1)
192 filterP :: (a -> Bool) -> [:a:] -> [:a:]
193 filterP p = fst . loop (filterEFL p) noAL
195 concatP :: [:[:a:]:] -> [:a:]
196 concatP xss = foldlP (+:+) [::] xss
198 concatMapP :: (a -> [:b:]) -> [:a:] -> [:b:]
199 concatMapP f = concatP . mapP f
201 -- head, last, tail, init, -- it's not wise to use them on arrays
203 nullP :: [:a:] -> Bool
207 lengthP :: [:a:] -> Int
208 lengthP (PArr n# _) = I# n#
210 (!:) :: [:a:] -> Int -> a
213 foldlP :: (a -> b -> a) -> a -> [:b:] -> a
214 foldlP f z = snd . loop (foldEFL (flip f)) z
216 foldl1P :: (a -> a -> a) -> [:a:] -> a
217 foldl1P f [::] = error "Prelude.foldl1P: empty array"
218 foldl1P f a = snd $ loopFromTo 1 (lengthP a - 1) (foldEFL f) (a!:0) a
220 scanlP :: (a -> b -> a) -> a -> [:b:] -> [:a:]
221 scanlP f z = fst . loop (scanEFL (flip f)) z
223 scanl1P :: (a -> a -> a) -> [:a:] -> [:a:]
224 scanl1P f [::] = error "Prelude.scanl1P: empty array"
225 scanl1P f a = fst $ loopFromTo 1 (lengthP a - 1) (scanEFL f) (a!:0) a
227 foldrP :: (a -> b -> b) -> b -> [:a:] -> b
228 foldrP = error "Prelude.foldrP: not implemented yet" -- FIXME
230 foldr1P :: (a -> a -> a) -> [:a:] -> a
231 foldr1P = error "Prelude.foldr1P: not implemented yet" -- FIXME
233 scanrP :: (a -> b -> b) -> b -> [:a:] -> [:b:]
234 scanrP = error "Prelude.scanrP: not implemented yet" -- FIXME
236 scanr1P :: (a -> a -> a) -> [:a:] -> [:a:]
237 scanr1P = error "Prelude.scanr1P: not implemented yet" -- FIXME
239 -- iterate, repeat -- parallel arrays must be finite
241 singletonP :: a -> [:a:]
242 {-# INLINE singletonP #-}
243 singletonP e = replicateP 1 e
246 {- NOINLINE emptyP #-}
247 emptyP = replicateP 0 undefined
250 replicateP :: Int -> a -> [:a:]
251 {-# INLINE replicateP #-}
252 replicateP n e = runST (do
253 marr# <- newArray n e
256 -- cycle -- parallel arrays must be finite
258 takeP :: Int -> [:a:] -> [:a:]
259 takeP n = sliceP 0 (n - 1)
261 dropP :: Int -> [:a:] -> [:a:]
262 dropP n a = sliceP n (lengthP a - 1) a
264 splitAtP :: Int -> [:a:] -> ([:a:],[:a:])
265 splitAtP n xs = (takeP n xs, dropP n xs)
267 takeWhileP :: (a -> Bool) -> [:a:] -> [:a:]
268 takeWhileP = error "Prelude.takeWhileP: not implemented yet" -- FIXME
270 dropWhileP :: (a -> Bool) -> [:a:] -> [:a:]
271 dropWhileP = error "Prelude.dropWhileP: not implemented yet" -- FIXME
273 spanP :: (a -> Bool) -> [:a:] -> ([:a:], [:a:])
274 spanP = error "Prelude.spanP: not implemented yet" -- FIXME
276 breakP :: (a -> Bool) -> [:a:] -> ([:a:], [:a:])
277 breakP p = spanP (not . p)
279 -- lines, words, unlines, unwords, -- is string processing really needed
281 reverseP :: [:a:] -> [:a:]
282 reverseP a = permuteP (enumFromThenToP (len - 1) (len - 2) 0) a
283 -- we can't use the [:x, y..z:] form here for tedious
284 -- reasons to do with the typechecker and the fact that
285 -- `enumFromThenToP' is defined in the same module
289 andP :: [:Bool:] -> Bool
290 andP = foldP (&&) True
292 orP :: [:Bool:] -> Bool
293 orP = foldP (||) True
295 anyP :: (a -> Bool) -> [:a:] -> Bool
296 anyP p = orP . mapP p
298 allP :: (a -> Bool) -> [:a:] -> Bool
299 allP p = andP . mapP p
301 elemP :: (Eq a) => a -> [:a:] -> Bool
302 elemP x = anyP (== x)
304 notElemP :: (Eq a) => a -> [:a:] -> Bool
305 notElemP x = allP (/= x)
307 lookupP :: (Eq a) => a -> [:(a, b):] -> Maybe b
308 lookupP = error "Prelude.lookupP: not implemented yet" -- FIXME
310 sumP :: (Num a) => [:a:] -> a
313 productP :: (Num a) => [:a:] -> a
314 productP = foldP (*) 1
316 maximumP :: (Ord a) => [:a:] -> a
317 maximumP [::] = error "Prelude.maximumP: empty parallel array"
318 maximumP xs = fold1P max xs
320 minimumP :: (Ord a) => [:a:] -> a
321 minimumP [::] = error "Prelude.minimumP: empty parallel array"
322 minimumP xs = fold1P min xs
324 zipP :: [:a:] -> [:b:] -> [:(a, b):]
327 zip3P :: [:a:] -> [:b:] -> [:c:] -> [:(a, b, c):]
328 zip3P = zipWith3P (,,)
330 zipWithP :: (a -> b -> c) -> [:a:] -> [:b:] -> [:c:]
331 zipWithP f a1 a2 = let
334 len = len1 `min` len2
336 fst $ loopFromTo 0 (len - 1) combine 0 a1
338 combine e1 i = (Just $ f e1 (a2!:i), i + 1)
340 zipWith3P :: (a -> b -> c -> d) -> [:a:]->[:b:]->[:c:]->[:d:]
341 zipWith3P f a1 a2 a3 = let
345 len = len1 `min` len2 `min` len3
347 fst $ loopFromTo 0 (len - 1) combine 0 a1
349 combine e1 i = (Just $ f e1 (a2!:i) (a3!:i), i + 1)
351 unzipP :: [:(a, b):] -> ([:a:], [:b:])
352 unzipP a = (fst $ loop (mapEFL fst) noAL a, fst $ loop (mapEFL snd) noAL a)
353 -- FIXME: these two functions should be optimised using a tupled custom loop
354 unzip3P :: [:(a, b, c):] -> ([:a:], [:b:], [:c:])
355 unzip3P a = (fst $ loop (mapEFL fst3) noAL a,
356 fst $ loop (mapEFL snd3) noAL a,
357 fst $ loop (mapEFL trd3) noAL a)
366 instance Eq a => Eq [:a:] where
367 a1 == a2 | lengthP a1 == lengthP a2 = andP (zipWithP (==) a1 a2)
370 instance Ord a => Ord [:a:] where
371 compare a1 a2 = case foldlP combineOrdering EQ (zipWithP compare a1 a2) of
372 EQ | lengthP a1 == lengthP a2 -> EQ
373 | lengthP a1 < lengthP a2 -> LT
376 combineOrdering EQ EQ = EQ
377 combineOrdering EQ other = other
378 combineOrdering other _ = other
380 instance Functor [::] where
383 instance Monad [::] where
384 m >>= k = foldrP ((+:+) . k ) [::] m
385 m >> k = foldrP ((+:+) . const k) [::] m
389 instance Show a => Show [:a:] where
390 showsPrec _ = showPArr . fromP
392 showPArr [] s = "[::]" ++ s
393 showPArr (x:xs) s = "[:" ++ shows x (showPArr' xs s)
395 showPArr' [] s = ":]" ++ s
396 showPArr' (y:ys) s = ',' : shows y (showPArr' ys s)
398 instance Read a => Read [:a:] where
399 readsPrec _ a = [(toP v, rest) | (v, rest) <- readPArr a]
401 readPArr = readParen False (\r -> do
405 (do { (":]", t) <- lex s; return ([], t) }) ++
406 (do { (x, t) <- reads s; (xs, u) <- readPArr2 t; return (x:xs, u) })
409 (do { (":]", t) <- lex s; return ([], t) }) ++
410 (do { (",", t) <- lex s; (x, u) <- reads t; (xs, v) <- readPArr2 u;
413 -- overloaded functions
416 -- Ideally, we would like `enumFromToP' and `enumFromThenToP' to be members of
417 -- `Enum'. On the other hand, we really do not want to change `Enum'. Thus,
418 -- for the moment, we hope that the compiler is sufficiently clever to
419 -- properly fuse the following definitions.
421 enumFromToP :: Enum a => a -> a -> [:a:]
422 enumFromToP x y = mapP toEnum (eftInt (fromEnum x) (fromEnum y))
424 eftInt x y = scanlP (+) x $ replicateP (y - x + 1) 1
426 enumFromThenToP :: Enum a => a -> a -> a -> [:a:]
427 enumFromThenToP x y z =
428 mapP toEnum (efttInt (fromEnum x) (fromEnum y) (fromEnum z))
430 efttInt x y z = scanlP (+) x $
431 replicateP (abs (z - x) `div` abs delta + 1) delta
435 -- the following functions are not available on lists
438 -- create an array from a list (EXPORTED)
441 toP l = fst $ loop store l (replicateP (length l) ())
443 store _ (x:xs) = (Just x, xs)
445 -- convert an array to a list (EXPORTED)
447 fromP :: [:a:] -> [a]
448 fromP a = [a!:i | i <- [0..lengthP a - 1]]
450 -- cut a subarray out of an array (EXPORTED)
452 sliceP :: Int -> Int -> [:e:] -> [:e:]
454 fst $ loopFromTo (0 `max` from) (to `min` (lengthP a - 1)) (mapEFL id) noAL a
456 -- parallel folding (EXPORTED)
458 -- * the first argument must be associative; otherwise, the result is undefined
460 foldP :: (e -> e -> e) -> e -> [:e:] -> e
463 -- parallel folding without explicit neutral (EXPORTED)
465 -- * the first argument must be associative; otherwise, the result is undefined
467 fold1P :: (e -> e -> e) -> [:e:] -> e
470 -- permute an array according to the permutation vector in the first argument
473 permuteP :: [:Int:] -> [:e:] -> [:e:]
475 | isLen /= esLen = error "GHC.PArr: arguments must be of the same length"
476 | otherwise = runST (do
477 marr <- newArray isLen noElem
481 noElem = error "GHC.PArr.permuteP: I do not exist!"
482 -- unlike standard Haskell arrays, this value represents an
487 -- permute an array according to the back-permutation vector in the first
488 -- argument (EXPORTED)
490 -- * the permutation vector must represent a surjective function; otherwise,
491 -- the result is undefined
493 bpermuteP :: [:Int:] -> [:e:] -> [:e:]
494 bpermuteP is es = fst $ loop (mapEFL (es!:)) noAL is
496 -- permute an array according to the permutation vector in the first
497 -- argument, which need not be surjective (EXPORTED)
499 -- * any elements in the result that are not covered by the permutation
500 -- vector assume the value of the corresponding position of the third
503 dpermuteP :: [:Int:] -> [:e:] -> [:e:] -> [:e:]
505 | isLen /= esLen = error "GHC.PArr: arguments must be of the same length"
506 | otherwise = runST (do
507 marr <- newArray dftLen noElem
508 trans 0 (isLen - 1) marr dft copyOne noAL
512 noElem = error "GHC.PArr.permuteP: I do not exist!"
513 -- unlike standard Haskell arrays, this value represents an
519 copyOne e _ = (Just e, noAL)
521 -- computes the cross combination of two arrays (EXPORTED)
523 crossP :: [:a:] -> [:b:] -> [:(a, b):]
524 crossP a1 a2 = fst $ loop combine (0, 0) $ replicateP len ()
530 combine _ (i, j) = (Just $ (a1!:i, a2!:j), next)
532 next | (i + 1) == len1 = (0 , j + 1)
533 | otherwise = (i + 1, j)
535 {- An alternative implementation
536 * The one above is certainly better for flattened code, but here where we
537 are handling boxed arrays, the trade off is less clear. However, I
538 think, the above one is still better.
543 x1 = concatP $ mapP (replicateP len2) a1
544 x2 = concatP $ replicateP len1 a2
549 -- |Compute a cross of an array and the arrays produced by the given function
550 -- for the elements of the first array.
552 crossMapP :: [:a:] -> (a -> [:b:]) -> [:(a, b):]
555 segd = mapP lengthP bs
556 as = zipWithP replicateP segd a
558 zipP (concatP as) (concatP bs)
560 {- The following may seem more straight forward, but the above is very cheap
561 with segmented arrays, as `mapP lengthP', `zipP', and `concatP' are
562 constant time, and `map f' uses the lifted version of `f'.
564 crossMapP a f = concatP $ mapP (\x -> mapP ((,) x) (f x)) a
568 -- computes an index array for all elements of the second argument for which
569 -- the predicate yields `True' (EXPORTED)
571 indexOfP :: (a -> Bool) -> [:a:] -> [:Int:]
572 indexOfP p a = fst $ loop calcIdx 0 a
574 calcIdx e idx | p e = (Just idx, idx + 1)
575 | otherwise = (Nothing , idx )
578 -- auxiliary functions
579 -- -------------------
581 -- internally used mutable boxed arrays
583 data MPArr s e = MPArr Int# (MutableArray# s e)
585 -- allocate a new mutable array that is pre-initialised with a given value
587 newArray :: Int -> e -> ST s (MPArr s e)
588 {-# INLINE newArray #-}
589 newArray (I# n#) e = ST $ \s1# ->
590 case newArray# n# e s1# of { (# s2#, marr# #) ->
591 (# s2#, MPArr n# marr# #)}
593 -- convert a mutable array into the external parallel array representation
595 mkPArr :: Int -> MPArr s e -> ST s [:e:]
596 {-# INLINE mkPArr #-}
597 mkPArr (I# n#) (MPArr _ marr#) = ST $ \s1# ->
598 case unsafeFreezeArray# marr# s1# of { (# s2#, arr# #) ->
599 (# s2#, PArr n# arr# #) }
601 -- general array iterator
603 -- * corresponds to `loopA' from ``Functional Array Fusion'', Chakravarty &
606 loop :: (e -> acc -> (Maybe e', acc)) -- mapping & folding, once per element
607 -> acc -- initial acc value
608 -> [:e:] -- input array
611 loop mf acc arr = loopFromTo 0 (lengthP arr - 1) mf acc arr
613 -- general array iterator with bounds
615 loopFromTo :: Int -- from index
617 -> (e -> acc -> (Maybe e', acc))
621 {-# INLINE loopFromTo #-}
622 loopFromTo from to mf start arr = runST (do
623 marr <- newArray (to - from + 1) noElem
624 (n', acc) <- trans from to marr arr mf start
625 arr <- mkPArr n' marr
628 noElem = error "GHC.PArr.loopFromTo: I do not exist!"
629 -- unlike standard Haskell arrays, this value represents an
632 -- actual loop body of `loop'
634 -- * for this to be really efficient, it has to be translated with the
635 -- constructor specialisation phase "SpecConstr" switched on; as of GHC 5.03
636 -- this requires an optimisation level of at least -O2
638 trans :: Int -- index of first elem to process
639 -> Int -- index of last elem to process
640 -> MPArr s e' -- destination array
641 -> [:e:] -- source array
642 -> (e -> acc -> (Maybe e', acc)) -- mutator
643 -> acc -- initial accumulator
644 -> ST s (Int, acc) -- final destination length/final acc
646 trans from to marr arr mf start = trans' from 0 start
648 trans' arrOff marrOff acc
649 | arrOff > to = return (marrOff, acc)
651 let (oe', acc') = mf (arr `indexPArr` arrOff) acc
652 marrOff' <- case oe' of
653 Nothing -> return marrOff
655 writeMPArr marr marrOff e'
657 trans' (arrOff + 1) marrOff' acc'
659 -- Permute the given elements into the mutable array.
661 permute :: MPArr s e -> [:Int:] -> [:e:] -> ST s ()
662 permute marr is es = perm 0
666 | otherwise = writeMPArr marr (is!:i) (es!:i) >> perm (i + 1)
671 -- common patterns for using `loop'
674 -- initial value for the accumulator when the accumulator is not needed
679 -- `loop' mutator maps a function over array elements
681 mapEFL :: (e -> e') -> (e -> () -> (Maybe e', ()))
682 {-# INLINE mapEFL #-}
683 mapEFL f = \e a -> (Just $ f e, ())
685 -- `loop' mutator that filter elements according to a predicate
687 filterEFL :: (e -> Bool) -> (e -> () -> (Maybe e, ()))
688 {-# INLINE filterEFL #-}
689 filterEFL p = \e a -> if p e then (Just e, ()) else (Nothing, ())
691 -- `loop' mutator for array folding
693 foldEFL :: (e -> acc -> acc) -> (e -> acc -> (Maybe (), acc))
694 {-# INLINE foldEFL #-}
695 foldEFL f = \e a -> (Nothing, f e a)
697 -- `loop' mutator for array scanning
699 scanEFL :: (e -> acc -> acc) -> (e -> acc -> (Maybe acc, acc))
700 {-# INLINE scanEFL #-}
701 scanEFL f = \e a -> (Just a, f e a)
703 -- elementary array operations
706 -- unlifted array indexing
708 indexPArr :: [:e:] -> Int -> e
709 {-# INLINE indexPArr #-}
710 indexPArr (PArr n# arr#) (I# i#)
711 | i# >=# 0# && i# <# n# =
712 case indexArray# arr# i# of (# e #) -> e
713 | otherwise = error $ "indexPArr: out of bounds parallel array index; " ++
714 "idx = " ++ show (I# i#) ++ ", arr len = "
717 -- encapsulate writing into a mutable array into the `ST' monad
719 writeMPArr :: MPArr s e -> Int -> e -> ST s ()
720 {-# INLINE writeMPArr #-}
721 writeMPArr (MPArr n# marr#) (I# i#) e
722 | i# >=# 0# && i# <# n# =
724 case writeArray# marr# i# e s# of s'# -> (# s'#, () #)
725 | otherwise = error $ "writeMPArr: out of bounds parallel array index; " ++
726 "idx = " ++ show (I# i#) ++ ", arr len = "
729 #endif /* __HADDOCK__ */