dph-par-0.4.0: Data structures for Nested Data-Parallel Haskell. Source code Contents Index

Data.Array.Parallel.Prelude

Synopsis

mapP :: (a -> b) -> [::] a -> [::] b filterP :: (a -> Bool) -> [::] a -> [::] a combineP :: [:a:] -> [:a:] -> [:Int:] -> [:a:] emptyP :: [::] a zipWithP :: (a -> b -> c) -> [::] a -> [::] b -> [::] c (!:) :: [::] a -> Int -> a lengthP :: [::] a -> Int concatP :: [::] ([::] a) -> [::] a zipP :: [::] a -> [::] b -> [::] (a, b) unzipP :: [::] (a, b) -> ([::] a, [::] b) singletonP :: a -> [::] a (+:+) :: [::] a -> [::] a -> [::] a replicateP :: Int -> a -> [::] a 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) data Bool = False | True otherwise :: Bool (&&) :: Bool -> Bool -> Bool (||) :: Bool -> Bool -> Bool not :: Bool -> Bool andP :: [:Bool:] -> Bool orP :: [:Bool:] -> Bool data PArray a class Elt a => Scalar a where fromUArrPD :: Array a -> PData a toUArrPD :: PData a -> Array a primPA :: PA a toUArrPA :: Scalar a => PArray a -> Array a fromUArrPA' :: Scalar a => Array a -> PArray a fromUArrPA_2' :: (Scalar a, Scalar b) => Array (a :*: b) -> PArray (a, b) fromUArrPA_3 :: (Scalar a, Scalar b, Scalar c) => Int -> Array ((a :*: b) :*: c) -> PArray (a, b, c) fromUArrPA_3' :: (Scalar a, Scalar b, Scalar c) => Array ((a :*: b) :*: c) -> PArray (a, b, c) nestUSegdPA' :: Segd -> PArray a -> PArray (PArray a)

Documentation

mapP :: (a -> b) -> [::] a -> [::] b Source

filterP :: (a -> Bool) -> [::] a -> [::] a Source

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

emptyP :: [::] a Source

zipWithP :: (a -> b -> c) -> [::] a -> [::] b -> [::] c Source

(!:) :: [::] a -> Int -> a Source

lengthP :: [::] a -> Int Source

concatP :: [::] ([::] a) -> [::] a Source

zipP :: [::] a -> [::] b -> [::] (a, b) Source

unzipP :: [::] (a, b) -> ([::] a, [::] b) Source

singletonP :: a -> [::] a Source

(+:+) :: [::] a -> [::] a -> [::] a Source

replicateP :: Int -> a -> [::] a Source

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

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

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

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

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

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

data Bool Source

Constructors False True Instances Bounded Bool Enum Bool Eq Bool Ord Bool Show Bool HS Bool DPrim Bool Elt Bool DT Bool UPrim Bool UA Bool Random Bool Scalar Bool

otherwise :: Bool Source

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

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

not :: Bool -> Bool Source

andP :: [:Bool:] -> Bool Source

orP :: [:Bool:] -> Bool Source

data PArray a Source

Lifted parallel arrays Instances (Elt a, Show a) => Show (PArray a)

class Elt a => Scalar a where Source

Methods fromUArrPD :: Array a -> PData a Source toUArrPD :: PData a -> Array a Source primPA :: PA a Source Instances Scalar Bool Scalar Double Scalar Int Scalar Word8

toUArrPA :: Scalar a => PArray a -> Array a Source

fromUArrPA' :: Scalar a => Array a -> PArray a Source

fromUArrPA_2' :: (Scalar a, Scalar b) => Array (a :*: b) -> PArray (a, b) Source

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

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

nestUSegdPA' :: Segd -> PArray a -> PArray (PArray a) Source

Produced by Haddock version 2.6.1