dph-par-0.4.0: Data structures for Nested Data-Parallel Haskell.ContentsIndex
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
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
Constructors
False
True
show/hide Instances
Bounded Bool
Enum Bool
Eq BoolThe Bool type is an enumeration. It is defined with False first so that the corresponding Prelude.Enum instance will give Prelude.fromEnum False the value zero, and Prelude.fromEnum True the value 1. The actual definition is in the ghc-prim package.
Ord Bool
Show Bool
HS Bool
DPrim Bool
Elt Bool
DT Bool
UPrim Bool
UA Bool
Random Bool
Scalar Bool
otherwise :: Bool
(&&) :: Bool -> Bool -> Bool
(||) :: Bool -> Bool -> Bool
not :: Bool -> Bool
andP :: [:Bool:] -> Bool
orP :: [:Bool:] -> Bool
data PArray a
Lifted parallel arrays
show/hide Instances
(Elt a, Show a) => Show (PArray a)
class Elt a => Scalar a where
Methods
fromUArrPD :: Array a -> PData a
toUArrPD :: PData a -> Array a
primPA :: PA a
show/hide Instances
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)
Produced by Haddock version 2.7.2