dph-prim-seq-0.3: Sequential Primitives for Data-Parallel Haskell.Source codeContentsIndex
Data.Array.Parallel.Unlifted
Documentation
class UA a => Elt a Source
show/hide Instances
type Array = UArrSource
type SArray = SUArrSource
type Segd = USegdSource
length :: Elt a => Array a -> IntSource
empty :: Elt a => Array aSource
replicate :: Elt a => Int -> a -> Array aSource
replicateEach :: Elt a => Int -> Array Int -> Array a -> Array aSource
repeat :: Elt a => Int -> Array a -> Array aSource
(+:+) :: Elt a => Array a -> Array a -> Array aSource
(!:) :: Elt a => Array a -> Int -> aSource
bpermute :: Elt a => Array a -> Array Int -> Array aSource
pack :: Elt a => Array a -> Array Bool -> Array aSource
combine :: Elt a => Array Bool -> Array a -> Array a -> Array aSource
enumFromTo :: Int -> Int -> Array IntSource
enumFromToEach :: Int -> Array (Int :*: Int) -> Array IntSource
indexed :: Elt a => Array a -> Array (Int :*: a)Source
zip :: (Elt a, Elt b) => Array a -> Array b -> Array (a :*: b)Source
zip3 :: (Elt a, Elt b, Elt c) => Array a -> Array b -> Array c -> Array ((a :*: b) :*: c)Source
unzip :: (Elt a, Elt b) => Array (a :*: b) -> Array a :*: Array bSource
unzip3 :: (Elt a, Elt b, Elt c) => Array ((a :*: b) :*: c) -> (Array a :*: Array b) :*: Array cSource
fsts :: (Elt a, Elt b) => Array (a :*: b) -> Array aSource
map :: (Elt a, Elt b) => (a -> b) -> Array a -> Array bSource
zipWith :: (Elt a, Elt b, Elt c) => (a -> b -> c) -> Array a -> Array b -> Array cSource
zipWith3 :: (Elt a, Elt b, Elt c, Elt d) => (a -> b -> c -> d) -> Array a -> Array b -> Array c -> Array dSource
fold :: Elt a => (a -> a -> a) -> a -> Array a -> aSource
fold1 :: Elt a => (a -> a -> a) -> Array a -> aSource
sum :: (Num a, Elt a) => Array a -> aSource
scan :: Elt a => (a -> a -> a) -> a -> Array a -> Array aSource
randoms :: (Elt a, Random a, RandomGen g) => Int -> g -> Array aSource
randomRs :: (Elt a, Random a, RandomGen g) => Int -> (a, a) -> g -> Array aSource
(>:) :: Elt a => Segd -> Array a -> SArray aSource
concat :: Elt a => SArray a -> Array aSource
(^+:+^) :: Elt a => SArray a -> SArray a -> SArray aSource
length_s :: Elt a => SArray a -> IntSource
lengths_s :: Elt a => SArray a -> Array IntSource
indices_s :: Elt a => SArray a -> Array IntSource
indexed_s :: Elt a => SArray a -> SArray (Int :*: a)Source
fold_s :: Elt a => (a -> a -> a) -> a -> SArray a -> Array aSource
fold1_s :: Elt a => (a -> a -> a) -> SArray a -> Array aSource
sum_s :: (Num a, Elt a) => SArray a -> Array aSource
toSegd :: Array (Int :*: Int) -> SegdSource
toList :: Elt a => Array a -> [a]Source
fromList :: Elt a => [a] -> Array aSource
Produced by Haddock version 2.4.2