| dph-prim-seq-0.3: Sequential Primitives for Data-Parallel Haskell. | Source code | Contents | Index

Data.Array.Parallel.Unlifted

Documentation

class UA a => Elt a | Source

Instances

Elt Bool
Elt Double
Elt Int
Elt Word8
(Elt a, Elt b) => Elt (a :*: b)

type Array = UArr | Source

type SArray = SUArr | Source

type Segd = USegd | Source

length :: Elt a => Array a -> Int | Source

empty :: Elt a => Array a | Source

replicate :: Elt a => Int -> a -> Array a | Source

replicateEach :: Elt a => Int -> Array Int -> Array a -> Array a | Source

repeat :: Elt a => Int -> Array a -> Array a | Source

(+:+) :: Elt a => Array a -> Array a -> Array a | Source

(!:) :: Elt a => Array a -> Int -> a | Source

bpermute :: Elt a => Array a -> Array Int -> Array a | Source

pack :: Elt a => Array a -> Array Bool -> Array a | Source

combine :: Elt a => Array Bool -> Array a -> Array a -> Array a | Source

enumFromTo :: Int -> Int -> Array Int | Source

enumFromToEach :: Int -> Array (Int :*: Int) -> Array Int | Source

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 b | Source

unzip3 :: (Elt a, Elt b, Elt c) => Array ((a :*: b) :*: c) -> (Array a :*: Array b) :*: Array c | Source

fsts :: (Elt a, Elt b) => Array (a :*: b) -> Array a | Source

map :: (Elt a, Elt b) => (a -> b) -> Array a -> Array b | Source

zipWith :: (Elt a, Elt b, Elt c) => (a -> b -> c) -> Array a -> Array b -> Array c | Source

zipWith3 :: (Elt a, Elt b, Elt c, Elt d) => (a -> b -> c -> d) -> Array a -> Array b -> Array c -> Array d | Source

fold :: Elt a => (a -> a -> a) -> a -> Array a -> a | Source

fold1 :: Elt a => (a -> a -> a) -> Array a -> a | Source

sum :: (Num a, Elt a) => Array a -> a | Source

scan :: Elt a => (a -> a -> a) -> a -> Array a -> Array a | Source

randoms :: (Elt a, Random a, RandomGen g) => Int -> g -> Array a | Source

randomRs :: (Elt a, Random a, RandomGen g) => Int -> (a, a) -> g -> Array a | Source

(>:) :: Elt a => Segd -> Array a -> SArray a | Source

concat :: Elt a => SArray a -> Array a | Source

(^+:+^) :: Elt a => SArray a -> SArray a -> SArray a | Source

length_s :: Elt a => SArray a -> Int | Source

lengths_s :: Elt a => SArray a -> Array Int | Source

indices_s :: Elt a => SArray a -> Array Int | Source

indexed_s :: Elt a => SArray a -> SArray (Int :*: a) | Source

fold_s :: Elt a => (a -> a -> a) -> a -> SArray a -> Array a | Source

fold1_s :: Elt a => (a -> a -> a) -> SArray a -> Array a | Source

sum_s :: (Num a, Elt a) => SArray a -> Array a | Source

toSegd :: Array (Int :*: Int) -> Segd | Source

toList :: Elt a => Array a -> [a] | Source

fromList :: Elt a => [a] -> Array a | Source

Produced by Haddock version 2.4.2