| dph-prim-par-0.4.0: Parallel Primitives for Data-Parallel Haskell. | Contents | Index

Data.Array.Parallel.Unlifted.Parallel

Portability | portable
Stability | experimental
Maintainer | Roman Leshchinskiy <rl@cse.unsw.edu.au>

Description
Description --------------------------------------------------------------- Parallel operations on unlifted arrays
Synopsis

bpermuteUP :: UA a => UArr a -> UArr Int -> UArr a
updateUP :: forall a. UA a => UArr a -> UArr (Int :*: a) -> UArr a
enumFromToUP :: (UA a, Enum a) => a -> a -> UArr a
enumFromThenToUP :: (UA a, Enum a) => a -> a -> a -> UArr a
enumFromStepLenUP :: Int -> Int -> Int -> UArr Int
enumFromStepLenEachUP :: Int -> UArr ((Int :*: Int) :*: Int) -> UArr Int
mapUP :: (UA a, UA b) => (a -> b) -> UArr a -> UArr b
filterUP :: UA a => (a -> Bool) -> UArr a -> UArr a
packUP :: UA e => UArr e -> UArr Bool -> UArr e
combineUP :: UA a => UArr Bool -> UArr a -> UArr a -> UArr a
zipWithUP :: (UA a, UA b, UA c) => (a -> b -> c) -> UArr a -> UArr b -> UArr c
foldUP :: (UA a, DT a) => (a -> a -> a) -> a -> UArr a -> a
scanUP :: (DT a, UA a) => (a -> a -> a) -> a -> UArr a -> UArr a
andUP :: UArr Bool -> Bool
sumUP :: (UA a, DT a, Num a) => UArr a -> a
replicateSUP :: UA a => USegd -> UArr a -> UArr a
replicateRSUP :: UA a => Int -> UArr a -> UArr a
foldSUP :: (UA a, UA b) => (b -> a -> b) -> b -> USegd -> UArr a -> UArr b
sumSUP :: (Num e, UA e) => USegd -> UArr e -> UArr e
sumRUP :: (Num e, UA e) => Int -> Int -> UArr e -> UArr e
indexedUP :: (DT e, UA e) => UArr e -> UArr (Int :*: e)
replicateUP :: UA e => Int -> e -> UArr e
repeatUP :: UA e => Int -> UArr e -> UArr e
dropUP :: UA e => Int -> UArr e -> UArr e

Documentation
bpermuteUP :: UA a => UArr a -> UArr Int -> UArr a
updateUP :: forall a. UA a => UArr a -> UArr (Int :*: a) -> UArr a
enumFromToUP :: (UA a, Enum a) => a -> a -> UArr a
enumFromThenToUP :: (UA a, Enum a) => a -> a -> a -> UArr a
enumFromStepLenUP :: Int -> Int -> Int -> UArr Int
enumFromStepLenEachUP :: Int -> UArr ((Int :*: Int) :*: Int) -> UArr Int
mapUP :: (UA a, UA b) => (a -> b) -> UArr a -> UArr b
filterUP :: UA a => (a -> Bool) -> UArr a -> UArr a
packUP :: UA e => UArr e -> UArr Bool -> UArr e
Extract all elements from an array according to a given flag array
combineUP :: UA a => UArr Bool -> UArr a -> UArr a -> UArr a
zipWithUP :: (UA a, UA b, UA c) => (a -> b -> c) -> UArr a -> UArr b -> UArr c
foldUP :: (UA a, DT a) => (a -> a -> a) -> a -> UArr a -> a
scanUP :: (DT a, UA a) => (a -> a -> a) -> a -> UArr a -> UArr a
andUP :: UArr Bool -> Bool
sumUP :: (UA a, DT a, Num a) => UArr a -> a
replicateSUP :: UA a => USegd -> UArr a -> UArr a
replicateRSUP :: UA a => Int -> UArr a -> UArr a
foldSUP :: (UA a, UA b) => (b -> a -> b) -> b -> USegd -> UArr a -> UArr b
sumSUP :: (Num e, UA e) => USegd -> UArr e -> UArr e
sumRUP :: (Num e, UA e) => Int -> Int -> UArr e -> UArr e
indexedUP :: (DT e, UA e) => UArr e -> UArr (Int :*: e)
Associate each element of the array with its index
replicateUP :: UA e => Int -> e -> UArr e
Yield an array where all elements contain the same value
repeatUP :: UA e => Int -> UArr e -> UArr e
dropUP :: UA e => Int -> UArr e -> UArr e
Produced by Haddock version 2.6.1