dph-par-0.3: Data structures for Nested Data-Parallel Haskell. Contents Index

Data.Array.Parallel.Prelude

Synopsis

mapP filterP combineP :: [:a:] -> [:a:] -> [:Int:] -> [:a:] emptyP zipWithP !: lengthP concatP zipP unzipP singletonP +:+ replicateP fromPArrayP :: PArray a -> [:a:] fromPArrayPA :: PA a -> PArray a :-> PArray a toPArrayP :: [:a:] -> PArray a toPArrayPA :: PA a -> PArray a :-> PArray a fromNestedPArrayP :: PArray (PArray a) -> [:[:a:]:] fromNestedPArrayPA :: PA a -> PArray (PArray a) :-> PArray (PArray a) Bool (False, True) otherwise :: Bool (&&) :: Bool -> Bool -> Bool (||) :: Bool -> Bool -> Bool not :: Bool -> Bool andP :: [:Bool:] -> Bool orP :: [:Bool:] -> Bool data family PArray a class Elt a => PrimPA a where fromUArrPA :: Int -> Array a -> PArray a toUArrPA :: PArray a -> Array a primPA :: PA a fromUArrPA' :: PrimPA a => Array a -> PArray a fromSUArrPA :: PrimPA a => Int -> Int -> SArray a -> PArray (PArray a) fromSUArrPA' :: PrimPA a => SArray a -> PArray (PArray a) fromSUArrPA_2 :: (PrimPA a, PrimPA b) => Int -> Int -> SArray (a :*: b) -> PArray (PArray (a, b)) fromSUArrPA_2' :: (PrimPA a, PrimPA b) => SArray (a :*: b) -> PArray (PArray (a, b)) fromUArrPA_3 :: (PrimPA a, PrimPA b, PrimPA c) => Int -> Array ((a :*: b) :*: c) -> PArray (a, b, c) fromUArrPA_3' :: (PrimPA a, PrimPA b, PrimPA c) => Array ((a :*: b) :*: c) -> PArray (a, b, c)

Documentation

mapP

filterP

combineP :: [:a:] -> [:a:] -> [:Int:] -> [:a:]

emptyP

zipWithP

!:

lengthP

concatP

zipP

unzipP

singletonP

+:+

replicateP

fromPArrayP :: PArray a -> [:a:]

fromPArrayPA :: PA a -> PArray a :-> PArray a

toPArrayP :: [:a:] -> PArray a

toPArrayPA :: PA a -> PArray a :-> PArray a

fromNestedPArrayP :: PArray (PArray a) -> [:[:a:]:]

fromNestedPArrayPA :: PA a -> PArray (PArray a) :-> PArray (PArray a)

Bool (False, True)

otherwise :: Bool

(&&) :: Bool -> Bool -> Bool

(||) :: Bool -> Bool -> Bool

not :: Bool -> Bool

andP :: [:Bool:] -> Bool

orP :: [:Bool:] -> Bool

data family PArray a

Lifted parallel arrays

class Elt a => PrimPA a where

Methods fromUArrPA :: Int -> Array a -> PArray a toUArrPA :: PArray a -> Array a primPA :: PA a Instances PrimPA Bool PrimPA Double PrimPA Int PrimPA Word8

fromUArrPA' :: PrimPA a => Array a -> PArray a

fromSUArrPA :: PrimPA a => Int -> Int -> SArray a -> PArray (PArray a)

fromSUArrPA' :: PrimPA a => SArray a -> PArray (PArray a)

fromSUArrPA_2 :: (PrimPA a, PrimPA b) => Int -> Int -> SArray (a :*: b) -> PArray (PArray (a, b))

fromSUArrPA_2' :: (PrimPA a, PrimPA b) => SArray (a :*: b) -> PArray (PArray (a, b))

fromUArrPA_3 :: (PrimPA a, PrimPA b, PrimPA c) => Int -> Array ((a :*: b) :*: c) -> PArray (a, b, c)

fromUArrPA_3' :: (PrimPA a, PrimPA b, PrimPA c) => Array ((a :*: b) :*: c) -> PArray (a, b, c)

Produced by Haddock version 2.4.2