![](haskell_icon.gif) | dph-par-0.3: Data structures for Nested Data-Parallel Haskell. | Contents | Index |
|
Data.Array.Parallel.Lifted |
|
|
|
Synopsis |
|
data family PArray a | | data PA a = PA {} | | lengthPA# :: PA a -> PArray a -> Int# | | replicatePA# :: PA a -> Int# -> a -> PArray a | | replicatelPA# :: PA a -> Int# -> PArray_Int# -> PArray a -> PArray a | | repeatPA# :: PA a -> Int# -> PArray a -> PArray a | | emptyPA :: PA a -> PArray a | | indexPA# :: PA a -> PArray a -> Int# -> a | | bpermutePA# :: PA a -> PArray a -> PArray_Int# -> PArray a | | appPA# :: PA a -> PArray a -> PArray a -> PArray a | | applPA# :: PA a -> Segd -> PArray a -> Segd -> PArray a -> PArray a | | packPA# :: PA a -> PArray a -> Int# -> PArray_Bool# -> PArray a | | combine2PA# :: PA a -> Int# -> PArray_Int# -> PArray_Int# -> PArray a -> PArray a -> PArray a | | fromListPA# :: PA a -> Int# -> [a] -> PArray a | | fromListPA :: PA a -> [a] -> PArray a | | nfPA :: PA a -> PArray a -> () | | type family PRepr a | | data PR a = PR {} | | mkPR :: PA a -> PR a | | mkReprPA :: a ~ PRepr a => PR a -> PA a | | class Elt a => PrimPA a where | | | prim_lengthPA :: PrimPA a => PArray a -> Int | | fromUArrPA' :: PrimPA a => Array a -> PArray a | | data family PArray a | | dPA_Int :: PA Int | | dPR_Int :: PR Int | | upToPA_Int :: Int -> PArray Int | | dPA_Word8 :: PA Word8 | | dPR_Word8 :: PR Word8 | | dPA_Double :: PA Double | | dPR_Double :: PR Double | | dPA_Bool :: PA Bool | | toPrimArrPA_Bool :: PArray Bool -> PArray_Bool# | | truesPA# :: PArray Bool -> Int# | | dPA_Unit :: PA () | | dPA_2 :: PA a -> PA b -> PA (a, b) | | dPA_3 :: PA a -> PA b -> PA c -> PA (a, b, c) | | dPA_4 :: PA a -> PA b -> PA c -> PA d -> PA (a, b, c, d) | | dPA_5 :: PA a -> PA b -> PA c -> PA d -> PA e -> PA (a, b, c, d, e) | | dPA_PArray :: PA a -> PA (PArray a) | | data a :-> b | | ($:) :: forall a b. (a :-> b) -> a -> b | | ($:^) :: forall a b. PArray (a :-> b) -> PArray a -> PArray b | | dPA_Clo :: PA a -> PA b -> PA (a :-> b) |
|
|
Documentation |
|
data family PArray a |
|
|
data PA a |
Dictionaries
| Constructors | |
|
|
lengthPA# :: PA a -> PArray a -> Int# |
|
replicatePA# :: PA a -> Int# -> a -> PArray a |
|
replicatelPA# :: PA a -> Int# -> PArray_Int# -> PArray a -> PArray a |
|
repeatPA# :: PA a -> Int# -> PArray a -> PArray a |
|
emptyPA :: PA a -> PArray a |
|
indexPA# :: PA a -> PArray a -> Int# -> a |
|
bpermutePA# :: PA a -> PArray a -> PArray_Int# -> PArray a |
|
appPA# :: PA a -> PArray a -> PArray a -> PArray a |
|
applPA# :: PA a -> Segd -> PArray a -> Segd -> PArray a -> PArray a |
|
packPA# :: PA a -> PArray a -> Int# -> PArray_Bool# -> PArray a |
|
combine2PA# :: PA a -> Int# -> PArray_Int# -> PArray_Int# -> PArray a -> PArray a -> PArray a |
|
fromListPA# :: PA a -> Int# -> [a] -> PArray a |
|
fromListPA :: PA a -> [a] -> PArray a |
|
nfPA :: PA a -> PArray a -> () |
|
type family PRepr a |
|
|
data PR a |
|
|
mkPR :: PA a -> PR a |
|
mkReprPA :: a ~ PRepr a => PR a -> PA a |
|
class Elt a => PrimPA a where |
| Methods | | | Instances | |
|
|
prim_lengthPA :: PrimPA a => PArray a -> Int |
|
fromUArrPA' :: PrimPA a => Array a -> PArray a |
|
data family PArray a |
|
|
dPA_Int :: PA Int |
|
dPR_Int :: PR Int |
|
upToPA_Int :: Int -> PArray Int |
|
dPA_Word8 :: PA Word8 |
|
dPR_Word8 :: PR Word8 |
|
dPA_Double :: PA Double |
|
dPR_Double :: PR Double |
|
dPA_Bool :: PA Bool |
|
toPrimArrPA_Bool :: PArray Bool -> PArray_Bool# |
|
truesPA# :: PArray Bool -> Int# |
|
dPA_Unit :: PA () |
|
dPA_2 :: PA a -> PA b -> PA (a, b) |
|
dPA_3 :: PA a -> PA b -> PA c -> PA (a, b, c) |
|
dPA_4 :: PA a -> PA b -> PA c -> PA d -> PA (a, b, c, d) |
|
dPA_5 :: PA a -> PA b -> PA c -> PA d -> PA e -> PA (a, b, c, d, e) |
|
dPA_PArray :: PA a -> PA (PArray a) |
|
data a :-> b |
|
|
($:) :: forall a b. (a :-> b) -> a -> b |
Closure application
|
|
($:^) :: forall a b. PArray (a :-> b) -> PArray a -> PArray b |
Lifted closure application
|
|
dPA_Clo :: PA a -> PA b -> PA (a :-> b) |
|
Produced by Haddock version 2.3.0 |