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)

Defined in Data.Massiv.Array.Delayed.Internal

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)

Defined in Data.Massiv.Array.Delayed.Windowed

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)

Defined in Data.Massiv.Array.Delayed.Interleaved

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)

Defined in Data.Massiv.Array.Delayed.Internal

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.

Defined in Data.Massiv.Array.Delayed.Internal

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.

Defined in Data.Massiv.Array.Manifest.Internal

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.

Defined in Data.Massiv.Array.Manifest.Boxed

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)

Defined in Data.Massiv.Core.List

Associated Types

type Item (Array L ix e) :: Type

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)

Defined in Data.Massiv.Core.List

Associated Types

type Item (Array LN ix e) :: Type

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)

Defined in Data.Massiv.Array.Manifest.Unboxed

Associated Types

type Item (Array U ix e) :: Type

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)

Defined in Data.Massiv.Array.Manifest.Storable

Associated Types

type Item (Array S ix e) :: Type

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)

Defined in Data.Massiv.Array.Manifest.Primitive

Associated Types

type Item (Array P ix e) :: Type

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)

Defined in Data.Massiv.Array.Manifest.Boxed

Associated Types

type Item (Array N ix e) :: Type

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)

Defined in Data.Massiv.Array.Manifest.Boxed

Associated Types

type Item (Array B ix e) :: Type

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)

Defined in Data.Massiv.Array.Delayed.Internal

Methods

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

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

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

Defined in Data.Massiv.Array.Manifest.Internal

Methods

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

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

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

Defined in Data.Massiv.Array.Manifest.Unboxed

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)

Defined in Data.Massiv.Array.Manifest.Storable

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)

Defined in Data.Massiv.Array.Manifest.Primitive

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)

Defined in Data.Massiv.Array.Manifest.Boxed

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)

Defined in Data.Massiv.Array.Manifest.Boxed

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)

Defined in Data.Massiv.Array.Delayed.Internal

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)

Defined in Data.Massiv.Array.Delayed.Internal

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)

Defined in Data.Massiv.Array.Delayed.Internal

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)

Defined in Data.Massiv.Array.Delayed.Internal

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

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

Defined in Data.Massiv.Array.Manifest.Internal

Methods

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

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

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

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

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

max :: Array M ix e -> Array M ix e -> Array M ix e

min :: Array M ix e -> Array M ix e -> Array M ix e

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

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

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

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

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

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

max :: Array U ix e -> Array U ix e -> Array U ix e

min :: Array U ix e -> Array U ix e -> Array U ix e

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

Defined in Data.Massiv.Array.Manifest.Storable

Methods

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

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

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

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

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

max :: Array S ix e -> Array S ix e -> Array S ix e

min :: Array S ix e -> Array S ix e -> Array S ix e

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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

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

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

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

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

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

max :: Array P ix e -> Array P ix e -> Array P ix e

min :: Array P ix e -> Array P ix e -> Array P ix e

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

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

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

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

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

max :: Array N ix e -> Array N ix e -> Array N ix e

min :: Array N ix e -> Array N ix e -> Array N ix e

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

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

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

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

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

max :: Array B ix e -> Array B ix e -> Array B ix e

min :: Array B ix e -> Array B ix e -> Array B ix e

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

Defined in Data.Massiv.Core.List

Methods

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

show :: Array r ix e -> String

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

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

Defined in Data.Massiv.Core.List

Methods

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

show :: Array L ix e -> String

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

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

Defined in Data.Massiv.Core.List

Methods

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

show :: Array LN ix e -> String

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

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

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

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

show :: Array DW ix e -> String

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

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

rnf :: Array U ix e -> ()

Index ix => NFData (Array S ix e)

Defined in Data.Massiv.Array.Manifest.Storable

Methods

rnf :: Array S ix e -> ()

Index ix => NFData (Array P ix e)

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

rnf :: Array P ix e -> ()

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

rnf :: Array N ix e -> ()

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

rnf :: Array B ix e -> ()

data Array L ix e

Defined in Data.Massiv.Core.List

data Array L ix e = LArray {

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

}

newtype Array LN ix e

Defined in Data.Massiv.Core.List

newtype Array LN ix e = List {

• unList :: [Elt LN ix e]

}

data Array D ix e

Defined in Data.Massiv.Array.Delayed.Internal

data Array D ix e = DArray {

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

}

data Array M ix e

Defined in Data.Massiv.Array.Manifest.Internal

data Array M ix e = MArray {

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

}

data Array U ix e

Defined in Data.Massiv.Array.Manifest.Unboxed

data Array U ix e = UArray {

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

}

data Array S ix e

Defined in Data.Massiv.Array.Manifest.Storable

data Array S ix e = SArray {

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

}

data Array P ix e

Defined in Data.Massiv.Array.Manifest.Primitive

data Array P ix e = PArray {

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

}

newtype Array N ix e

Defined in Data.Massiv.Array.Manifest.Boxed

newtype Array N ix e = NArray {

• bArray :: Array B ix e

}

data Array B ix e

Defined in Data.Massiv.Array.Manifest.Boxed

data Array B ix e = BArray {

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

}

data Array DW ix e

Defined in Data.Massiv.Array.Delayed.Windowed

data Array DW ix e = DWArray {

• dwArray :: !(Array D ix e)
• dwStencilSize :: !(Maybe ix)
• dwWindow :: !(Maybe (Window ix e))

}

newtype Array DI ix e

Defined in Data.Massiv.Array.Delayed.Interleaved

newtype Array DI ix e = DIArray {

• diArray :: Array D ix e

}

type Item (Array L ix e)

Defined in Data.Massiv.Core.List

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

type Item (Array LN ix e)

Defined in Data.Massiv.Core.List

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

type Item (Array U ix e)

Defined in Data.Massiv.Array.Manifest.Unboxed

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

type Item (Array S ix e)

Defined in Data.Massiv.Array.Manifest.Storable

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

type Item (Array P ix e)

Defined in Data.Massiv.Array.Manifest.Primitive

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

type Item (Array N ix e)

Defined in Data.Massiv.Array.Manifest.Boxed

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

type Item (Array B ix e)

Defined in Data.Massiv.Array.Manifest.Boxed

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

Defined in Data.Massiv.Core.List

type EltRepr L ix = L

type EltRepr LN ix

Defined in Data.Massiv.Core.List

type EltRepr LN ix = LN

type EltRepr D ix

Defined in Data.Massiv.Array.Delayed.Internal

type EltRepr D ix = D

type EltRepr M ix

Defined in Data.Massiv.Array.Manifest.Internal

type EltRepr M ix = M

type EltRepr U ix

Defined in Data.Massiv.Array.Manifest.Unboxed

type EltRepr U ix = M

type EltRepr S ix

Defined in Data.Massiv.Array.Manifest.Storable

type EltRepr S ix = M

type EltRepr P ix

Defined in Data.Massiv.Array.Manifest.Primitive

type EltRepr P ix = M

type EltRepr N ix

Defined in Data.Massiv.Array.Manifest.Boxed

type EltRepr N ix = M

type EltRepr B ix

Defined in Data.Massiv.Array.Manifest.Boxed

type EltRepr B ix = M

type EltRepr DW ix

Defined in Data.Massiv.Array.Delayed.Windowed

type EltRepr DW ix = D

type EltRepr DI ix

Defined in Data.Massiv.Array.Delayed.Interleaved

type EltRepr DI ix = DI

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

Defined in Data.Massiv.Core.List

Methods

getComp :: Array L ix e -> Comp

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

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

Construct L Ix1 e

Defined in Data.Massiv.Core.List

Methods

getComp :: Array L Ix1 e -> Comp

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

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

Index ix => Construct D ix e

Defined in Data.Massiv.Array.Delayed.Internal

Methods

getComp :: Array D ix e -> Comp

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

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

Index ix => Construct M ix e

Defined in Data.Massiv.Array.Manifest.Internal

Methods

getComp :: Array M ix e -> Comp

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

unsafeMakeArray :: Comp -> Sz ix -> (ix -> e) -> Array M ix e

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

getComp :: Array U ix e -> Comp

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

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

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

Defined in Data.Massiv.Array.Manifest.Storable

Methods

getComp :: Array S ix e -> Comp

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

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

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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

getComp :: Array P ix e -> Comp

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

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

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

getComp :: Array N ix e -> Comp

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

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

Index ix => Construct B ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

getComp :: Array B ix e -> Comp

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

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

Index ix => Construct DW ix e

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

getComp :: Array DW ix e -> Comp

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

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

Index ix => Construct DI ix e

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

getComp :: Array DI ix e -> Comp

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

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

Defined in Data.Massiv.Array.Delayed.Internal

Methods

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

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

Index ix => Source M ix e

Defined in Data.Massiv.Array.Manifest.Internal

Methods

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

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

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

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

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

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

Defined in Data.Massiv.Array.Manifest.Storable

Methods

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

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

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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

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

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

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

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

Index ix => Source B ix e

Defined in Data.Massiv.Array.Manifest.Boxed

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

Nothing

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

loadArrayWithStride

Arguments

:: Monad m

=> Int

Total number of workers (for Seq it's always 1)

-> (m () -> m ())

A monadic action that will schedule work for the workers (for Seq it's always id)

-> Stride ix

Stride to use

-> Sz ix

Size of the target array affected by the stride.

-> 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 with stride. Default implementation can only handle the sequential case and only if there is an instance of Source.

loadArrayWithStride

Arguments

:: (Source r ix e, Monad m)

=> Int

Total number of workers (for Seq it's always 1)

-> (m () -> m ())

A monadic action that will schedule work for the workers (for Seq it's always id)

-> Stride ix

Stride to use

-> Sz ix

Size of the target array affected by the stride.

-> 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 with stride. Default implementation can only handle the sequential case and only if there is an instance of Source.

loadArray

Arguments

:: Monad m

=> Int

Total number of workers (for Seq it's always 1)

-> (m () -> m ())

A monadic action that will schedule work for the workers (for Seq it's always id)

-> 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. Default implementation will respect the scheduler and use Source instance to do loading in row-major fashion in parallel as well as sequentially.

loadArray

Arguments

:: (Source r ix e, Monad m)

=> Int

Total number of workers (for Seq it's always 1)

-> (m () -> m ())

A monadic action that will schedule work for the workers (for Seq it's always id)

-> 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. Default implementation will respect the scheduler and use Source instance to do loading in row-major fashion in parallel as well as sequentially.

Instances

Index ix => Load D ix e

Defined in Data.Massiv.Array.Delayed.Internal

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

loadArrayWithStride :: Monad m => Int -> (m () -> m ()) -> Stride ix -> Sz ix -> Array D ix e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

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

Index ix => Load M ix e

Defined in Data.Massiv.Array.Manifest.Internal

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

loadArrayWithStride :: Monad m => Int -> (m () -> m ()) -> Stride ix -> Sz ix -> Array M ix e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

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

Load DW Ix5T e

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

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

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

loadArrayWithStride :: Monad m => Int -> (m () -> m ()) -> Stride Ix5T -> Sz Ix5T -> Array DW Ix5T e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

loadArray :: Monad m => Int -> (m () -> m ()) -> Array DW Ix5T e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

Load DW Ix4T e

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

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

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

loadArrayWithStride :: Monad m => Int -> (m () -> m ()) -> Stride Ix4T -> Sz Ix4T -> Array DW Ix4T e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

loadArray :: Monad m => Int -> (m () -> m ()) -> Array DW Ix4T e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

Load DW Ix3T e

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

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

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

loadArrayWithStride :: Monad m => Int -> (m () -> m ()) -> Stride Ix3T -> Sz Ix3T -> Array DW Ix3T e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

loadArray :: Monad m => Int -> (m () -> m ()) -> Array DW Ix3T e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

Load DW Ix2T e

Defined in Data.Massiv.Array.Delayed.Windowed

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

loadArrayWithStride :: Monad m => Int -> (m () -> m ()) -> Stride Ix2T -> Sz Ix2T -> Array DW Ix2T e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

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

Load DW Ix2 e

Defined in Data.Massiv.Array.Delayed.Windowed

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

loadArrayWithStride :: Monad m => Int -> (m () -> m ()) -> Stride Ix2 -> Sz Ix2 -> Array DW Ix2 e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

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

Load DW Ix1 e

Defined in Data.Massiv.Array.Delayed.Windowed

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

loadArrayWithStride :: Monad m => Int -> (m () -> m ()) -> Stride Ix1 -> Sz Ix1 -> Array DW Ix1 e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

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

Index ix => Load DI ix e

Defined in Data.Massiv.Array.Delayed.Interleaved

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

loadArrayWithStride :: Monad m => Int -> (m () -> m ()) -> Stride ix -> Sz ix -> Array DI ix e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

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

(Index (IxN n), Load DW (Ix (n - 1)) e) => Load DW (IxN n) e

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

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

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

loadArrayWithStride :: Monad m => Int -> (m () -> m ()) -> Stride (IxN n) -> Sz (IxN n) -> Array DW (IxN n) e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

loadArray :: Monad m => Int -> (m () -> m ()) -> Array DW (IxN n) e -> (Int -> m e) -> (Int -> e -> m ()) -> m ()

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

Defined in Data.Massiv.Array.Delayed.Internal

Methods

size :: Array D ix e -> Sz ix

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

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

Index ix => Size M ix e

Defined in Data.Massiv.Array.Manifest.Internal

Methods

size :: Array M ix e -> Sz ix

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

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

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

size :: Array U ix e -> Sz ix

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

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

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

Defined in Data.Massiv.Array.Manifest.Storable

Methods

size :: Array S ix e -> Sz ix

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

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

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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

size :: Array P ix e -> Sz ix

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

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

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

size :: Array N ix e -> Sz ix

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

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

Index ix => Size B ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

size :: Array B ix e -> Sz ix

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

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

Index ix => Size DW ix e

Any resize or extract on Windowed Array will loose the interior window and all other optimizations, thus hurting the performance a lot.

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

size :: Array DW ix e -> Sz ix

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

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

Index ix => Size DI ix e

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

size :: Array DI ix e -> Sz ix

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

unsafeExtract :: ix -> Sz ix -> Array DI ix e -> Array (EltRepr DI 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

Defined in Data.Massiv.Array.Delayed.Internal

Methods

unsafeSlice :: Array D ix e -> ix -> Sz 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

Defined in Data.Massiv.Array.Manifest.Internal

Methods

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

Slice M Ix1 e

Defined in Data.Massiv.Array.Manifest.Internal

Methods

unsafeSlice :: Array M Ix1 e -> Ix1 -> Sz 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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

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

Unbox e => Slice U Ix1 e

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

unsafeSlice :: Array U Ix1 e -> Ix1 -> Sz 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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

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

Prim e => Slice P Ix1 e

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

unsafeSlice :: Array P Ix1 e -> Ix1 -> Sz 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

Defined in Data.Massiv.Core.List

Methods

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

outerLength :: Array L ix e -> Int

OuterSlice L Ix1 e

Defined in Data.Massiv.Core.List

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

Defined in Data.Massiv.Array.Delayed.Internal

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

Defined in Data.Massiv.Array.Manifest.Internal

Methods

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

outerLength :: Array M ix e -> Int

OuterSlice M Ix1 e

Defined in Data.Massiv.Array.Manifest.Internal

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

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

outerLength :: Array U ix e -> Int

Unbox e => OuterSlice U Ix1 e

Defined in Data.Massiv.Array.Manifest.Unboxed

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

Defined in Data.Massiv.Array.Manifest.Storable

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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

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

outerLength :: Array P ix e -> Int

Prim e => OuterSlice P Ix1 e

Defined in Data.Massiv.Array.Manifest.Primitive

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

Defined in Data.Massiv.Array.Manifest.Boxed

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

Defined in Data.Massiv.Array.Manifest.Boxed

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

Defined in Data.Massiv.Array.Delayed.Internal

Methods

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

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

Defined in Data.Massiv.Array.Manifest.Internal

Methods

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

InnerSlice M Ix1 e

Defined in Data.Massiv.Array.Manifest.Internal

Methods

unsafeInnerSlice :: Array M Ix1 e -> (Sz (Lower Ix1), Sz1) -> 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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

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

Unbox e => InnerSlice U Ix1 e

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

unsafeInnerSlice :: Array U Ix1 e -> (Sz (Lower Ix1), Sz1) -> 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

Defined in Data.Massiv.Array.Manifest.Storable

Methods

unsafeInnerSlice :: Array S ix e -> (Sz (Lower ix), Sz1) -> 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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

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

Prim e => InnerSlice P Ix1 e

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

unsafeInnerSlice :: Array P Ix1 e -> (Sz (Lower Ix1), Sz1) -> 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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

unsafeInnerSlice :: Array N ix e -> (Sz (Lower ix), Sz1) -> 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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

unsafeInnerSlice :: Array B ix e -> (Sz (Lower ix), Sz1) -> 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

Defined in Data.Massiv.Array.Manifest.Internal

Methods

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

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

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

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

Defined in Data.Massiv.Array.Manifest.Storable

Methods

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

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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

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

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

Index ix => Manifest B ix e

Defined in Data.Massiv.Array.Manifest.Boxed

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Associated Types

data MArray s U ix e :: Type

Methods

msize :: MArray s U ix e -> Sz 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 => Sz ix -> m (MArray (PrimState m) U ix e)

unsafeNewZero :: PrimMonad m => Sz 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 ()

unsafeNewA :: Applicative f => ix -> WorldState -> f (WorldState, MArray RealWorld U ix e)

unsafeThawA :: Applicative m => Array U ix e -> WorldState -> m (WorldState, MArray RealWorld U ix e)

unsafeFreezeA :: Applicative m => Comp -> MArray RealWorld U ix e -> WorldState -> m (WorldState, Array U ix e)

unsafeLinearWriteA :: Applicative m => MArray RealWorld U ix e -> Int -> e -> WorldState -> m WorldState

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

Defined in Data.Massiv.Array.Manifest.Storable

Associated Types

data MArray s S ix e :: Type

Methods

msize :: MArray s S ix e -> Sz 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 => Sz ix -> m (MArray (PrimState m) S ix e)

unsafeNewZero :: PrimMonad m => Sz 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 ()

unsafeNewA :: Applicative f => ix -> WorldState -> f (WorldState, MArray RealWorld S ix e)

unsafeThawA :: Applicative m => Array S ix e -> WorldState -> m (WorldState, MArray RealWorld S ix e)

unsafeFreezeA :: Applicative m => Comp -> MArray RealWorld S ix e -> WorldState -> m (WorldState, Array S ix e)

unsafeLinearWriteA :: Applicative m => MArray RealWorld S ix e -> Int -> e -> WorldState -> m WorldState

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

Defined in Data.Massiv.Array.Manifest.Primitive

Associated Types

data MArray s P ix e :: Type

Methods

msize :: MArray s P ix e -> Sz 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 => Sz ix -> m (MArray (PrimState m) P ix e)

unsafeNewZero :: PrimMonad m => Sz 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 ()

unsafeNewA :: Applicative f => ix -> WorldState -> f (WorldState, MArray RealWorld P ix e)

unsafeThawA :: Applicative m => Array P ix e -> WorldState -> m (WorldState, MArray RealWorld P ix e)

unsafeFreezeA :: Applicative m => Comp -> MArray RealWorld P ix e -> WorldState -> m (WorldState, Array P ix e)

unsafeLinearWriteA :: Applicative m => MArray RealWorld P ix e -> Int -> e -> WorldState -> m WorldState

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

Defined in Data.Massiv.Array.Manifest.Boxed

Associated Types

data MArray s N ix e :: Type

Methods

msize :: MArray s N ix e -> Sz 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 => Sz ix -> m (MArray (PrimState m) N ix e)

unsafeNewZero :: PrimMonad m => Sz 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 ()

unsafeNewA :: Applicative f => ix -> WorldState -> f (WorldState, MArray RealWorld N ix e)

unsafeThawA :: Applicative m => Array N ix e -> WorldState -> m (WorldState, MArray RealWorld N ix e)

unsafeFreezeA :: Applicative m => Comp -> MArray RealWorld N ix e -> WorldState -> m (WorldState, Array N ix e)

unsafeLinearWriteA :: Applicative m => MArray RealWorld N ix e -> Int -> e -> WorldState -> m WorldState

Index ix => Mutable B ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Associated Types

data MArray s B ix e :: Type

Methods

msize :: MArray s B ix e -> Sz 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 => Sz ix -> m (MArray (PrimState m) B ix e)

unsafeNewZero :: PrimMonad m => Sz 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 ()

unsafeNewA :: Applicative f => ix -> WorldState -> f (WorldState, MArray RealWorld B ix e)

unsafeThawA :: Applicative m => Array B ix e -> WorldState -> m (WorldState, MArray RealWorld B ix e)

unsafeFreezeA :: Applicative m => Comp -> MArray RealWorld B ix e -> WorldState -> m (WorldState, Array B ix e)

unsafeLinearWriteA :: Applicative m => MArray RealWorld B ix e -> Int -> e -> WorldState -> m WorldState

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 -> Sz ix

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

loadRagged :: (IO () -> IO ()) -> (Int -> e -> IO a) -> Int -> Int -> 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

Defined in Data.Massiv.Core.List

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 -> Sz ix -> (ix -> m e) -> m (Array L ix e)

edgeSize :: Array L ix e -> Sz ix

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

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

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

Ragged L Ix1 e

Defined in Data.Massiv.Core.List

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 -> Sz Ix1 -> (Ix1 -> m e) -> m (Array L Ix1 e)

edgeSize :: Array L Ix1 e -> Sz Ix1

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

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

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

class Nested r ix e where

Methods

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

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

Instances

Nested L ix e

Defined in Data.Massiv.Core.List

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

Defined in Data.Massiv.Core.List

Methods

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

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

Nested LN Ix1 e

Defined in Data.Massiv.Core.List

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

Defined in Data.Massiv.Core.List

type NestedStruct L ix e = Array LN ix e

type NestedStruct LN ix e

Defined in Data.Massiv.Core.List

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

Defined in Data.Massiv.Core.List

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 -> Sz ix -> (ix -> m e) -> m (Array L ix e)

edgeSize :: Array L ix e -> Sz ix

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

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

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

Ragged L Ix1 e

Defined in Data.Massiv.Core.List

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 -> Sz Ix1 -> (Ix1 -> m e) -> m (Array L Ix1 e)

edgeSize :: Array L Ix1 e -> Sz Ix1

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

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

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

Nested L ix e

Defined in Data.Massiv.Core.List

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

Defined in Data.Massiv.Core.List

Methods

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

outerLength :: Array L ix e -> Int

OuterSlice L Ix1 e

Defined in Data.Massiv.Core.List

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

Defined in Data.Massiv.Core.List

Methods

getComp :: Array L ix e -> Comp

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

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

Construct L Ix1 e

Defined in Data.Massiv.Core.List

Methods

getComp :: Array L Ix1 e -> Comp

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

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

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

Defined in Data.Massiv.Core.List

Associated Types

type Item (Array L ix e) :: Type

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)

Defined in Data.Massiv.Core.List

Methods

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

show :: Array L ix e -> String

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

data Array L ix e

Defined in Data.Massiv.Core.List

data Array L ix e = LArray {

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

}

type EltRepr L ix

Defined in Data.Massiv.Core.List

type EltRepr L ix = L

type NestedStruct L ix e

Defined in Data.Massiv.Core.List

type NestedStruct L ix e = Array LN ix e

type Item (Array L ix e)

Defined in Data.Massiv.Core.List

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

Defined in Data.Massiv.Core.List

Methods

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

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

Nested LN Ix1 e

Defined in Data.Massiv.Core.List

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)

Defined in Data.Massiv.Core.List

Associated Types

type Item (Array LN ix e) :: Type

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, Show e) => Show (Array LN ix e)

Defined in Data.Massiv.Core.List

Methods

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

show :: Array LN ix e -> String

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

newtype Array LN ix e

Defined in Data.Massiv.Core.List

newtype Array LN ix e = List {

• unList :: [Elt LN ix e]

}

type EltRepr LN ix

Defined in Data.Massiv.Core.List

type EltRepr LN ix = LN

type NestedStruct LN ix e

Defined in Data.Massiv.Core.List

type NestedStruct LN ix e = [ListItem ix e]

type Item (Array LN ix e)

Defined in Data.Massiv.Core.List

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.

Bundled Patterns

pattern Par :: Comp

Parallel computation using all available cores.

Instances

Eq Comp

Defined in Data.Massiv.Core.Computation

Methods

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

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

Show Comp

Defined in Data.Massiv.Core.Computation

Methods

showsPrec :: Int -> Comp -> ShowS

show :: Comp -> String

showList :: [Comp] -> ShowS

Semigroup Comp

Defined in Data.Massiv.Core.Computation

Methods

(<>) :: Comp -> Comp -> Comp

sconcat :: NonEmpty Comp -> Comp

stimes :: Integral b => b -> Comp -> Comp

Monoid Comp

Defined in Data.Massiv.Core.Computation

Methods

mempty :: Comp

mappend :: Comp -> Comp -> Comp

mconcat :: [Comp] -> Comp

NFData Comp

Defined in Data.Massiv.Core.Computation

Methods

rnf :: Comp -> ()

pattern Par :: Comp

Parallel computation using all available cores.

module Data.Massiv.Core.Index