Data.Massiv.Array.Delayed

Documentation

data D

Delayed representation.

Constructors

D

Instances

Show D

Methods

showsPrec :: Int -> D -> ShowS

show :: D -> String

showList :: [D] -> ShowS

(Index ix, Index (Lower ix), (~) * (Elt D ix e) (Array D (Lower ix) e)) => Slice D ix e

Methods

unsafeSlice :: Array D ix e -> ix -> ix -> Dim -> Maybe (Elt D ix e)

((~) * (Elt D ix e) (Array D (Lower ix) e), Index ix) => InnerSlice D ix e

Methods

unsafeInnerSlice :: Array D ix e -> (Lower ix, Int) -> Int -> Elt D ix e

((~) * (Elt D ix e) (Array D (Lower ix) e), Index ix) => OuterSlice D ix e

Methods

unsafeOuterSlice :: Array D ix e -> Int -> Elt D ix e

outerLength :: Array D ix e -> Int

Index ix => Load D ix e

Methods

loadS :: Monad m => Array D ix e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

loadP :: [Int] -> Array D ix e -> (Int -> IO e) -> (Int -> e -> IO ()) -> IO ()

Index ix => Source D ix e

Methods

unsafeIndex :: Array D ix e -> ix -> e

unsafeLinearIndex :: Array D ix e -> Int -> e

Index ix => Size D ix e

Methods

size :: Array D ix e -> ix

unsafeResize :: Index ix' => ix' -> Array D ix e -> Array D ix' e

unsafeExtract :: ix -> ix -> Array D ix e -> Array (EltRepr D ix) ix e

Index ix => Construct D ix e

Methods

getComp :: Array D ix e -> Comp

setComp :: Comp -> Array D ix e -> Array D ix e

unsafeMakeArray :: Comp -> ix -> (ix -> e) -> Array D ix e

Functor (Array D ix)

Methods

fmap :: (a -> b) -> Array D ix a -> Array D ix b

(<$) :: a -> Array D ix b -> Array D ix a

Index ix => Applicative (Array D ix)

Methods

pure :: a -> Array D ix a

(<*>) :: Array D ix (a -> b) -> Array D ix a -> Array D ix b

liftA2 :: (a -> b -> c) -> Array D ix a -> Array D ix b -> Array D ix c

(*>) :: Array D ix a -> Array D ix b -> Array D ix b

(<*) :: Array D ix a -> Array D ix b -> Array D ix a

Index ix => Foldable (Array D ix)

Row-major sequential folding over a Delayed array.

Methods

fold :: Monoid m => Array D ix m -> m

foldMap :: Monoid m => (a -> m) -> Array D ix a -> m

foldr :: (a -> b -> b) -> b -> Array D ix a -> b

foldr' :: (a -> b -> b) -> b -> Array D ix a -> b

foldl :: (b -> a -> b) -> b -> Array D ix a -> b

foldl' :: (b -> a -> b) -> b -> Array D ix a -> b

foldr1 :: (a -> a -> a) -> Array D ix a -> a

foldl1 :: (a -> a -> a) -> Array D ix a -> a

toList :: Array D ix a -> [a]

null :: Array D ix a -> Bool

length :: Array D ix a -> Int

elem :: Eq a => a -> Array D ix a -> Bool

maximum :: Ord a => Array D ix a -> a

minimum :: Ord a => Array D ix a -> a

sum :: Num a => Array D ix a -> a

product :: Num a => Array D ix a -> a

(Eq e, Index ix) => Eq (Array D ix e)

Methods

(==) :: Array D ix e -> Array D ix e -> Bool

(/=) :: Array D ix e -> Array D ix e -> Bool

(Index ix, Floating e) => Floating (Array D ix e)

Methods

pi :: Array D ix e

exp :: Array D ix e -> Array D ix e

log :: Array D ix e -> Array D ix e

sqrt :: Array D ix e -> Array D ix e

(**) :: Array D ix e -> Array D ix e -> Array D ix e

logBase :: Array D ix e -> Array D ix e -> Array D ix e

sin :: Array D ix e -> Array D ix e

cos :: Array D ix e -> Array D ix e

tan :: Array D ix e -> Array D ix e

asin :: Array D ix e -> Array D ix e

acos :: Array D ix e -> Array D ix e

atan :: Array D ix e -> Array D ix e

sinh :: Array D ix e -> Array D ix e

cosh :: Array D ix e -> Array D ix e

tanh :: Array D ix e -> Array D ix e

asinh :: Array D ix e -> Array D ix e

acosh :: Array D ix e -> Array D ix e

atanh :: Array D ix e -> Array D ix e

log1p :: Array D ix e -> Array D ix e

expm1 :: Array D ix e -> Array D ix e

log1pexp :: Array D ix e -> Array D ix e

log1mexp :: Array D ix e -> Array D ix e

(Index ix, Fractional e) => Fractional (Array D ix e)

Methods

(/) :: Array D ix e -> Array D ix e -> Array D ix e

recip :: Array D ix e -> Array D ix e

fromRational :: Rational -> Array D ix e

(Index ix, Num e) => Num (Array D ix e)

Methods

(+) :: Array D ix e -> Array D ix e -> Array D ix e

(-) :: Array D ix e -> Array D ix e -> Array D ix e

(*) :: Array D ix e -> Array D ix e -> Array D ix e

negate :: Array D ix e -> Array D ix e

abs :: Array D ix e -> Array D ix e

signum :: Array D ix e -> Array D ix e

fromInteger :: Integer -> Array D ix e

(Ord e, Index ix) => Ord (Array D ix e)

Methods

compare :: Array D ix e -> Array D ix e -> Ordering

(<) :: Array D ix e -> Array D ix e -> Bool

(<=) :: Array D ix e -> Array D ix e -> Bool

(>) :: Array D ix e -> Array D ix e -> Bool

(>=) :: Array D ix e -> Array D ix e -> Bool

max :: Array D ix e -> Array D ix e -> Array D ix e

min :: Array D ix e -> Array D ix e -> Array D ix e

data Array D

data Array D = DArray {

• dComp :: !Comp
• dSize :: !ix
• dUnsafeIndex :: ix -> e

}

type EltRepr D ix

type EltRepr D ix = D

delay :: Source r ix e => Array r ix e -> Array D ix e

O(1) Conversion from a source array to D representation.

data DI

Delayed array that will be loaded in an interleaved fasion during parallel computation.

Instances

Index ix => Load DI ix e

Methods

loadS :: Monad m => Array DI ix e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

loadP :: [Int] -> Array DI ix e -> (Int -> IO e) -> (Int -> e -> IO ()) -> IO ()

Index ix => Size DI ix e

Methods

size :: Array DI ix e -> ix

unsafeResize :: Index ix' => ix' -> Array DI ix e -> Array DI ix' e

unsafeExtract :: ix -> ix -> Array DI ix e -> Array (EltRepr DI ix) ix e

Index ix => Construct DI ix e

Methods

getComp :: Array DI ix e -> Comp

setComp :: Comp -> Array DI ix e -> Array DI ix e

unsafeMakeArray :: Comp -> ix -> (ix -> e) -> Array DI ix e

Functor (Array DI ix)

Methods

fmap :: (a -> b) -> Array DI ix a -> Array DI ix b

(<$) :: a -> Array DI ix b -> Array DI ix a

data Array DI

data Array DI = DIArray {

• idArray :: Array D ix e

}

type EltRepr DI ix

type EltRepr DI ix = DI

toInterleaved :: Source r ix e => Array r ix e -> Array DI ix e

Convert a source array into an array that, when computed, will have its elemets evaluated out of order (interleaved amoungs cores), hence making unbalanced computation better parallelizable.

data DW

Delayed Windowed Array representation.

Instances

(Index ix, Load DW (Lower ix) e) => Load DW ix e

Methods

loadS :: Monad m => Array DW ix e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

loadP :: [Int] -> Array DW ix e -> (Int -> IO e) -> (Int -> e -> IO ()) -> IO ()

Load DW Ix2T e

Methods

loadS :: Monad m => Array DW Ix2T e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

loadP :: [Int] -> Array DW Ix2T e -> (Int -> IO e) -> (Int -> e -> IO ()) -> IO ()

Load DW Ix2 e

Methods

loadS :: Monad m => Array DW Ix2 e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

loadP :: [Int] -> Array DW Ix2 e -> (Int -> IO e) -> (Int -> e -> IO ()) -> IO ()

Load DW Ix1 e

Methods

loadS :: Monad m => Array DW Ix1 e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

loadP :: [Int] -> Array DW Ix1 e -> (Int -> IO e) -> (Int -> e -> IO ()) -> IO ()

Index ix => Size DW ix e

Any resize or extract on Windowed Array will hurt the performance.

Methods

size :: Array DW ix e -> ix

unsafeResize :: Index ix' => ix' -> Array DW ix e -> Array DW ix' e

unsafeExtract :: ix -> ix -> Array DW ix e -> Array (EltRepr DW ix) ix e

Index ix => Construct DW ix e

Methods

getComp :: Array DW ix e -> Comp

setComp :: Comp -> Array DW ix e -> Array DW ix e

unsafeMakeArray :: Comp -> ix -> (ix -> e) -> Array DW ix e

Functor (Array DW ix)

Methods

fmap :: (a -> b) -> Array DW ix a -> Array DW ix b

(<$) :: a -> Array DW ix b -> Array DW ix a

data Array DW

data Array DW = DWArray {

• wdArray :: !(Array D ix e)
• wdStencilSize :: Maybe ix
• wdWindowStartIndex :: !ix
• wdWindowSize :: !ix
• wdWindowUnsafeIndex :: ix -> e

}

type EltRepr DW ix

type EltRepr DW ix = D

makeWindowedArray

Arguments

:: Source r ix e

=> Array r ix e

Source array that will have a window inserted into it

-> ix

Start index for the window

-> ix

Size of the window

-> (ix -> e)

Inside window indexing function

-> Array DW ix e

Supply a separate generating function for interior of an array. This is very usful for stencil mapping, where interior function does not perform boundary checks, thus significantly speeding up computation process.

Since: 0.1.3