Data.Array.Repa.Repr.HintSmall

Documentation

data S r1

Hints that evaluating this array is only a small amount of work. It will be evaluated sequentially in the main thread, instead of in parallel on the gang. This avoids the associated scheduling overhead.

Instances

Source r1 a => Source (S r1) a

Associated Types

data Array (S r1) sh a :: *

Methods

extent :: Shape sh => Array (S r1) sh a -> sh

index :: Shape sh => Array (S r1) sh a -> sh -> a

unsafeIndex :: Shape sh => Array (S r1) sh a -> sh -> a

linearIndex :: Shape sh => Array (S r1) sh a -> Int -> a

unsafeLinearIndex :: Shape sh => Array (S r1) sh a -> Int -> a

deepSeqArray :: Shape sh => Array (S r1) sh a -> b -> b

(Shape sh, LoadRange r1 sh e) => LoadRange (S r1) sh e

Methods

loadRangeS :: Target r2 e => Array (S r1) sh e -> MVec r2 e -> sh -> sh -> IO ()

loadRangeP :: Target r2 e => Array (S r1) sh e -> MVec r2 e -> sh -> sh -> IO ()

(Shape sh, Load r1 sh e) => Load (S r1) sh e

Methods

loadS :: Target r2 e => Array (S r1) sh e -> MVec r2 e -> IO ()

loadP :: Target r2 e => Array (S r1) sh e -> MVec r2 e -> IO ()

Structured r1 a b => Structured (S r1) a b

Associated Types

type TR (S r1) :: *

Methods

smap :: Shape sh => (a -> b) -> Array (S r1) sh a -> Array (TR (S r1)) sh b

szipWith :: (Shape sh, Source r c) => (c -> a -> b) -> Array r sh c -> Array (S r1) sh a -> Array (TR (S r1)) sh b

Read (Array r1 sh e) => Read (Array (S r1) sh e)

Methods

readsPrec :: Int -> ReadS (Array (S r1) sh e)

readList :: ReadS [Array (S r1) sh e]

readPrec :: ReadPrec (Array (S r1) sh e)

readListPrec :: ReadPrec [Array (S r1) sh e]

Show (Array r1 sh e) => Show (Array (S r1) sh e)

Methods

showsPrec :: Int -> Array (S r1) sh e -> ShowS

show :: Array (S r1) sh e -> String

showList :: [Array (S r1) sh e] -> ShowS

data Array (S r1)

data Array (S r1) = ASmall !(Array r1 sh a)

type TR (S r1)

type TR (S r1) = S (TR r1)

hintSmall :: Array r1 sh e -> Array (S r1) sh e

Wrap an array with a smallness hint.