dph-prim-par-0.3: Parallel Primitives for Data-Parallel Haskell. Contents Index

Data.Array.Parallel.Unlifted

Documentation

class (UA a, DT a) => Elt a

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

type Array = UArr

type SArray = SUArr

type Segd = USegd

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

empty :: Elt a => Array a

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

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

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

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

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

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

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

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

enumFromTo :: Int -> Int -> Array Int

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

indexed :: Elt a => Array a -> Array (Int :*: a)

zip :: (Elt a, Elt b) => Array a -> Array b -> Array (a :*: b)

zip3 :: (Elt a, Elt b, Elt c) => Array a -> Array b -> Array c -> Array ((a :*: b) :*: c)

unzip :: (Elt a, Elt b) => Array (a :*: b) -> Array a :*: Array b

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Produced by Haddock version 2.3.0