Data.Massiv.Core

Documentation

data family Array r ix e :: *

The array family. Representations r describes how data is arranged or computed. All arrays have a common property that each index ix always maps to the same unique element, even if that element does not exist in memory and has to be computed upon lookup. Data is always arranged in a nested fasion, depth of which is controlled by Rank ix.

Instances

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

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

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

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

Index ix => Foldable (Array M ix)

Row-major sequential folding over a Manifest array.

Methods

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

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

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

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

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

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

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

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

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

null :: Array M ix a -> Bool

length :: Array M ix a -> Int

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

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

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

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

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

Index ix => Foldable (Array B ix)

Row-major sequential folding over a Boxed array.

Methods

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

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

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

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

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

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

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

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

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

null :: Array B ix a -> Bool

length :: Array B ix a -> Int

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

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

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

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

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

Nested LN ix e => IsList (Array L ix e)

Associated Types

type Item (Array L ix e) :: *

Methods

fromList :: [Item (Array L ix e)] -> Array L ix e

fromListN :: Int -> [Item (Array L ix e)] -> Array L ix e

toList :: Array L ix e -> [Item (Array L ix e)]

Nested LN ix e => IsList (Array LN ix e)

Associated Types

type Item (Array LN ix e) :: *

Methods

fromList :: [Item (Array LN ix e)] -> Array LN ix e

fromListN :: Int -> [Item (Array LN ix e)] -> Array LN ix e

toList :: Array LN ix e -> [Item (Array LN ix e)]

(Unbox e, IsList (Array L ix e), Nested LN ix e, Nested L ix e, Ragged L ix e) => IsList (Array U ix e)

Associated Types

type Item (Array U ix e) :: *

Methods

fromList :: [Item (Array U ix e)] -> Array U ix e

fromListN :: Int -> [Item (Array U ix e)] -> Array U ix e

toList :: Array U ix e -> [Item (Array U ix e)]

(Storable e, IsList (Array L ix e), Nested LN ix e, Nested L ix e, Ragged L ix e) => IsList (Array S ix e)

Associated Types

type Item (Array S ix e) :: *

Methods

fromList :: [Item (Array S ix e)] -> Array S ix e

fromListN :: Int -> [Item (Array S ix e)] -> Array S ix e

toList :: Array S ix e -> [Item (Array S ix e)]

(Prim e, IsList (Array L ix e), Nested LN ix e, Nested L ix e, Ragged L ix e) => IsList (Array P ix e)

Associated Types

type Item (Array P ix e) :: *

Methods

fromList :: [Item (Array P ix e)] -> Array P ix e

fromListN :: Int -> [Item (Array P ix e)] -> Array P ix e

toList :: Array P ix e -> [Item (Array P ix e)]

(NFData e, IsList (Array L ix e), Nested LN ix e, Nested L ix e, Ragged L ix e) => IsList (Array N ix e)

Associated Types

type Item (Array N ix e) :: *

Methods

fromList :: [Item (Array N ix e)] -> Array N ix e

fromListN :: Int -> [Item (Array N ix e)] -> Array N ix e

toList :: Array N ix e -> [Item (Array N ix e)]

(IsList (Array L ix e), Nested LN ix e, Nested L ix e, Ragged L ix e) => IsList (Array B ix e)

Associated Types

type Item (Array B ix e) :: *

Methods

fromList :: [Item (Array B ix e)] -> Array B ix e

fromListN :: Int -> [Item (Array B ix e)] -> Array B ix e

toList :: Array B ix e -> [Item (Array B ix e)]

(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

(Unbox e, Eq e, Index ix) => Eq (Array U ix e)

Methods

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

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

(Storable e, Eq e, Index ix) => Eq (Array S ix e)

Methods

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

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

(Prim e, Eq e, Index ix) => Eq (Array P ix e)

Methods

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

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

(Index ix, NFData e, Eq e) => Eq (Array N ix e)

Methods

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

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

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

Methods

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

(/=) :: Array B ix e -> Array B 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

(Ragged L ix e, Show e) => Show (Array L ix e)

Methods

showsPrec :: Int -> Array L ix e -> ShowS

show :: Array L ix e -> String

showList :: [Array L ix e] -> ShowS

(Ragged L ix e, Nested LN ix e, Show e) => Show (Array LN ix e)

Methods

showsPrec :: Int -> Array LN ix e -> ShowS

show :: Array LN ix e -> String

showList :: [Array LN ix e] -> ShowS

(Index ix, NFData e) => NFData (Array U ix e)

Methods

rnf :: Array U ix e -> ()

(Index ix, NFData e) => NFData (Array S ix e)

Methods

rnf :: Array S ix e -> ()

(Index ix, NFData e) => NFData (Array P ix e)

Methods

rnf :: Array P ix e -> ()

(Index ix, NFData e) => NFData (Array N ix e)

Methods

rnf :: Array N ix e -> ()

(Index ix, NFData e) => NFData (Array B ix e)

Methods

rnf :: Array B ix e -> ()

data Array L

data Array L = LArray {

• lComp :: Comp
• lData :: !(Array LN ix e)

}

data Array LN

data Array LN = List {

• unList :: [Elt LN ix e]

}

data Array D

data Array D = DArray {

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

}

data Array M

data Array M = MArray {

• mComp :: !Comp
• mSize :: !ix
• mUnsafeLinearIndex :: Int -> e

}

data Array DW

data Array DW = DWArray {

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

}

data Array DI

data Array DI = DIArray {

• idArray :: Array D ix e

}

data Array U

data Array U = UArray {

• uComp :: !Comp
• uSize :: !ix
• uData :: !(Vector e)

}

data Array S

data Array S = SArray {

• sComp :: !Comp
• sSize :: !ix
• sData :: !(Vector e)

}

data Array P

data Array P = PArray {

• pComp :: !Comp
• pSize :: !ix
• pData :: !ByteArray

}

data Array N

data Array N = NArray {

• nComp :: Comp
• nSize :: !ix
• nData :: !(Array e)

}

data Array B

data Array B = BArray {

• bComp :: !Comp
• bSize :: !ix
• bData :: !(Array e)

}

type Item (Array L ix e)

type Item (Array L ix e) = ListItem ix e

type Item (Array LN ix e)

type Item (Array LN ix e) = ListItem ix e

type Item (Array U ix e)

type Item (Array U ix e) = Item (Array L ix e)

type Item (Array S ix e)

type Item (Array S ix e) = Item (Array L ix e)

type Item (Array P ix e)

type Item (Array P ix e) = Item (Array L ix e)

type Item (Array N ix e)

type Item (Array N ix e) = Item (Array L ix e)

type Item (Array B ix e)

type Item (Array B ix e) = Item (Array L ix e)

type family Elt r ix e :: * where ...

Equations

Elt r Ix1 e = e

Elt r ix e = Array (EltRepr r ix) (Lower ix) e

type family EltRepr r ix :: *

Instances

type EltRepr L ix

type EltRepr L ix = L

type EltRepr LN ix

type EltRepr LN ix = LN

type EltRepr D ix

type EltRepr D ix = D

type EltRepr M ix

type EltRepr M ix = M

type EltRepr DW ix

type EltRepr DW ix = D

type EltRepr DI ix

type EltRepr DI ix = DI

type EltRepr U ix

type EltRepr U ix = M

type EltRepr S ix

type EltRepr S ix = M

type EltRepr P ix

type EltRepr P ix = M

type EltRepr N ix

type EltRepr N ix = M

type EltRepr B ix

type EltRepr B ix = M

class (Typeable r, Index ix) => Construct r ix e

Array types that can be constructed.

Minimal complete definition

getComp, setComp, unsafeMakeArray

Instances

(Index ix, Ragged L ix e, Ragged L (Lower ix) e, (~) * (Elt L ix e) (Array L (Lower ix) e)) => Construct L ix e

Methods

getComp :: Array L ix e -> Comp

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

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

Construct L Ix1 e

Methods

getComp :: Array L Ix1 e -> Comp

setComp :: Comp -> Array L Ix1 e -> Array L Ix1 e

unsafeMakeArray :: Comp -> Ix1 -> (Ix1 -> e) -> Array L Ix1 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

Index ix => Construct M ix e

Methods

getComp :: Array M ix e -> Comp

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

unsafeMakeArray :: Comp -> ix -> (ix -> e) -> Array M 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

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

(Unbox e, Index ix) => Construct U ix e

Methods

getComp :: Array U ix e -> Comp

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

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

(Storable e, Index ix) => Construct S ix e

Methods

getComp :: Array S ix e -> Comp

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

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

(Prim e, Index ix) => Construct P ix e

Methods

getComp :: Array P ix e -> Comp

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

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

(Index ix, NFData e) => Construct N ix e

Methods

getComp :: Array N ix e -> Comp

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

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

Index ix => Construct B ix e

Methods

getComp :: Array B ix e -> Comp

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

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

class Size r ix e => Source r ix e

Arrays that can be used as source to practically any manipulation function.

Instances

Index ix => Source D ix e

Methods

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

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

Index ix => Source M ix e

Methods

unsafeIndex :: Array M ix e -> ix -> e

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

(Unbox e, Index ix) => Source U ix e

Methods

unsafeIndex :: Array U ix e -> ix -> e

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

(Storable e, Index ix) => Source S ix e

Methods

unsafeIndex :: Array S ix e -> ix -> e

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

(Prim e, Index ix) => Source P ix e

Methods

unsafeIndex :: Array P ix e -> ix -> e

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

(Index ix, NFData e) => Source N ix e

Methods

unsafeIndex :: Array N ix e -> ix -> e

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

Index ix => Source B ix e

Methods

unsafeIndex :: Array B ix e -> ix -> e

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

class Size r ix e => Load r ix e where

Any array that can be computed

Minimal complete definition

loadS, loadP

Methods

loadS

Arguments

:: Monad m

=> Array r ix e

Array that is being loaded

-> (Int -> m e)

Function that reads an element from target array

-> (Int -> e -> m ())

Function that writes an element into target array

-> m ()

Load an array into memory sequentially

loadP

Arguments

:: [Int]

List of capabilities to run workers on, as described in forkOn. Empty list will imply all capabilities, i.e. run on all cores available through +RTS -N.

-> Array r ix e

Array that is being loaded

-> (Int -> IO e)

Function that reads an element from target array

-> (Int -> e -> IO ())

Function that writes an element into target array

-> IO ()

Load an array into memory in parallel

Instances

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 => Load M ix e

Methods

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

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

(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 => 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 ()

class Construct r ix e => Size r ix e

An array that contains size information. They can be resized and new arrays extracted from it in constant time.

Minimal complete definition

size, unsafeResize, unsafeExtract

Instances

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 => Size M ix e

Methods

size :: Array M ix e -> ix

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

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

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 => 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

(Unbox e, Index ix) => Size U ix e

Methods

size :: Array U ix e -> ix

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

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

(Storable e, Index ix) => Size S ix e

Methods

size :: Array S ix e -> ix

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

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

(Prim e, Index ix) => Size P ix e

Methods

size :: Array P ix e -> ix

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

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

(Index ix, NFData e) => Size N ix e

Methods

size :: Array N ix e -> ix

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

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

Index ix => Size B ix e

Methods

size :: Array B ix e -> ix

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

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

class Size r ix e => Slice r ix e

Minimal complete definition

unsafeSlice

Instances

(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)

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

Methods

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

Slice M Ix1 e

Methods

unsafeSlice :: Array M Ix1 e -> Ix1 -> Ix1 -> Dim -> Maybe (Elt M Ix1 e)

(Unbox e, Index ix, Index (Lower ix), (~) * (Elt U ix e) (Elt M ix e), (~) * (Elt M ix e) (Array M (Lower ix) e)) => Slice U ix e

Methods

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

Unbox e => Slice U Ix1 e

Methods

unsafeSlice :: Array U Ix1 e -> Ix1 -> Ix1 -> Dim -> Maybe (Elt U Ix1 e)

(Prim e, Index ix, Index (Lower ix), (~) * (Elt P ix e) (Elt M ix e), (~) * (Elt M ix e) (Array M (Lower ix) e)) => Slice P ix e

Methods

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

Prim e => Slice P Ix1 e

Methods

unsafeSlice :: Array P Ix1 e -> Ix1 -> Ix1 -> Dim -> Maybe (Elt P Ix1 e)

class OuterSlice r ix e where

Minimal complete definition

unsafeOuterSlice

Methods

outerLength :: Array r ix e -> Int

outerLength :: Size r ix e => Array r ix e -> Int

Instances

Ragged L ix e => OuterSlice L ix e

Methods

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

outerLength :: Array L ix e -> Int

OuterSlice L Ix1 e

Methods

unsafeOuterSlice :: Array L Ix1 e -> Int -> Elt L Ix1 e

outerLength :: Array L Ix1 e -> Int

((~) * (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

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

Methods

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

outerLength :: Array M ix e -> Int

OuterSlice M Ix1 e

Methods

unsafeOuterSlice :: Array M Ix1 e -> Int -> Elt M Ix1 e

outerLength :: Array M Ix1 e -> Int

(Unbox e, Index ix, Index (Lower ix), (~) * (Elt U ix e) (Elt M ix e), (~) * (Elt M ix e) (Array M (Lower ix) e)) => OuterSlice U ix e

Methods

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

outerLength :: Array U ix e -> Int

Unbox e => OuterSlice U Ix1 e

Methods

unsafeOuterSlice :: Array U Ix1 e -> Int -> Elt U Ix1 e

outerLength :: Array U Ix1 e -> Int

(Storable e, Index ix, Index (Lower ix), (~) * (Elt M ix e) (Array M (Lower ix) e), (~) * (Elt S ix e) (Array M (Lower ix) e)) => OuterSlice S ix e

Methods

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

outerLength :: Array S ix e -> Int

(Prim e, Index ix, Index (Lower ix), (~) * (Elt M ix e) (Array M (Lower ix) e), (~) * (Elt P ix e) (Array M (Lower ix) e)) => OuterSlice P ix e

Methods

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

outerLength :: Array P ix e -> Int

Prim e => OuterSlice P Ix1 e

Methods

unsafeOuterSlice :: Array P Ix1 e -> Int -> Elt P Ix1 e

outerLength :: Array P Ix1 e -> Int

(NFData e, Index ix, Index (Lower ix), (~) * (Elt M ix e) (Array M (Lower ix) e), (~) * (Elt N ix e) (Array M (Lower ix) e)) => OuterSlice N ix e

Methods

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

outerLength :: Array N ix e -> Int

(NFData e, Index ix, Index (Lower ix), (~) * (Elt M ix e) (Array M (Lower ix) e), (~) * (Elt B ix e) (Array M (Lower ix) e)) => OuterSlice B ix e

Methods

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

outerLength :: Array B ix e -> Int

class Size r ix e => InnerSlice r ix e

Minimal complete definition

unsafeInnerSlice

Instances

((~) * (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 M ix e) (Array M (Lower ix) e), Index ix, Index (Lower ix)) => InnerSlice M ix e

Methods

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

InnerSlice M Ix1 e

Methods

unsafeInnerSlice :: Array M Ix1 e -> (Lower Ix1, Int) -> Int -> Elt M Ix1 e

(Unbox e, Index ix, Index (Lower ix), (~) * (Elt U ix e) (Elt M ix e), (~) * (Elt M ix e) (Array M (Lower ix) e)) => InnerSlice U ix e

Methods

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

Unbox e => InnerSlice U Ix1 e

Methods

unsafeInnerSlice :: Array U Ix1 e -> (Lower Ix1, Int) -> Int -> Elt U Ix1 e

(Storable e, Index ix, Index (Lower ix), (~) * (Elt M ix e) (Array M (Lower ix) e), (~) * (Elt S ix e) (Array M (Lower ix) e)) => InnerSlice S ix e

Methods

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

(Prim e, Index ix, Index (Lower ix), (~) * (Elt M ix e) (Array M (Lower ix) e), (~) * (Elt P ix e) (Array M (Lower ix) e)) => InnerSlice P ix e

Methods

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

Prim e => InnerSlice P Ix1 e

Methods

unsafeInnerSlice :: Array P Ix1 e -> (Lower Ix1, Int) -> Int -> Elt P Ix1 e

(NFData e, Index ix, Index (Lower ix), (~) * (Elt M ix e) (Array M (Lower ix) e), (~) * (Elt N ix e) (Array M (Lower ix) e)) => InnerSlice N ix e

Methods

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

(NFData e, Index ix, Index (Lower ix), (~) * (Elt M ix e) (Array M (Lower ix) e), (~) * (Elt B ix e) (Array M (Lower ix) e)) => InnerSlice B ix e

Methods

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

class Source r ix e => Manifest r ix e

Manifest arrays are backed by actual memory and values are looked up versus computed as it is with delayed arrays. Because of this fact indexing functions (!), (!?), etc. are constrained to manifest arrays only.

Minimal complete definition

unsafeLinearIndexM

Instances

Index ix => Manifest M ix e

Methods

unsafeLinearIndexM :: Array M ix e -> Int -> e

(Unbox e, Index ix) => Manifest U ix e

Methods

unsafeLinearIndexM :: Array U ix e -> Int -> e

(Index ix, Storable e) => Manifest S ix e

Methods

unsafeLinearIndexM :: Array S ix e -> Int -> e

(Index ix, Prim e) => Manifest P ix e

Methods

unsafeLinearIndexM :: Array P ix e -> Int -> e

(Index ix, NFData e) => Manifest N ix e

Methods

unsafeLinearIndexM :: Array N ix e -> Int -> e

Index ix => Manifest B ix e

Methods

unsafeLinearIndexM :: Array B ix e -> Int -> e

class Manifest r ix e => Mutable r ix e

Minimal complete definition

msize, unsafeThaw, unsafeFreeze, unsafeNew, unsafeNewZero, unsafeLinearRead, unsafeLinearWrite

Instances

(Unbox e, Index ix) => Mutable U ix e

Associated Types

data MArray s U ix e :: *

Methods

msize :: MArray s U ix e -> ix

unsafeThaw :: PrimMonad m => Array U ix e -> m (MArray (PrimState m) U ix e)

unsafeFreeze :: PrimMonad m => Comp -> MArray (PrimState m) U ix e -> m (Array U ix e)

unsafeNew :: PrimMonad m => ix -> m (MArray (PrimState m) U ix e)

unsafeNewZero :: PrimMonad m => ix -> m (MArray (PrimState m) U ix e)

unsafeLinearRead :: PrimMonad m => MArray (PrimState m) U ix e -> Int -> m e

unsafeLinearWrite :: PrimMonad m => MArray (PrimState m) U ix e -> Int -> e -> m ()

(Index ix, Storable e) => Mutable S ix e

Associated Types

data MArray s S ix e :: *

Methods

msize :: MArray s S ix e -> ix

unsafeThaw :: PrimMonad m => Array S ix e -> m (MArray (PrimState m) S ix e)

unsafeFreeze :: PrimMonad m => Comp -> MArray (PrimState m) S ix e -> m (Array S ix e)

unsafeNew :: PrimMonad m => ix -> m (MArray (PrimState m) S ix e)

unsafeNewZero :: PrimMonad m => ix -> m (MArray (PrimState m) S ix e)

unsafeLinearRead :: PrimMonad m => MArray (PrimState m) S ix e -> Int -> m e

unsafeLinearWrite :: PrimMonad m => MArray (PrimState m) S ix e -> Int -> e -> m ()

(Index ix, Prim e) => Mutable P ix e

Associated Types

data MArray s P ix e :: *

Methods

msize :: MArray s P ix e -> ix

unsafeThaw :: PrimMonad m => Array P ix e -> m (MArray (PrimState m) P ix e)

unsafeFreeze :: PrimMonad m => Comp -> MArray (PrimState m) P ix e -> m (Array P ix e)

unsafeNew :: PrimMonad m => ix -> m (MArray (PrimState m) P ix e)

unsafeNewZero :: PrimMonad m => ix -> m (MArray (PrimState m) P ix e)

unsafeLinearRead :: PrimMonad m => MArray (PrimState m) P ix e -> Int -> m e

unsafeLinearWrite :: PrimMonad m => MArray (PrimState m) P ix e -> Int -> e -> m ()

(Index ix, NFData e) => Mutable N ix e

Associated Types

data MArray s N ix e :: *

Methods

msize :: MArray s N ix e -> ix

unsafeThaw :: PrimMonad m => Array N ix e -> m (MArray (PrimState m) N ix e)

unsafeFreeze :: PrimMonad m => Comp -> MArray (PrimState m) N ix e -> m (Array N ix e)

unsafeNew :: PrimMonad m => ix -> m (MArray (PrimState m) N ix e)

unsafeNewZero :: PrimMonad m => ix -> m (MArray (PrimState m) N ix e)

unsafeLinearRead :: PrimMonad m => MArray (PrimState m) N ix e -> Int -> m e

unsafeLinearWrite :: PrimMonad m => MArray (PrimState m) N ix e -> Int -> e -> m ()

Index ix => Mutable B ix e

Associated Types

data MArray s B ix e :: *

Methods

msize :: MArray s B ix e -> ix

unsafeThaw :: PrimMonad m => Array B ix e -> m (MArray (PrimState m) B ix e)

unsafeFreeze :: PrimMonad m => Comp -> MArray (PrimState m) B ix e -> m (Array B ix e)

unsafeNew :: PrimMonad m => ix -> m (MArray (PrimState m) B ix e)

unsafeNewZero :: PrimMonad m => ix -> m (MArray (PrimState m) B ix e)

unsafeLinearRead :: PrimMonad m => MArray (PrimState m) B ix e -> Int -> m e

unsafeLinearWrite :: PrimMonad m => MArray (PrimState m) B ix e -> Int -> e -> m ()

class Construct r ix e => Ragged r ix e where

Minimal complete definition

empty, isNull, cons, uncons, unsafeGenerateM, edgeSize, flatten, loadRagged, raggedFormat

Methods

empty :: Comp -> Array r ix e

isNull :: Array r ix e -> Bool

cons :: Elt r ix e -> Array r ix e -> Array r ix e

uncons :: Array r ix e -> Maybe (Elt r ix e, Array r ix e)

edgeSize :: Array r ix e -> ix

flatten :: Array r ix e -> Array r Ix1 e

loadRagged :: (IO () -> IO ()) -> (Int -> e -> IO a) -> Int -> Int -> Lower ix -> Array r ix e -> IO ()

raggedFormat :: (e -> String) -> String -> Array r ix e -> String

Instances

(Index ix, Index (Lower ix), Ragged L (Lower ix) e, (~) * (Elt L ix e) (Array L (Lower ix) e), (~) * (Elt LN ix e) (Array LN (Lower ix) e), Coercible * (Elt LN ix e) [Elt LN (Lower ix) e]) => Ragged L ix e

Methods

empty :: Comp -> Array L ix e

isNull :: Array L ix e -> Bool

cons :: Elt L ix e -> Array L ix e -> Array L ix e

uncons :: Array L ix e -> Maybe (Elt L ix e, Array L ix e)

unsafeGenerateM :: Monad m => Comp -> ix -> (ix -> m e) -> m (Array L ix e)

edgeSize :: Array L ix e -> ix

flatten :: Array L ix e -> Array L Ix1 e

loadRagged :: (IO () -> IO ()) -> (Int -> e -> IO a) -> Int -> Int -> Lower ix -> Array L ix e -> IO ()

raggedFormat :: (e -> String) -> String -> Array L ix e -> String

Ragged L Ix1 e

Methods

empty :: Comp -> Array L Ix1 e

isNull :: Array L Ix1 e -> Bool

cons :: Elt L Ix1 e -> Array L Ix1 e -> Array L Ix1 e

uncons :: Array L Ix1 e -> Maybe (Elt L Ix1 e, Array L Ix1 e)

unsafeGenerateM :: Monad m => Comp -> Ix1 -> (Ix1 -> m e) -> m (Array L Ix1 e)

edgeSize :: Array L Ix1 e -> Ix1

flatten :: Array L Ix1 e -> Array L Ix1 e

loadRagged :: (IO () -> IO ()) -> (Int -> e -> IO a) -> Int -> Int -> Lower Ix1 -> Array L Ix1 e -> IO ()

raggedFormat :: (e -> String) -> String -> Array L Ix1 e -> String

class Nested r ix e where

Minimal complete definition

fromNested, toNested

Methods

fromNested :: NestedStruct r ix e -> Array r ix e

toNested :: Array r ix e -> NestedStruct r ix e

Instances

Nested L ix e

Methods

fromNested :: NestedStruct L ix e -> Array L ix e

toNested :: Array L ix e -> NestedStruct L ix e

((~) * (Elt LN ix e) (Array LN (Lower ix) e), (~) * (ListItem ix e) [ListItem (Lower ix) e], Coercible * (Elt LN ix e) (ListItem ix e)) => Nested LN ix e

Methods

fromNested :: NestedStruct LN ix e -> Array LN ix e

toNested :: Array LN ix e -> NestedStruct LN ix e

Nested LN Ix1 e

Methods

fromNested :: NestedStruct LN Ix1 e -> Array LN Ix1 e

toNested :: Array LN Ix1 e -> NestedStruct LN Ix1 e

type family NestedStruct r ix e :: *

Instances

type NestedStruct L ix e

type NestedStruct L ix e = Array LN ix e

type NestedStruct LN ix e

type NestedStruct LN ix e = [ListItem ix e]

data L

Constructors

L

Instances

(Index ix, Index (Lower ix), Ragged L (Lower ix) e, (~) * (Elt L ix e) (Array L (Lower ix) e), (~) * (Elt LN ix e) (Array LN (Lower ix) e), Coercible * (Elt LN ix e) [Elt LN (Lower ix) e]) => Ragged L ix e

Methods

empty :: Comp -> Array L ix e

isNull :: Array L ix e -> Bool

cons :: Elt L ix e -> Array L ix e -> Array L ix e

uncons :: Array L ix e -> Maybe (Elt L ix e, Array L ix e)

unsafeGenerateM :: Monad m => Comp -> ix -> (ix -> m e) -> m (Array L ix e)

edgeSize :: Array L ix e -> ix

flatten :: Array L ix e -> Array L Ix1 e

loadRagged :: (IO () -> IO ()) -> (Int -> e -> IO a) -> Int -> Int -> Lower ix -> Array L ix e -> IO ()

raggedFormat :: (e -> String) -> String -> Array L ix e -> String

Ragged L Ix1 e

Methods

empty :: Comp -> Array L Ix1 e

isNull :: Array L Ix1 e -> Bool

cons :: Elt L Ix1 e -> Array L Ix1 e -> Array L Ix1 e

uncons :: Array L Ix1 e -> Maybe (Elt L Ix1 e, Array L Ix1 e)

unsafeGenerateM :: Monad m => Comp -> Ix1 -> (Ix1 -> m e) -> m (Array L Ix1 e)

edgeSize :: Array L Ix1 e -> Ix1

flatten :: Array L Ix1 e -> Array L Ix1 e

loadRagged :: (IO () -> IO ()) -> (Int -> e -> IO a) -> Int -> Int -> Lower Ix1 -> Array L Ix1 e -> IO ()

raggedFormat :: (e -> String) -> String -> Array L Ix1 e -> String

Nested L ix e

Methods

fromNested :: NestedStruct L ix e -> Array L ix e

toNested :: Array L ix e -> NestedStruct L ix e

Ragged L ix e => OuterSlice L ix e

Methods

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

outerLength :: Array L ix e -> Int

OuterSlice L Ix1 e

Methods

unsafeOuterSlice :: Array L Ix1 e -> Int -> Elt L Ix1 e

outerLength :: Array L Ix1 e -> Int

(Index ix, Ragged L ix e, Ragged L (Lower ix) e, (~) * (Elt L ix e) (Array L (Lower ix) e)) => Construct L ix e

Methods

getComp :: Array L ix e -> Comp

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

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

Construct L Ix1 e

Methods

getComp :: Array L Ix1 e -> Comp

setComp :: Comp -> Array L Ix1 e -> Array L Ix1 e

unsafeMakeArray :: Comp -> Ix1 -> (Ix1 -> e) -> Array L Ix1 e

Nested LN ix e => IsList (Array L ix e)

Associated Types

type Item (Array L ix e) :: *

Methods

fromList :: [Item (Array L ix e)] -> Array L ix e

fromListN :: Int -> [Item (Array L ix e)] -> Array L ix e

toList :: Array L ix e -> [Item (Array L ix e)]

(Ragged L ix e, Show e) => Show (Array L ix e)

Methods

showsPrec :: Int -> Array L ix e -> ShowS

show :: Array L ix e -> String

showList :: [Array L ix e] -> ShowS

data Array L

data Array L = LArray {

• lComp :: Comp
• lData :: !(Array LN ix e)

}

type EltRepr L ix

type EltRepr L ix = L

type NestedStruct L ix e

type NestedStruct L ix e = Array LN ix e

type Item (Array L ix e)

type Item (Array L ix e) = ListItem ix e

data LN

Instances

((~) * (Elt LN ix e) (Array LN (Lower ix) e), (~) * (ListItem ix e) [ListItem (Lower ix) e], Coercible * (Elt LN ix e) (ListItem ix e)) => Nested LN ix e

Methods

fromNested :: NestedStruct LN ix e -> Array LN ix e

toNested :: Array LN ix e -> NestedStruct LN ix e

Nested LN Ix1 e

Methods

fromNested :: NestedStruct LN Ix1 e -> Array LN Ix1 e

toNested :: Array LN Ix1 e -> NestedStruct LN Ix1 e

Nested LN ix e => IsList (Array LN ix e)

Associated Types

type Item (Array LN ix e) :: *

Methods

fromList :: [Item (Array LN ix e)] -> Array LN ix e

fromListN :: Int -> [Item (Array LN ix e)] -> Array LN ix e

toList :: Array LN ix e -> [Item (Array LN ix e)]

(Ragged L ix e, Nested LN ix e, Show e) => Show (Array LN ix e)

Methods

showsPrec :: Int -> Array LN ix e -> ShowS

show :: Array LN ix e -> String

showList :: [Array LN ix e] -> ShowS

data Array LN

data Array LN = List {

• unList :: [Elt LN ix e]

}

type EltRepr LN ix

type EltRepr LN ix = LN

type NestedStruct LN ix e

type NestedStruct LN ix e = [ListItem ix e]

type Item (Array LN ix e)

type Item (Array LN ix e) = ListItem ix e

type family ListItem ix e :: * where ...

Equations

ListItem Ix1 e = e

ListItem ix e = [ListItem (Lower ix) e]

data Comp

Computation type to use.

Constructors

Seq

Sequential computation

ParOn [Int]

Use Par instead to use your CPU to the fullest. Also don't forget to compile the program with -threaded flag.

Parallel computation with a list of capabilities to run computation on. Specifying an empty list (ParOn []) or using Par will result in utilization of all available capabilities, which are set at runtime by +RTS -Nx or at compile time by GHC flag -with-rtsopts=-Nx, where x is the number of capabilities. Ommiting x in above flags defaults to number available cores.

Instances

Eq Comp

Methods

(==) :: Comp -> Comp -> Bool

(/=) :: Comp -> Comp -> Bool

Show Comp

Methods

showsPrec :: Int -> Comp -> ShowS

show :: Comp -> String

showList :: [Comp] -> ShowS

Monoid Comp

Methods

mempty :: Comp

mappend :: Comp -> Comp -> Comp

mconcat :: [Comp] -> Comp

NFData Comp

Methods

rnf :: Comp -> ()

pattern Par :: Comp

Parallel computation using all available cores.

module Data.Massiv.Core.Index

elemsCount :: Size r ix e => Array r ix e -> Int

O(1) - Get the number of elements in the array

isEmpty :: Size r ix e => Array r ix e -> Bool

O(1) - Check if array has no elements.