Safe Haskell	None
Language	Haskell98

Data.Array.Repa.Repr.HintInterleave

Synopsis

Documentation

data I r1 #

Hints that computing this array will be an unbalanced workload and evaluation should be interleaved between the processors.

Instances

Source r1 a => Source (I r1) a #
Associated Types data Array (I r1) sh a :: * # Methods extent :: Shape sh => Array (I r1) sh a -> sh # index :: Shape sh => Array (I r1) sh a -> sh -> a # unsafeIndex :: Shape sh => Array (I r1) sh a -> sh -> a # linearIndex :: Shape sh => Array (I r1) sh a -> Int -> a # unsafeLinearIndex :: Shape sh => Array (I r1) sh a -> Int -> a # deepSeqArray :: Shape sh => Array (I r1) sh a -> b -> b #
(Shape sh, Load D sh e) => Load (I D) sh e #
Methods loadS :: Target r2 e => Array (I D) sh e -> MVec r2 e -> IO () # loadP :: Target r2 e => Array (I D) sh e -> MVec r2 e -> IO () #
Structured r1 a b => Structured (I r1) a b #
Associated Types type TR (I r1) :: * # Methods smap :: Shape sh => (a -> b) -> Array (I r1) sh a -> Array (TR (I r1)) sh b # szipWith :: (Shape sh, Source r c) => (c -> a -> b) -> Array r sh c -> Array (I r1) sh a -> Array (TR (I r1)) sh b #
Read (Array r1 sh e) => Read (Array (I r1) sh e) #
Methods readsPrec :: Int -> ReadS (Array (I r1) sh e) # readList :: ReadS [Array (I r1) sh e] # readPrec :: ReadPrec (Array (I r1) sh e) # readListPrec :: ReadPrec [Array (I r1) sh e] #
Show (Array r1 sh e) => Show (Array (I r1) sh e) #
Methods showsPrec :: Int -> Array (I r1) sh e -> ShowS # show :: Array (I r1) sh e -> String # showList :: [Array (I r1) sh e] -> ShowS #
data Array (I r1) #
data Array (I r1) = AInterleave !(Array r1 sh a)
type TR (I r1) #
type TR (I r1) = I (TR r1)

hintInterleave :: Array r1 sh e -> Array (I r1) sh e #

Wrap an array with a unbalanced-ness hint.