Data.Massiv.Core

Documentation

data family Array r ix e :: Type

The array family. Representations r describe how data is arranged or computed. All arrays have a common property that each index ix always maps to the same unique element e, even if that element does not yet exist in memory and the array has to be computed in order to get the value of that element. Data is always arranged in a nested row-major fashion. Rank of an array is specified by Dimensions ix.

Since: 0.1.0

Instances

Monad (Array DS Ix1)

Defined in Data.Massiv.Array.Delayed.Stream

Methods

(>>=) :: Array DS Ix1 a -> (a -> Array DS Ix1 b) -> Array DS Ix1 b

(>>) :: Array DS Ix1 a -> Array DS Ix1 b -> Array DS Ix1 b

return :: a -> Array DS Ix1 a

Index ix => Functor (Array DL ix)

Defined in Data.Massiv.Array.Delayed.Push

Methods

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

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

Functor (Array D ix)

Defined in Data.Massiv.Array.Delayed.Pull

Methods

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

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

Functor (Array DS Ix1)

Defined in Data.Massiv.Array.Delayed.Stream

Methods

fmap :: (a -> b) -> Array DS Ix1 a -> Array DS Ix1 b

(<$) :: a -> Array DS Ix1 b -> Array DS Ix1 a

Index ix => Functor (Array B ix)

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

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

Index ix => Functor (Array BL ix)

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

(<$) :: a -> Array BL ix b -> Array BL 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.Pull

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

Applicative (Array DS Ix1)

Defined in Data.Massiv.Array.Delayed.Stream

Methods

pure :: a -> Array DS Ix1 a

(<*>) :: Array DS Ix1 (a -> b) -> Array DS Ix1 a -> Array DS Ix1 b

liftA2 :: (a -> b -> c) -> Array DS Ix1 a -> Array DS Ix1 b -> Array DS Ix1 c

(*>) :: Array DS Ix1 a -> Array DS Ix1 b -> Array DS Ix1 b

(<*) :: Array DS Ix1 a -> Array DS Ix1 b -> Array DS Ix1 a

Index ix => Applicative (Array DI ix)

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

pure :: a -> Array DI ix a

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

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

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

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

Index ix => Foldable (Array D ix)

Row-major sequential folding over a Delayed array.

Defined in Data.Massiv.Array.Delayed.Pull

Methods

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

foldMap :: Monoid m => (a -> m) -> Array D ix a -> 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

Foldable (Array DS Ix1)

Defined in Data.Massiv.Array.Delayed.Stream

Methods

fold :: Monoid m => Array DS Ix1 m -> m

foldMap :: Monoid m => (a -> m) -> Array DS Ix1 a -> m

foldMap' :: Monoid m => (a -> m) -> Array DS Ix1 a -> m

foldr :: (a -> b -> b) -> b -> Array DS Ix1 a -> b

foldr' :: (a -> b -> b) -> b -> Array DS Ix1 a -> b

foldl :: (b -> a -> b) -> b -> Array DS Ix1 a -> b

foldl' :: (b -> a -> b) -> b -> Array DS Ix1 a -> b

foldr1 :: (a -> a -> a) -> Array DS Ix1 a -> a

foldl1 :: (a -> a -> a) -> Array DS Ix1 a -> a

toList :: Array DS Ix1 a -> [a]

null :: Array DS Ix1 a -> Bool

length :: Array DS Ix1 a -> Int

elem :: Eq a => a -> Array DS Ix1 a -> Bool

maximum :: Ord a => Array DS Ix1 a -> a

minimum :: Ord a => Array DS Ix1 a -> a

sum :: Num a => Array DS Ix1 a -> a

product :: Num a => Array DS Ix1 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

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

Index ix => Foldable (Array BL ix)

Row-major sequential folding over a Boxed array.

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

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

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

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

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

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

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

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

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

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

null :: Array BL ix a -> Bool

length :: Array BL ix a -> Int

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

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

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

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

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

Index ix => Foldable (Array DI ix)

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

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

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

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

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

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

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

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

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

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

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

null :: Array DI ix a -> Bool

length :: Array DI ix a -> Int

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

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

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

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

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

Index ix => Traversable (Array B ix)

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

traverse :: Applicative f => (a -> f b) -> Array B ix a -> f (Array B ix b)

sequenceA :: Applicative f => Array B ix (f a) -> f (Array B ix a)

mapM :: Monad m => (a -> m b) -> Array B ix a -> m (Array B ix b)

sequence :: Monad m => Array B ix (m a) -> m (Array B ix a)

Index ix => Traversable (Array BL ix)

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

traverse :: Applicative f => (a -> f b) -> Array BL ix a -> f (Array BL ix b)

sequenceA :: Applicative f => Array BL ix (f a) -> f (Array BL ix a)

mapM :: Monad m => (a -> m b) -> Array BL ix a -> m (Array BL ix b)

sequence :: Monad m => Array BL ix (m a) -> m (Array BL ix a)

Coercible (Elt ix e) (ListItem ix e) => IsList (Array L ix e)

Defined in Data.Massiv.Core.List

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

(Unbox e, IsList (Array 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)

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), Ragged L ix e) => IsList (Array S ix e)

Defined in Data.Massiv.Array.Manifest.Storable

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), Ragged L ix e) => IsList (Array P ix e)

Defined in Data.Massiv.Array.Manifest.Primitive

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

IsList (Array DS Ix1 e)

Defined in Data.Massiv.Array.Delayed.Stream

Associated Types

type Item (Array DS Ix1 e)

Methods

fromList :: [Item (Array DS Ix1 e)] -> Array DS Ix1 e

fromListN :: Int -> [Item (Array DS Ix1 e)] -> Array DS Ix1 e

toList :: Array DS Ix1 e -> [Item (Array DS Ix1 e)]

(NFData e, IsList (Array L ix e), Ragged L ix e) => IsList (Array BN ix e)

Defined in Data.Massiv.Array.Manifest.Boxed

Associated Types

type Item (Array BN ix e)

Methods

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

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

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

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

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

(IsList (Array L ix e), Ragged L ix e) => IsList (Array BL ix e)

Defined in Data.Massiv.Array.Manifest.Boxed

Associated Types

type Item (Array BL ix e)

Methods

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

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

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

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

Defined in Data.Massiv.Array.Delayed.Pull

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)

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 BN ix e)

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

(/=) :: Array BN ix e -> Array BN 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, Eq e) => Eq (Array BL ix e)

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

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

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

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

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

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

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

Defined in Data.Massiv.Array.Delayed.Pull

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

(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 BN ix e)

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

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

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

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

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

max :: Array BN ix e -> Array BN ix e -> Array BN ix e

min :: Array BN ix e -> Array BN ix e -> Array BN 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

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

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

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

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

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

max :: Array BL ix e -> Array BL ix e -> Array BL ix e

min :: Array BL ix e -> Array BL ix e -> Array BL ix e

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

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

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

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

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

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

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

max :: Array DI ix e -> Array DI ix e -> Array DI ix e

min :: Array DI ix e -> Array DI ix e -> Array DI ix e

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

show :: Array DL ix e -> String

showList :: [Array DL 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 D ix e)

Defined in Data.Massiv.Array.Delayed.Pull

Methods

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

show :: Array D ix e -> String

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

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

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

show :: Array U ix e -> String

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

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

Defined in Data.Massiv.Array.Manifest.Storable

Methods

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

show :: Array S ix e -> String

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

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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

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

show :: Array P ix e -> String

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

Show e => Show (Array DS Ix1 e)

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

showsPrec :: Int -> Array DS Ix1 e -> ShowS

show :: Array DS Ix1 e -> String

showList :: [Array DS Ix1 e] -> ShowS

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

show :: Array BN ix e -> String

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

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

show :: Array B ix e -> String

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

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

show :: Array BL ix e -> String

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

(Ragged L ix e, Load DW ix e, Show 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

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

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

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

show :: Array DI ix e -> String

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

Semigroup (Array DL Ix1 e)

Defined in Data.Massiv.Array.Delayed.Push

Methods

(<>) :: Array DL Ix1 e -> Array DL Ix1 e -> Array DL Ix1 e

sconcat :: NonEmpty (Array DL Ix1 e) -> Array DL Ix1 e

stimes :: Integral b => b -> Array DL Ix1 e -> Array DL Ix1 e

Semigroup (Array DS Ix1 e)

Defined in Data.Massiv.Array.Delayed.Stream

Methods

(<>) :: Array DS Ix1 e -> Array DS Ix1 e -> Array DS Ix1 e

sconcat :: NonEmpty (Array DS Ix1 e) -> Array DS Ix1 e

stimes :: Integral b => b -> Array DS Ix1 e -> Array DS Ix1 e

Monoid (Array DL Ix1 e)

Defined in Data.Massiv.Array.Delayed.Push

Methods

mempty :: Array DL Ix1 e

mappend :: Array DL Ix1 e -> Array DL Ix1 e -> Array DL Ix1 e

mconcat :: [Array DL Ix1 e] -> Array DL Ix1 e

Monoid (Array DS Ix1 e)

Defined in Data.Massiv.Array.Delayed.Stream

Methods

mempty :: Array DS Ix1 e

mappend :: Array DS Ix1 e -> Array DS Ix1 e -> Array DS Ix1 e

mconcat :: [Array DS Ix1 e] -> Array DS Ix1 e

NFData ix => NFData (Array U ix e)

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

rnf :: Array U ix e -> ()

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

NFData (Array BN ix e)

O(1) - BN is already in normal form

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

rnf :: Array BN ix e -> ()

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

rnf :: Array B ix e -> ()

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

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

rnf :: Array BL ix e -> ()

data Array DL ix e

Defined in Data.Massiv.Array.Delayed.Push

data Array DL ix e = DLArray {

• dlComp :: !Comp
• dlSize :: !(Sz ix)
• dlLoad :: Loader e

}

data Array L ix e

Defined in Data.Massiv.Core.List

data Array L ix e = LArray {

• lComp :: Comp
• lData :: !(List ix e)

}

data Array D ix e

Defined in Data.Massiv.Array.Delayed.Pull

data Array D ix e = DArray {

• dComp :: !Comp
• dSize :: !(Sz ix)
• dIndex :: ix -> e

}

data Array U ix e

Defined in Data.Massiv.Array.Manifest.Unboxed

data Array U ix e = UArray {

• uComp :: !Comp
• uSize :: !(Sz 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 :: !(Sz ix)
• sData :: !(ForeignPtr e)

}

data Array P ix e

Defined in Data.Massiv.Array.Manifest.Primitive

data Array P ix e = PArray {

• pComp :: !Comp
• pSize :: !(Sz ix)
• pOffset :: !Int
• pData :: !ByteArray

}

newtype Array BN ix e

Defined in Data.Massiv.Array.Manifest.Boxed

newtype Array BN ix e = BNArray (Array BL ix e)

newtype Array B ix e

Defined in Data.Massiv.Array.Manifest.Boxed

newtype Array B ix e = BArray (Array BL ix e)

data Array BL ix e

Defined in Data.Massiv.Array.Manifest.Boxed

data Array BL ix e = BLArray {

• blComp :: !Comp
• blSize :: !(Sz ix)
• blOffset :: !Int
• blData :: !(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)
• 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

}

newtype Array DS Ix1 e

Defined in Data.Massiv.Array.Delayed.Stream

newtype Array DS Ix1 e = DSArray {

• dsArray :: Steps Id 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 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 DS Ix1 e)

Defined in Data.Massiv.Array.Delayed.Stream

type Item (Array DS Ix1 e) = e

type Item (Array BN ix e)

Defined in Data.Massiv.Array.Manifest.Boxed

type Item (Array BN 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 Item (Array BL ix e)

Defined in Data.Massiv.Array.Manifest.Boxed

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

newtype List ix e

Constructors

List

Fields

• unList :: [Elt ix e]

Instances

Coercible (Elt ix e) (ListItem ix e) => IsList (List ix e)

Defined in Data.Massiv.Core.List

Associated Types

type Item (List ix e)

Methods

fromList :: [Item (List ix e)] -> List ix e

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

toList :: List ix e -> [Item (List ix e)]

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

Defined in Data.Massiv.Core.List

Methods

showsPrec :: Int -> List ix e -> ShowS

show :: List ix e -> String

showList :: [List ix e] -> ShowS

type Item (List ix e)

Defined in Data.Massiv.Core.List

type Item (List ix e) = ListItem ix e

type Vector r e = Array r Ix1 e

Type synonym for a single dimension array, or simply a flat vector.

Since: 0.5.0

type MVector s r e = MArray s r Ix1 e

Type synonym for a single dimension mutable array, or simply a flat mutable vector.

Since: 0.5.0

type Matrix r e = Array r Ix2 e

Type synonym for a two-dimentsional array, or simply a matrix.

Since: 0.5.0

type MMatrix s r e = MArray s r Ix2 e

Type synonym for a two-dimentsional mutable array, or simply a mutable matrix.

Since: 0.5.0

class (Strategy r, Shape r ix) => Load r ix e where

Any array that can be computed and loaded into memory

Minimal complete definition

(makeArray | makeArrayLinear), (iterArrayLinearST_ | iterArrayLinearWithSetST_)

Methods

iterArrayLinearST_

Arguments

:: Scheduler s ()

-> Array r ix e

Array that is being loaded

-> (Int -> e -> ST s ())

Function that writes an element into target array

-> ST s ()

Iterate over an array with a ST action that is applied to each element and its index.

Since: 1.0.0

iterArrayLinearWithSetST_

Arguments

:: Scheduler s ()

-> Array r ix e

Array that is being loaded

-> (Ix1 -> e -> ST s ())

Function that writes an element into target array

-> (Ix1 -> Sz1 -> e -> ST s ())

Function that efficiently sets a region of an array to the supplied value target array

-> ST s ()

Similar to iterArrayLinearST_. Except it also accepts a function that is potentially optimized for setting many cells in a region to the same value. There is no guarantees, but some array representations, might utilize this region setting function, in which case for such regions index aware action will not be called.

Since: 1.0.0

Instances

Index ix => Load DL ix e

Defined in Data.Massiv.Array.Delayed.Push

Methods

makeArray :: Comp -> Sz ix -> (ix -> e) -> Array DL ix e

makeArrayLinear :: Comp -> Sz ix -> (Int -> e) -> Array DL ix e

replicate :: Comp -> Sz ix -> e -> Array DL ix e

iterArrayLinearST_ :: Scheduler s () -> Array DL ix e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array DL ix e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array DL ix e -> ST s (MArray s r' ix e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array DL ix e -> IO (MArray RealWorld r' ix e)

(Shape L ix, Ragged L ix e) => Load L ix e

Defined in Data.Massiv.Core.List

Methods

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

makeArrayLinear :: Comp -> Sz ix -> (Int -> e) -> Array L ix e

replicate :: Comp -> Sz ix -> e -> Array L ix e

iterArrayLinearST_ :: Scheduler s () -> Array L ix e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array L ix e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array L ix e -> ST s (MArray s r' ix e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array L ix e -> IO (MArray RealWorld r' ix e)

Index ix => Load D ix e

Defined in Data.Massiv.Array.Delayed.Pull

Methods

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

makeArrayLinear :: Comp -> Sz ix -> (Int -> e) -> Array D ix e

replicate :: Comp -> Sz ix -> e -> Array D ix e

iterArrayLinearST_ :: Scheduler s () -> Array D ix e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array D ix e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array D ix e -> ST s (MArray s r' ix e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array D ix e -> IO (MArray RealWorld r' ix e)

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

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

makeArrayLinear :: Comp -> Sz ix -> (Int -> e) -> Array U ix e

replicate :: Comp -> Sz ix -> e -> Array U ix e

iterArrayLinearST_ :: Scheduler s () -> Array U ix e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array U ix e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array U ix e -> ST s (MArray s r' ix e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array U ix e -> IO (MArray RealWorld r' ix e)

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

Defined in Data.Massiv.Array.Manifest.Storable

Methods

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

makeArrayLinear :: Comp -> Sz ix -> (Int -> e) -> Array S ix e

replicate :: Comp -> Sz ix -> e -> Array S ix e

iterArrayLinearST_ :: Scheduler s () -> Array S ix e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array S ix e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array S ix e -> ST s (MArray s r' ix e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array S ix e -> IO (MArray RealWorld r' ix e)

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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

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

makeArrayLinear :: Comp -> Sz ix -> (Int -> e) -> Array P ix e

replicate :: Comp -> Sz ix -> e -> Array P ix e

iterArrayLinearST_ :: Scheduler s () -> Array P ix e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array P ix e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array P ix e -> ST s (MArray s r' ix e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array P ix e -> IO (MArray RealWorld r' ix e)

Load DS Ix1 e

O(n) - size implementation.

Defined in Data.Massiv.Array.Delayed.Stream

Methods

makeArray :: Comp -> Sz Ix1 -> (Ix1 -> e) -> Array DS Ix1 e

makeArrayLinear :: Comp -> Sz Ix1 -> (Int -> e) -> Array DS Ix1 e

replicate :: Comp -> Sz Ix1 -> e -> Array DS Ix1 e

iterArrayLinearST_ :: Scheduler s () -> Array DS Ix1 e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array DS Ix1 e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array DS Ix1 e -> ST s (MArray s r' Ix1 e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array DS Ix1 e -> IO (MArray RealWorld r' Ix1 e)

(Index ix, NFData e) => Load BN ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

makeArray :: Comp -> Sz ix -> (ix -> e) -> Array BN ix e

makeArrayLinear :: Comp -> Sz ix -> (Int -> e) -> Array BN ix e

replicate :: Comp -> Sz ix -> e -> Array BN ix e

iterArrayLinearST_ :: Scheduler s () -> Array BN ix e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array BN ix e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array BN ix e -> ST s (MArray s r' ix e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array BN ix e -> IO (MArray RealWorld r' ix e)

Index ix => Load B ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

makeArrayLinear :: Comp -> Sz ix -> (Int -> e) -> Array B ix e

replicate :: Comp -> Sz ix -> e -> Array B ix e

iterArrayLinearST_ :: Scheduler s () -> Array B ix e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array B ix e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array B ix e -> ST s (MArray s r' ix e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array B ix e -> IO (MArray RealWorld r' ix e)

Index ix => Load BL ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

makeArray :: Comp -> Sz ix -> (ix -> e) -> Array BL ix e

makeArrayLinear :: Comp -> Sz ix -> (Int -> e) -> Array BL ix e

replicate :: Comp -> Sz ix -> e -> Array BL ix e

iterArrayLinearST_ :: Scheduler s () -> Array BL ix e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array BL ix e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array BL ix e -> ST s (MArray s r' ix e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array BL ix e -> IO (MArray RealWorld r' ix e)

Load DW Ix1 e

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

makeArray :: Comp -> Sz Ix1 -> (Ix1 -> e) -> Array DW Ix1 e

makeArrayLinear :: Comp -> Sz Ix1 -> (Int -> e) -> Array DW Ix1 e

replicate :: Comp -> Sz Ix1 -> e -> Array DW Ix1 e

iterArrayLinearST_ :: Scheduler s () -> Array DW Ix1 e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array DW Ix1 e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array DW Ix1 e -> ST s (MArray s r' Ix1 e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array DW Ix1 e -> IO (MArray RealWorld r' Ix1 e)

Load DW Ix2 e

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

makeArray :: Comp -> Sz Ix2 -> (Ix2 -> e) -> Array DW Ix2 e

makeArrayLinear :: Comp -> Sz Ix2 -> (Int -> e) -> Array DW Ix2 e

replicate :: Comp -> Sz Ix2 -> e -> Array DW Ix2 e

iterArrayLinearST_ :: Scheduler s () -> Array DW Ix2 e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array DW Ix2 e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array DW Ix2 e -> ST s (MArray s r' Ix2 e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array DW Ix2 e -> IO (MArray RealWorld r' Ix2 e)

Index ix => Load DI ix e

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

makeArray :: Comp -> Sz ix -> (ix -> e) -> Array DI ix e

makeArrayLinear :: Comp -> Sz ix -> (Int -> e) -> Array DI ix e

replicate :: Comp -> Sz ix -> e -> Array DI ix e

iterArrayLinearST_ :: Scheduler s () -> Array DI ix e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array DI ix e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array DI ix e -> ST s (MArray s r' ix e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array DI ix e -> IO (MArray RealWorld r' ix e)

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

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

makeArray :: Comp -> Sz (IxN n) -> (IxN n -> e) -> Array DW (IxN n) e

makeArrayLinear :: Comp -> Sz (IxN n) -> (Int -> e) -> Array DW (IxN n) e

replicate :: Comp -> Sz (IxN n) -> e -> Array DW (IxN n) e

iterArrayLinearST_ :: Scheduler s () -> Array DW (IxN n) e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array DW (IxN n) e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array DW (IxN n) e -> ST s (MArray s r' (IxN n) e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array DW (IxN n) e -> IO (MArray RealWorld r' (IxN n) e)

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

Methods

toStream :: Array r ix e -> Steps Id e

toStreamIx :: Array r ix e -> Steps Id (ix, e)

Instances

Stream L Ix1 e

Defined in Data.Massiv.Core.List

Methods

toStream :: Array L Ix1 e -> Steps Id e

toStreamIx :: Array L Ix1 e -> Steps Id (Ix1, e)

Index ix => Stream D ix e

Defined in Data.Massiv.Array.Delayed.Pull

Methods

toStream :: Array D ix e -> Steps Id e

toStreamIx :: Array D ix e -> Steps Id (ix, e)

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

toStream :: Array U ix e -> Steps Id e

toStreamIx :: Array U ix e -> Steps Id (ix, e)

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

Defined in Data.Massiv.Array.Manifest.Storable

Methods

toStream :: Array S ix e -> Steps Id e

toStreamIx :: Array S ix e -> Steps Id (ix, e)

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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

toStream :: Array P ix e -> Steps Id e

toStreamIx :: Array P ix e -> Steps Id (ix, e)

Stream DS Ix1 e

Defined in Data.Massiv.Array.Delayed.Stream

Methods

toStream :: Array DS Ix1 e -> Steps Id e

toStreamIx :: Array DS Ix1 e -> Steps Id (Ix1, e)

(Index ix, NFData e) => Stream BN ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

toStream :: Array BN ix e -> Steps Id e

toStreamIx :: Array BN ix e -> Steps Id (ix, e)

Index ix => Stream B ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

toStream :: Array B ix e -> Steps Id e

toStreamIx :: Array B ix e -> Steps Id (ix, e)

Index ix => Stream BL ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

toStream :: Array BL ix e -> Steps Id e

toStreamIx :: Array BL ix e -> Steps Id (ix, e)

class (Strategy r, Size r) => Source r e

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

Minimal complete definition

(unsafeIndex | unsafeLinearIndex), unsafeLinearSlice

Instances

Source D e

Defined in Data.Massiv.Array.Delayed.Pull

Methods

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

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

unsafeOuterSlice :: (Index ix, Index (Lower ix)) => Array D ix e -> Sz (Lower ix) -> Int -> Array D (Lower ix) e

unsafeLinearSlice :: Index ix => Ix1 -> Sz1 -> Array D ix e -> Array D Ix1 e

Unbox e => Source U e

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

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

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

unsafeOuterSlice :: (Index ix, Index (Lower ix)) => Array U ix e -> Sz (Lower ix) -> Int -> Array U (Lower ix) e

unsafeLinearSlice :: Index ix => Ix1 -> Sz1 -> Array U ix e -> Array U Ix1 e

Storable e => Source S e

Defined in Data.Massiv.Array.Manifest.Storable

Methods

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

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

unsafeOuterSlice :: (Index ix, Index (Lower ix)) => Array S ix e -> Sz (Lower ix) -> Int -> Array S (Lower ix) e

unsafeLinearSlice :: Index ix => Ix1 -> Sz1 -> Array S ix e -> Array S Ix1 e

Prim e => Source P e

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

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

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

unsafeOuterSlice :: (Index ix, Index (Lower ix)) => Array P ix e -> Sz (Lower ix) -> Int -> Array P (Lower ix) e

unsafeLinearSlice :: Index ix => Ix1 -> Sz1 -> Array P ix e -> Array P Ix1 e

NFData e => Source BN e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

unsafeIndex :: Index ix => Array BN ix e -> ix -> e

unsafeLinearIndex :: Index ix => Array BN ix e -> Int -> e

unsafeOuterSlice :: (Index ix, Index (Lower ix)) => Array BN ix e -> Sz (Lower ix) -> Int -> Array BN (Lower ix) e

unsafeLinearSlice :: Index ix => Ix1 -> Sz1 -> Array BN ix e -> Array BN Ix1 e

Source B e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

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

unsafeOuterSlice :: (Index ix, Index (Lower ix)) => Array B ix e -> Sz (Lower ix) -> Int -> Array B (Lower ix) e

unsafeLinearSlice :: Index ix => Ix1 -> Sz1 -> Array B ix e -> Array B Ix1 e

Source BL e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

unsafeIndex :: Index ix => Array BL ix e -> ix -> e

unsafeLinearIndex :: Index ix => Array BL ix e -> Int -> e

unsafeOuterSlice :: (Index ix, Index (Lower ix)) => Array BL ix e -> Sz (Lower ix) -> Int -> Array BL (Lower ix) e

unsafeLinearSlice :: Index ix => Ix1 -> Sz1 -> Array BL ix e -> Array BL Ix1 e

class Size r

Arrays that have information about their size availible in constant time.

Minimal complete definition

size, unsafeResize

Instances

Size DL

Defined in Data.Massiv.Array.Delayed.Push

Methods

size :: Array DL ix e -> Sz ix

unsafeResize :: (Index ix, Index ix') => Sz ix' -> Array DL ix e -> Array DL ix' e

Size D

Defined in Data.Massiv.Array.Delayed.Pull

Methods

size :: Array D ix e -> Sz ix

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

Size U

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

size :: Array U ix e -> Sz ix

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

Size S

Defined in Data.Massiv.Array.Manifest.Storable

Methods

size :: Array S ix e -> Sz ix

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

Size P

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

size :: Array P ix e -> Sz ix

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

Size BN

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

size :: Array BN ix e -> Sz ix

unsafeResize :: (Index ix, Index ix') => Sz ix' -> Array BN ix e -> Array BN ix' e

Size B

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

size :: Array B ix e -> Sz ix

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

Size BL

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

size :: Array BL ix e -> Sz ix

unsafeResize :: (Index ix, Index ix') => Sz ix' -> Array BL ix e -> Array BL ix' e

Size DI

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

size :: Array DI ix e -> Sz ix

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

class Index ix => Shape r ix where

The shape of an array. It is different from Size in that it can be applicable to non-square matrices and might not be available in constant time.

Since: 1.0.0

Minimal complete definition

Nothing

Methods

linearSizeHint :: Array r ix e -> LengthHint

O(1) - Check what do we know about the number of elements without doing any work

Since: 1.0.0

linearSize :: Array r ix e -> Sz1

O(n) - possibly iterate over the whole array before producing the answer

Since: 0.5.8

default linearSize :: Size r => Array r ix e -> Sz1

outerSize :: Array r ix e -> Sz ix

O(n) - Rectangular size of an array that is inferred from looking at the first row in each dimensions. For rectangular arrays this is the same as size

Since: 1.0.0

default outerSize :: Size r => Array r ix e -> Sz ix

maxLinearSize :: Array r ix e -> Maybe Sz1

O(1) - Get the possible maximum linear size of an immutabe array. If the lookup of size in constant time is not possible, Nothing will be returned. This value will be used as the initial size of the mutable array into which the loading will happen.

Since: 1.0.0

isNull :: Array r ix e -> Bool

O(1) - Check whether an array is empty or not.

Examples

>>> import Data.Massiv.Array
>>> isNull $ range Seq (Ix2 10 20) (11 :. 21)
False
>>> isNull $ range Seq (Ix2 10 20) (10 :. 21)
True
>>> isNull (empty :: Array D Ix5 Int)
True
>>> isNull $ sfromList []
True

Since: 1.0.0

Instances

Index ix => Shape DL ix

Defined in Data.Massiv.Array.Delayed.Push

Methods

linearSizeHint :: Array DL ix e -> LengthHint

linearSize :: Array DL ix e -> Sz1

outerSize :: Array DL ix e -> Sz ix

maxLinearSize :: Array DL ix e -> Maybe Sz1

isNull :: Array DL ix e -> Bool

Shape L Ix1

Defined in Data.Massiv.Core.List

Methods

linearSizeHint :: Array L Ix1 e -> LengthHint

linearSize :: Array L Ix1 e -> Sz1

outerSize :: Array L Ix1 e -> Sz Ix1

maxLinearSize :: Array L Ix1 e -> Maybe Sz1

isNull :: Array L Ix1 e -> Bool

Shape L Ix2

Defined in Data.Massiv.Core.List

Methods

linearSizeHint :: Array L Ix2 e -> LengthHint

linearSize :: Array L Ix2 e -> Sz1

outerSize :: Array L Ix2 e -> Sz Ix2

maxLinearSize :: Array L Ix2 e -> Maybe Sz1

isNull :: Array L Ix2 e -> Bool

Index ix => Shape D ix

Defined in Data.Massiv.Array.Delayed.Pull

Methods

linearSizeHint :: Array D ix e -> LengthHint

linearSize :: Array D ix e -> Sz1

outerSize :: Array D ix e -> Sz ix

maxLinearSize :: Array D ix e -> Maybe Sz1

isNull :: Array D ix e -> Bool

Index ix => Shape U ix

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

linearSizeHint :: Array U ix e -> LengthHint

linearSize :: Array U ix e -> Sz1

outerSize :: Array U ix e -> Sz ix

maxLinearSize :: Array U ix e -> Maybe Sz1

isNull :: Array U ix e -> Bool

Index ix => Shape S ix

Defined in Data.Massiv.Array.Manifest.Storable

Methods

linearSizeHint :: Array S ix e -> LengthHint

linearSize :: Array S ix e -> Sz1

outerSize :: Array S ix e -> Sz ix

maxLinearSize :: Array S ix e -> Maybe Sz1

isNull :: Array S ix e -> Bool

Index ix => Shape P ix

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

linearSizeHint :: Array P ix e -> LengthHint

linearSize :: Array P ix e -> Sz1

outerSize :: Array P ix e -> Sz ix

maxLinearSize :: Array P ix e -> Maybe Sz1

isNull :: Array P ix e -> Bool

Shape DS Ix1

Defined in Data.Massiv.Array.Delayed.Stream

Methods

linearSizeHint :: Array DS Ix1 e -> LengthHint

linearSize :: Array DS Ix1 e -> Sz1

outerSize :: Array DS Ix1 e -> Sz Ix1

maxLinearSize :: Array DS Ix1 e -> Maybe Sz1

isNull :: Array DS Ix1 e -> Bool

Index ix => Shape BN ix

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

linearSizeHint :: Array BN ix e -> LengthHint

linearSize :: Array BN ix e -> Sz1

outerSize :: Array BN ix e -> Sz ix

maxLinearSize :: Array BN ix e -> Maybe Sz1

isNull :: Array BN ix e -> Bool

Index ix => Shape B ix

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

linearSizeHint :: Array B ix e -> LengthHint

linearSize :: Array B ix e -> Sz1

outerSize :: Array B ix e -> Sz ix

maxLinearSize :: Array B ix e -> Maybe Sz1

isNull :: Array B ix e -> Bool

Index ix => Shape BL ix

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

linearSizeHint :: Array BL ix e -> LengthHint

linearSize :: Array BL ix e -> Sz1

outerSize :: Array BL ix e -> Sz ix

maxLinearSize :: Array BL ix e -> Maybe Sz1

isNull :: Array BL ix e -> Bool

Index ix => Shape DW ix

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

linearSizeHint :: Array DW ix e -> LengthHint

linearSize :: Array DW ix e -> Sz1

outerSize :: Array DW ix e -> Sz ix

maxLinearSize :: Array DW ix e -> Maybe Sz1

isNull :: Array DW ix e -> Bool

Index ix => Shape DI ix

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

linearSizeHint :: Array DI ix e -> LengthHint

linearSize :: Array DI ix e -> Sz1

outerSize :: Array DI ix e -> Sz ix

maxLinearSize :: Array DI ix e -> Maybe Sz1

isNull :: Array DI ix e -> Bool

(Shape L (Ix (n - 1)), Index (IxN n)) => Shape L (IxN n)

Defined in Data.Massiv.Core.List

Methods

linearSizeHint :: Array L (IxN n) e -> LengthHint

linearSize :: Array L (IxN n) e -> Sz1

outerSize :: Array L (IxN n) e -> Sz (IxN n)

maxLinearSize :: Array L (IxN n) e -> Maybe Sz1

isNull :: Array L (IxN n) e -> Bool

data LengthHint

Size hint

Since: 1.0.0

Constructors

LengthExact Sz1

Exact known size

LengthMax Sz1

Upper bound on the size

LengthUnknown

Unknown size

Instances

Eq LengthHint

Defined in Data.Massiv.Core.Common

Methods

(==) :: LengthHint -> LengthHint -> Bool

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

Show LengthHint

Defined in Data.Massiv.Core.Common

Methods

showsPrec :: Int -> LengthHint -> ShowS

show :: LengthHint -> String

showList :: [LengthHint] -> ShowS

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

Minimal complete definition

Nothing

Methods

iterArrayLinearWithStrideST_

Arguments

:: Scheduler s ()

-> 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 -> e -> ST s ())

Function that writes an element into target array

-> ST s ()

Load an array into memory with stride. Default implementation requires an instance of Source.

default iterArrayLinearWithStrideST_ :: Source r e => Scheduler s () -> Stride ix -> Sz ix -> Array r ix e -> (Int -> e -> ST s ()) -> ST s ()

Instances

Index ix => StrideLoad D ix e

Defined in Data.Massiv.Array.Delayed.Pull

Methods

iterArrayLinearWithStrideST_ :: Scheduler s () -> Stride ix -> Sz ix -> Array D ix e -> (Int -> e -> ST s ()) -> ST s ()

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

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

iterArrayLinearWithStrideST_ :: Scheduler s () -> Stride ix -> Sz ix -> Array U ix e -> (Int -> e -> ST s ()) -> ST s ()

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

Defined in Data.Massiv.Array.Manifest.Storable

Methods

iterArrayLinearWithStrideST_ :: Scheduler s () -> Stride ix -> Sz ix -> Array S ix e -> (Int -> e -> ST s ()) -> ST s ()

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

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

iterArrayLinearWithStrideST_ :: Scheduler s () -> Stride ix -> Sz ix -> Array P ix e -> (Int -> e -> ST s ()) -> ST s ()

(Index ix, NFData e) => StrideLoad BN ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

iterArrayLinearWithStrideST_ :: Scheduler s () -> Stride ix -> Sz ix -> Array BN ix e -> (Int -> e -> ST s ()) -> ST s ()

Index ix => StrideLoad B ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

iterArrayLinearWithStrideST_ :: Scheduler s () -> Stride ix -> Sz ix -> Array B ix e -> (Int -> e -> ST s ()) -> ST s ()

Index ix => StrideLoad BL ix e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

iterArrayLinearWithStrideST_ :: Scheduler s () -> Stride ix -> Sz ix -> Array BL ix e -> (Int -> e -> ST s ()) -> ST s ()

StrideLoad DW Ix1 e

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

iterArrayLinearWithStrideST_ :: Scheduler s () -> Stride Ix1 -> Sz Ix1 -> Array DW Ix1 e -> (Int -> e -> ST s ()) -> ST s ()

StrideLoad DW Ix2 e

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

iterArrayLinearWithStrideST_ :: Scheduler s () -> Stride Ix2 -> Sz Ix2 -> Array DW Ix2 e -> (Int -> e -> ST s ()) -> ST s ()

Index ix => StrideLoad DI ix e

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

iterArrayLinearWithStrideST_ :: Scheduler s () -> Stride ix -> Sz ix -> Array DI ix e -> (Int -> e -> ST s ()) -> ST s ()

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

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

iterArrayLinearWithStrideST_ :: Scheduler s () -> Stride (IxN n) -> Sz (IxN n) -> Array DW (IxN n) e -> (Int -> e -> ST s ()) -> ST s ()

class Source r e => Manifest r e

Manifest arrays are backed by actual memory and values are looked up versus computed as it is with delayed arrays. Because manifest arrays are located in memory their contents can be mutated once thawed into MArray. The process of changed a mutable MArray back into an immutable Array is called freezing.

Minimal complete definition

unsafeLinearIndexM, sizeOfMArray, unsafeResizeMArray, unsafeLinearSliceMArray, unsafeThaw, unsafeFreeze, unsafeNew, unsafeLinearRead, unsafeLinearWrite, initialize

Instances

Unbox e => Manifest U e

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

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

sizeOfMArray :: Index ix => MArray s U ix e -> Sz ix

unsafeResizeMArray :: (Index ix', Index ix) => Sz ix' -> MArray s U ix e -> MArray s U ix' e

unsafeLinearSliceMArray :: Index ix => Ix1 -> Sz1 -> MArray s U ix e -> MVector s U e

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

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

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

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

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

initialize :: (Index ix, PrimMonad m) => MArray (PrimState m) U ix e -> m ()

initializeNew :: (Index ix, PrimMonad m) => Maybe e -> Sz ix -> m (MArray (PrimState m) U ix e)

newMArray :: (Index ix, PrimMonad m) => Sz ix -> e -> m (MArray (PrimState m) U ix e)

unsafeLinearSet :: (Index ix, PrimMonad m) => MArray (PrimState m) U ix e -> Ix1 -> Sz1 -> e -> m ()

unsafeLinearCopy :: (Index ix', Index ix, PrimMonad m) => MArray (PrimState m) U ix' e -> Ix1 -> MArray (PrimState m) U ix e -> Ix1 -> Sz1 -> m ()

unsafeArrayLinearCopy :: (Index ix', Index ix, PrimMonad m) => Array U ix' e -> Ix1 -> MArray (PrimState m) U ix e -> Ix1 -> Sz1 -> m ()

unsafeLinearShrink :: (Index ix, PrimMonad m) => MArray (PrimState m) U ix e -> Sz ix -> m (MArray (PrimState m) U ix e)

unsafeLinearGrow :: (Index ix, PrimMonad m) => MArray (PrimState m) U ix e -> Sz ix -> m (MArray (PrimState m) U ix e)

Storable e => Manifest S e

Defined in Data.Massiv.Array.Manifest.Storable

Methods

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

sizeOfMArray :: Index ix => MArray s S ix e -> Sz ix

unsafeResizeMArray :: (Index ix', Index ix) => Sz ix' -> MArray s S ix e -> MArray s S ix' e

unsafeLinearSliceMArray :: Index ix => Ix1 -> Sz1 -> MArray s S ix e -> MVector s S e

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

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

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

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

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

initialize :: (Index ix, PrimMonad m) => MArray (PrimState m) S ix e -> m ()

initializeNew :: (Index ix, PrimMonad m) => Maybe e -> Sz ix -> m (MArray (PrimState m) S ix e)

newMArray :: (Index ix, PrimMonad m) => Sz ix -> e -> m (MArray (PrimState m) S ix e)

unsafeLinearSet :: (Index ix, PrimMonad m) => MArray (PrimState m) S ix e -> Ix1 -> Sz1 -> e -> m ()

unsafeLinearCopy :: (Index ix', Index ix, PrimMonad m) => MArray (PrimState m) S ix' e -> Ix1 -> MArray (PrimState m) S ix e -> Ix1 -> Sz1 -> m ()

unsafeArrayLinearCopy :: (Index ix', Index ix, PrimMonad m) => Array S ix' e -> Ix1 -> MArray (PrimState m) S ix e -> Ix1 -> Sz1 -> m ()

unsafeLinearShrink :: (Index ix, PrimMonad m) => MArray (PrimState m) S ix e -> Sz ix -> m (MArray (PrimState m) S ix e)

unsafeLinearGrow :: (Index ix, PrimMonad m) => MArray (PrimState m) S ix e -> Sz ix -> m (MArray (PrimState m) S ix e)

Prim e => Manifest P e

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

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

sizeOfMArray :: Index ix => MArray s P ix e -> Sz ix

unsafeResizeMArray :: (Index ix', Index ix) => Sz ix' -> MArray s P ix e -> MArray s P ix' e

unsafeLinearSliceMArray :: Index ix => Ix1 -> Sz1 -> MArray s P ix e -> MVector s P e

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

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

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

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

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

initialize :: (Index ix, PrimMonad m) => MArray (PrimState m) P ix e -> m ()

initializeNew :: (Index ix, PrimMonad m) => Maybe e -> Sz ix -> m (MArray (PrimState m) P ix e)

newMArray :: (Index ix, PrimMonad m) => Sz ix -> e -> m (MArray (PrimState m) P ix e)

unsafeLinearSet :: (Index ix, PrimMonad m) => MArray (PrimState m) P ix e -> Ix1 -> Sz1 -> e -> m ()

unsafeLinearCopy :: (Index ix', Index ix, PrimMonad m) => MArray (PrimState m) P ix' e -> Ix1 -> MArray (PrimState m) P ix e -> Ix1 -> Sz1 -> m ()

unsafeArrayLinearCopy :: (Index ix', Index ix, PrimMonad m) => Array P ix' e -> Ix1 -> MArray (PrimState m) P ix e -> Ix1 -> Sz1 -> m ()

unsafeLinearShrink :: (Index ix, PrimMonad m) => MArray (PrimState m) P ix e -> Sz ix -> m (MArray (PrimState m) P ix e)

unsafeLinearGrow :: (Index ix, PrimMonad m) => MArray (PrimState m) P ix e -> Sz ix -> m (MArray (PrimState m) P ix e)

NFData e => Manifest BN e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

unsafeLinearIndexM :: Index ix => Array BN ix e -> Int -> e

sizeOfMArray :: Index ix => MArray s BN ix e -> Sz ix

unsafeResizeMArray :: (Index ix', Index ix) => Sz ix' -> MArray s BN ix e -> MArray s BN ix' e

unsafeLinearSliceMArray :: Index ix => Ix1 -> Sz1 -> MArray s BN ix e -> MVector s BN e

unsafeThaw :: (Index ix, PrimMonad m) => Array BN ix e -> m (MArray (PrimState m) BN ix e)

unsafeFreeze :: (Index ix, PrimMonad m) => Comp -> MArray (PrimState m) BN ix e -> m (Array BN ix e)

unsafeNew :: (Index ix, PrimMonad m) => Sz ix -> m (MArray (PrimState m) BN ix e)

unsafeLinearRead :: (Index ix, PrimMonad m) => MArray (PrimState m) BN ix e -> Int -> m e

unsafeLinearWrite :: (Index ix, PrimMonad m) => MArray (PrimState m) BN ix e -> Int -> e -> m ()

initialize :: (Index ix, PrimMonad m) => MArray (PrimState m) BN ix e -> m ()

initializeNew :: (Index ix, PrimMonad m) => Maybe e -> Sz ix -> m (MArray (PrimState m) BN ix e)

newMArray :: (Index ix, PrimMonad m) => Sz ix -> e -> m (MArray (PrimState m) BN ix e)

unsafeLinearSet :: (Index ix, PrimMonad m) => MArray (PrimState m) BN ix e -> Ix1 -> Sz1 -> e -> m ()

unsafeLinearCopy :: (Index ix', Index ix, PrimMonad m) => MArray (PrimState m) BN ix' e -> Ix1 -> MArray (PrimState m) BN ix e -> Ix1 -> Sz1 -> m ()

unsafeArrayLinearCopy :: (Index ix', Index ix, PrimMonad m) => Array BN ix' e -> Ix1 -> MArray (PrimState m) BN ix e -> Ix1 -> Sz1 -> m ()

unsafeLinearShrink :: (Index ix, PrimMonad m) => MArray (PrimState m) BN ix e -> Sz ix -> m (MArray (PrimState m) BN ix e)

unsafeLinearGrow :: (Index ix, PrimMonad m) => MArray (PrimState m) BN ix e -> Sz ix -> m (MArray (PrimState m) BN ix e)

Manifest B e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

sizeOfMArray :: Index ix => MArray s B ix e -> Sz ix

unsafeResizeMArray :: (Index ix', Index ix) => Sz ix' -> MArray s B ix e -> MArray s B ix' e

unsafeLinearSliceMArray :: Index ix => Ix1 -> Sz1 -> MArray s B ix e -> MVector s B e

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

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

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

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

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

initialize :: (Index ix, PrimMonad m) => MArray (PrimState m) B ix e -> m ()

initializeNew :: (Index ix, PrimMonad m) => Maybe e -> Sz ix -> m (MArray (PrimState m) B ix e)

newMArray :: (Index ix, PrimMonad m) => Sz ix -> e -> m (MArray (PrimState m) B ix e)

unsafeLinearSet :: (Index ix, PrimMonad m) => MArray (PrimState m) B ix e -> Ix1 -> Sz1 -> e -> m ()

unsafeLinearCopy :: (Index ix', Index ix, PrimMonad m) => MArray (PrimState m) B ix' e -> Ix1 -> MArray (PrimState m) B ix e -> Ix1 -> Sz1 -> m ()

unsafeArrayLinearCopy :: (Index ix', Index ix, PrimMonad m) => Array B ix' e -> Ix1 -> MArray (PrimState m) B ix e -> Ix1 -> Sz1 -> m ()

unsafeLinearShrink :: (Index ix, PrimMonad m) => MArray (PrimState m) B ix e -> Sz ix -> m (MArray (PrimState m) B ix e)

unsafeLinearGrow :: (Index ix, PrimMonad m) => MArray (PrimState m) B ix e -> Sz ix -> m (MArray (PrimState m) B ix e)

Manifest BL e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

unsafeLinearIndexM :: Index ix => Array BL ix e -> Int -> e

sizeOfMArray :: Index ix => MArray s BL ix e -> Sz ix

unsafeResizeMArray :: (Index ix', Index ix) => Sz ix' -> MArray s BL ix e -> MArray s BL ix' e

unsafeLinearSliceMArray :: Index ix => Ix1 -> Sz1 -> MArray s BL ix e -> MVector s BL e

unsafeThaw :: (Index ix, PrimMonad m) => Array BL ix e -> m (MArray (PrimState m) BL ix e)

unsafeFreeze :: (Index ix, PrimMonad m) => Comp -> MArray (PrimState m) BL ix e -> m (Array BL ix e)

unsafeNew :: (Index ix, PrimMonad m) => Sz ix -> m (MArray (PrimState m) BL ix e)

unsafeLinearRead :: (Index ix, PrimMonad m) => MArray (PrimState m) BL ix e -> Int -> m e

unsafeLinearWrite :: (Index ix, PrimMonad m) => MArray (PrimState m) BL ix e -> Int -> e -> m ()

initialize :: (Index ix, PrimMonad m) => MArray (PrimState m) BL ix e -> m ()

initializeNew :: (Index ix, PrimMonad m) => Maybe e -> Sz ix -> m (MArray (PrimState m) BL ix e)

newMArray :: (Index ix, PrimMonad m) => Sz ix -> e -> m (MArray (PrimState m) BL ix e)

unsafeLinearSet :: (Index ix, PrimMonad m) => MArray (PrimState m) BL ix e -> Ix1 -> Sz1 -> e -> m ()

unsafeLinearCopy :: (Index ix', Index ix, PrimMonad m) => MArray (PrimState m) BL ix' e -> Ix1 -> MArray (PrimState m) BL ix e -> Ix1 -> Sz1 -> m ()

unsafeArrayLinearCopy :: (Index ix', Index ix, PrimMonad m) => Array BL ix' e -> Ix1 -> MArray (PrimState m) BL ix e -> Ix1 -> Sz1 -> m ()

unsafeLinearShrink :: (Index ix, PrimMonad m) => MArray (PrimState m) BL ix e -> Sz ix -> m (MArray (PrimState m) BL ix e)

unsafeLinearGrow :: (Index ix, PrimMonad m) => MArray (PrimState m) BL ix e -> Sz ix -> m (MArray (PrimState m) BL ix e)

type Mutable r e = Manifest r e

Starting with massiv-1.0 Mutable and Manifest are synonymous. However, this type class synonym will be deprecated in the next major version.

class (IsList (Array r ix e), Load r ix e) => Ragged r ix e

Minimal complete definition

generateRaggedM, flattenRagged, loadRaggedST, raggedFormat

Instances

Ragged L Ix1 e

Defined in Data.Massiv.Core.List

Methods

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

flattenRagged :: Array L Ix1 e -> Vector L e

loadRaggedST :: Scheduler s () -> Array L Ix1 e -> (Ix1 -> e -> ST s ()) -> Ix1 -> Ix1 -> Sz Ix1 -> ST s ()

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

Ragged L Ix2 e

Defined in Data.Massiv.Core.List

Methods

generateRaggedM :: Monad m => Comp -> Sz Ix2 -> (Ix2 -> m e) -> m (Array L Ix2 e)

flattenRagged :: Array L Ix2 e -> Vector L e

loadRaggedST :: Scheduler s () -> Array L Ix2 e -> (Ix1 -> e -> ST s ()) -> Ix1 -> Ix1 -> Sz Ix2 -> ST s ()

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

(Shape L (IxN n), Ragged L (Ix (n - 1)) e, Coercible (Elt (Ix (n - 1)) e) (ListItem (Ix (n - 1)) e)) => Ragged L (IxN n) e

Defined in Data.Massiv.Core.List

Methods

generateRaggedM :: Monad m => Comp -> Sz (IxN n) -> (IxN n -> m e) -> m (Array L (IxN n) e)

flattenRagged :: Array L (IxN n) e -> Vector L e

loadRaggedST :: Scheduler s () -> Array L (IxN n) e -> (Ix1 -> e -> ST s ()) -> Ix1 -> Ix1 -> Sz (IxN n) -> ST s ()

raggedFormat :: (e -> String) -> String -> Array L (IxN n) e -> String

data L

Constructors

L

Instances

Strategy L

Defined in Data.Massiv.Core.List

Methods

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

getComp :: Array L ix e -> Comp

Shape L Ix1

Defined in Data.Massiv.Core.List

Methods

linearSizeHint :: Array L Ix1 e -> LengthHint

linearSize :: Array L Ix1 e -> Sz1

outerSize :: Array L Ix1 e -> Sz Ix1

maxLinearSize :: Array L Ix1 e -> Maybe Sz1

isNull :: Array L Ix1 e -> Bool

Shape L Ix2

Defined in Data.Massiv.Core.List

Methods

linearSizeHint :: Array L Ix2 e -> LengthHint

linearSize :: Array L Ix2 e -> Sz1

outerSize :: Array L Ix2 e -> Sz Ix2

maxLinearSize :: Array L Ix2 e -> Maybe Sz1

isNull :: Array L Ix2 e -> Bool

Ragged L Ix1 e

Defined in Data.Massiv.Core.List

Methods

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

flattenRagged :: Array L Ix1 e -> Vector L e

loadRaggedST :: Scheduler s () -> Array L Ix1 e -> (Ix1 -> e -> ST s ()) -> Ix1 -> Ix1 -> Sz Ix1 -> ST s ()

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

Ragged L Ix2 e

Defined in Data.Massiv.Core.List

Methods

generateRaggedM :: Monad m => Comp -> Sz Ix2 -> (Ix2 -> m e) -> m (Array L Ix2 e)

flattenRagged :: Array L Ix2 e -> Vector L e

loadRaggedST :: Scheduler s () -> Array L Ix2 e -> (Ix1 -> e -> ST s ()) -> Ix1 -> Ix1 -> Sz Ix2 -> ST s ()

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

(Shape L ix, Ragged L ix e) => Load L ix e

Defined in Data.Massiv.Core.List

Methods

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

makeArrayLinear :: Comp -> Sz ix -> (Int -> e) -> Array L ix e

replicate :: Comp -> Sz ix -> e -> Array L ix e

iterArrayLinearST_ :: Scheduler s () -> Array L ix e -> (Int -> e -> ST s ()) -> ST s ()

iterArrayLinearWithSetST_ :: Scheduler s () -> Array L ix e -> (Ix1 -> e -> ST s ()) -> (Ix1 -> Sz1 -> e -> ST s ()) -> ST s ()

unsafeLoadIntoST :: Manifest r' e => MVector s r' e -> Array L ix e -> ST s (MArray s r' ix e)

unsafeLoadIntoIO :: Manifest r' e => MVector RealWorld r' e -> Array L ix e -> IO (MArray RealWorld r' ix e)

Stream L Ix1 e

Defined in Data.Massiv.Core.List

Methods

toStream :: Array L Ix1 e -> Steps Id e

toStreamIx :: Array L Ix1 e -> Steps Id (Ix1, e)

(Shape L (Ix (n - 1)), Index (IxN n)) => Shape L (IxN n)

Defined in Data.Massiv.Core.List

Methods

linearSizeHint :: Array L (IxN n) e -> LengthHint

linearSize :: Array L (IxN n) e -> Sz1

outerSize :: Array L (IxN n) e -> Sz (IxN n)

maxLinearSize :: Array L (IxN n) e -> Maybe Sz1

isNull :: Array L (IxN n) e -> Bool

(Shape L (IxN n), Ragged L (Ix (n - 1)) e, Coercible (Elt (Ix (n - 1)) e) (ListItem (Ix (n - 1)) e)) => Ragged L (IxN n) e

Defined in Data.Massiv.Core.List

Methods

generateRaggedM :: Monad m => Comp -> Sz (IxN n) -> (IxN n -> m e) -> m (Array L (IxN n) e)

flattenRagged :: Array L (IxN n) e -> Vector L e

loadRaggedST :: Scheduler s () -> Array L (IxN n) e -> (Ix1 -> e -> ST s ()) -> Ix1 -> Ix1 -> Sz (IxN n) -> ST s ()

raggedFormat :: (e -> String) -> String -> Array L (IxN n) e -> String

Coercible (Elt ix e) (ListItem ix e) => IsList (Array L ix e)

Defined in Data.Massiv.Core.List

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)

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 :: !(List ix e)

}

type Item (Array L ix e)

Defined in Data.Massiv.Core.List

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

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

Equations

ListItem Ix1 e = e

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

data Scheduler s a

Main type for scheduling work. See withScheduler or withScheduler_ for ways to construct and use this data type.

Since: scheduler-1.0.0

data SchedulerWS ws a

This is a wrapper around Scheduler, but it also keeps a separate state for each individual worker. See withSchedulerWS or withSchedulerWS_ for ways to construct and use this data type.

Since: scheduler-1.4.0

class Typeable r => Strategy r

Minimal complete definition

setComp, getComp

Instances

Strategy DL

Defined in Data.Massiv.Array.Delayed.Push

Methods

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

getComp :: Array DL ix e -> Comp

Strategy L

Defined in Data.Massiv.Core.List

Methods

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

getComp :: Array L ix e -> Comp

Strategy D

Defined in Data.Massiv.Array.Delayed.Pull

Methods

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

getComp :: Array D ix e -> Comp

Strategy U

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

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

getComp :: Array U ix e -> Comp

Strategy S

Defined in Data.Massiv.Array.Manifest.Storable

Methods

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

getComp :: Array S ix e -> Comp

Strategy P

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

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

getComp :: Array P ix e -> Comp

Strategy DS

Defined in Data.Massiv.Array.Delayed.Stream

Methods

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

getComp :: Array DS ix e -> Comp

Strategy N

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

getComp :: Array N ix e -> Comp

Strategy B

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

getComp :: Array B ix e -> Comp

Strategy BL

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

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

getComp :: Array BL ix e -> Comp

Strategy DW

Defined in Data.Massiv.Array.Delayed.Windowed

Methods

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

getComp :: Array DW ix e -> Comp

Strategy DI

Defined in Data.Massiv.Array.Delayed.Interleaved

Methods

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

getComp :: Array DI ix e -> Comp

data Comp

Computation strategy to use when scheduling work.

Constructors

Seq

Sequential computation

ParOn ![Int]

Schedule workers to run on specific capabilities. Specifying an empty list ParOn [] or using Par will result in utilization of all available capabilities.

ParN !Word16

Specify the number of workers that will be handling all the jobs. Difference from ParOn is that workers can jump between cores. Using ParN 0 will result in using all available capabilities.

Bundled Patterns

pattern Par :: Comp

Parallel computation using all available cores. Same as ParOn []

Since: scheduler-1.0.0

pattern Par' :: Comp

Parallel computation using all available cores. Same as ParN 0

Since: scheduler-1.1.0

Instances

Eq Comp

Defined in Control.Scheduler.Computation

Methods

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

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

Show Comp

Defined in Control.Scheduler.Computation

Methods

showsPrec :: Int -> Comp -> ShowS

show :: Comp -> String

showList :: [Comp] -> ShowS

Semigroup Comp

Defined in Control.Scheduler.Computation

Methods

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

sconcat :: NonEmpty Comp -> Comp

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

Monoid Comp

Defined in Control.Scheduler.Computation

Methods

mempty :: Comp

mappend :: Comp -> Comp -> Comp

mconcat :: [Comp] -> Comp

NFData Comp

Defined in Control.Scheduler.Computation

Methods

rnf :: Comp -> ()

getComp :: Strategy r => Array r ix e -> Comp

Get computation strategy of this array

Since: 0.1.0

setComp :: Strategy r => Comp -> Array r ix e -> Array r ix e

Set computation strategy for this array

Example

>>> :set -XTypeApplications
>>> import Data.Massiv.Array
>>> a = singleton @DL @Ix1 @Int 0
>>> a
Array DL Seq (Sz1 1)
  [ 0 ]
>>> setComp (ParN 6) a -- use 6 capabilities
Array DL (ParN 6) (Sz1 1)
  [ 0 ]

appComp :: Strategy r => Comp -> Array r ix e -> Array r ix e

Append computation strategy using Comp's Monoid instance.

Since: 0.6.0

data WorkerStates ws

Each worker is capable of keeping it's own state, that can be share for different schedulers, but not at the same time. In other words using the same WorkerStates on withSchedulerS concurrently will result in an error. Can be initialized with initWorkerStates

Since: scheduler-1.4.0

initWorkerStates :: MonadIO m => Comp -> (WorkerId -> m ws) -> m (WorkerStates ws)

Initialize a separate state for each worker.

Since: scheduler-1.4.0

scheduleWork :: MonadPrimBase s m => Scheduler s a -> m a -> m ()

Schedule an action to be picked up and computed by a worker from a pool of jobs. Similar to scheduleWorkId, except the job doesn't get the worker id.

Since: scheduler-1.0.0

scheduleWork_ :: MonadPrimBase s m => Scheduler s () -> m () -> m ()

Same as scheduleWork, but only for a Scheduler that doesn't keep the results.

Since: scheduler-1.1.0

withMassivScheduler_ :: Comp -> (Scheduler RealWorld () -> IO ()) -> IO ()

Selects an optimal scheduler for the supplied strategy, but it works only in IO

Since: 1.0.0

module Data.Massiv.Core.Index

Numeric

class (Size r, Num e) => FoldNumeric r e

Minimal complete definition

foldArray, powerSumArray, unsafeDotProduct

Instances

Num e => FoldNumeric D e

Defined in Data.Massiv.Array.Delayed.Pull

Methods

sumArray :: Index ix => Array D ix e -> e

productArray :: Index ix => Array D ix e -> e

powerSumArray :: Index ix => Array D ix e -> Int -> e

unsafeDotProduct :: Index ix => Array D ix e -> Array D ix e -> e

foldArray :: Index ix => (e -> e -> e) -> e -> Array D ix e -> e

(Unbox e, Num e) => FoldNumeric U e

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

sumArray :: Index ix => Array U ix e -> e

productArray :: Index ix => Array U ix e -> e

powerSumArray :: Index ix => Array U ix e -> Int -> e

unsafeDotProduct :: Index ix => Array U ix e -> Array U ix e -> e

foldArray :: Index ix => (e -> e -> e) -> e -> Array U ix e -> e

(Storable e, Num e) => FoldNumeric S e

Defined in Data.Massiv.Array.Manifest.Storable

Methods

sumArray :: Index ix => Array S ix e -> e

productArray :: Index ix => Array S ix e -> e

powerSumArray :: Index ix => Array S ix e -> Int -> e

unsafeDotProduct :: Index ix => Array S ix e -> Array S ix e -> e

foldArray :: Index ix => (e -> e -> e) -> e -> Array S ix e -> e

(Prim e, Num e) => FoldNumeric P e

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

sumArray :: Index ix => Array P ix e -> e

productArray :: Index ix => Array P ix e -> e

powerSumArray :: Index ix => Array P ix e -> Int -> e

unsafeDotProduct :: Index ix => Array P ix e -> Array P ix e -> e

foldArray :: Index ix => (e -> e -> e) -> e -> Array P ix e -> e

(NFData e, Num e) => FoldNumeric BN e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

sumArray :: Index ix => Array BN ix e -> e

productArray :: Index ix => Array BN ix e -> e

powerSumArray :: Index ix => Array BN ix e -> Int -> e

unsafeDotProduct :: Index ix => Array BN ix e -> Array BN ix e -> e

foldArray :: Index ix => (e -> e -> e) -> e -> Array BN ix e -> e

Num e => FoldNumeric B e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

sumArray :: Index ix => Array B ix e -> e

productArray :: Index ix => Array B ix e -> e

powerSumArray :: Index ix => Array B ix e -> Int -> e

unsafeDotProduct :: Index ix => Array B ix e -> Array B ix e -> e

foldArray :: Index ix => (e -> e -> e) -> e -> Array B ix e -> e

Num e => FoldNumeric BL e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

sumArray :: Index ix => Array BL ix e -> e

productArray :: Index ix => Array BL ix e -> e

powerSumArray :: Index ix => Array BL ix e -> Int -> e

unsafeDotProduct :: Index ix => Array BL ix e -> Array BL ix e -> e

foldArray :: Index ix => (e -> e -> e) -> e -> Array BL ix e -> e

class FoldNumeric r e => Numeric r e

Minimal complete definition

unsafeLiftArray, unsafeLiftArray2

Instances

Num e => Numeric D e

Defined in Data.Massiv.Array.Delayed.Pull

Methods

plusScalar :: Index ix => Array D ix e -> e -> Array D ix e

minusScalar :: Index ix => Array D ix e -> e -> Array D ix e

scalarMinus :: Index ix => e -> Array D ix e -> Array D ix e

multiplyScalar :: Index ix => Array D ix e -> e -> Array D ix e

absPointwise :: Index ix => Array D ix e -> Array D ix e

additionPointwise :: Index ix => Array D ix e -> Array D ix e -> Array D ix e

subtractionPointwise :: Index ix => Array D ix e -> Array D ix e -> Array D ix e

multiplicationPointwise :: Index ix => Array D ix e -> Array D ix e -> Array D ix e

powerPointwise :: Index ix => Array D ix e -> Int -> Array D ix e

unsafeLiftArray :: Index ix => (e -> e) -> Array D ix e -> Array D ix e

unsafeLiftArray2 :: Index ix => (e -> e -> e) -> Array D ix e -> Array D ix e -> Array D ix e

(Unbox e, Num e) => Numeric U e

Defined in Data.Massiv.Array.Manifest.Unboxed

Methods

plusScalar :: Index ix => Array U ix e -> e -> Array U ix e

minusScalar :: Index ix => Array U ix e -> e -> Array U ix e

scalarMinus :: Index ix => e -> Array U ix e -> Array U ix e

multiplyScalar :: Index ix => Array U ix e -> e -> Array U ix e

absPointwise :: Index ix => Array U ix e -> Array U ix e

additionPointwise :: Index ix => Array U ix e -> Array U ix e -> Array U ix e

subtractionPointwise :: Index ix => Array U ix e -> Array U ix e -> Array U ix e

multiplicationPointwise :: Index ix => Array U ix e -> Array U ix e -> Array U ix e

powerPointwise :: Index ix => Array U ix e -> Int -> Array U ix e

unsafeLiftArray :: Index ix => (e -> e) -> Array U ix e -> Array U ix e

unsafeLiftArray2 :: Index ix => (e -> e -> e) -> Array U ix e -> Array U ix e -> Array U ix e

(Storable e, Num e) => Numeric S e

Defined in Data.Massiv.Array.Manifest.Storable

Methods

plusScalar :: Index ix => Array S ix e -> e -> Array S ix e

minusScalar :: Index ix => Array S ix e -> e -> Array S ix e

scalarMinus :: Index ix => e -> Array S ix e -> Array S ix e

multiplyScalar :: Index ix => Array S ix e -> e -> Array S ix e

absPointwise :: Index ix => Array S ix e -> Array S ix e

additionPointwise :: Index ix => Array S ix e -> Array S ix e -> Array S ix e

subtractionPointwise :: Index ix => Array S ix e -> Array S ix e -> Array S ix e

multiplicationPointwise :: Index ix => Array S ix e -> Array S ix e -> Array S ix e

powerPointwise :: Index ix => Array S ix e -> Int -> Array S ix e

unsafeLiftArray :: Index ix => (e -> e) -> Array S ix e -> Array S ix e

unsafeLiftArray2 :: Index ix => (e -> e -> e) -> Array S ix e -> Array S ix e -> Array S ix e

(Prim e, Num e) => Numeric P e

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

plusScalar :: Index ix => Array P ix e -> e -> Array P ix e

minusScalar :: Index ix => Array P ix e -> e -> Array P ix e

scalarMinus :: Index ix => e -> Array P ix e -> Array P ix e

multiplyScalar :: Index ix => Array P ix e -> e -> Array P ix e

absPointwise :: Index ix => Array P ix e -> Array P ix e

additionPointwise :: Index ix => Array P ix e -> Array P ix e -> Array P ix e

subtractionPointwise :: Index ix => Array P ix e -> Array P ix e -> Array P ix e

multiplicationPointwise :: Index ix => Array P ix e -> Array P ix e -> Array P ix e

powerPointwise :: Index ix => Array P ix e -> Int -> Array P ix e

unsafeLiftArray :: Index ix => (e -> e) -> Array P ix e -> Array P ix e

unsafeLiftArray2 :: Index ix => (e -> e -> e) -> Array P ix e -> Array P ix e -> Array P ix e

(NFData e, Num e) => Numeric BN e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

plusScalar :: Index ix => Array BN ix e -> e -> Array BN ix e

minusScalar :: Index ix => Array BN ix e -> e -> Array BN ix e

scalarMinus :: Index ix => e -> Array BN ix e -> Array BN ix e

multiplyScalar :: Index ix => Array BN ix e -> e -> Array BN ix e

absPointwise :: Index ix => Array BN ix e -> Array BN ix e

additionPointwise :: Index ix => Array BN ix e -> Array BN ix e -> Array BN ix e

subtractionPointwise :: Index ix => Array BN ix e -> Array BN ix e -> Array BN ix e

multiplicationPointwise :: Index ix => Array BN ix e -> Array BN ix e -> Array BN ix e

powerPointwise :: Index ix => Array BN ix e -> Int -> Array BN ix e

unsafeLiftArray :: Index ix => (e -> e) -> Array BN ix e -> Array BN ix e

unsafeLiftArray2 :: Index ix => (e -> e -> e) -> Array BN ix e -> Array BN ix e -> Array BN ix e

Num e => Numeric B e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

plusScalar :: Index ix => Array B ix e -> e -> Array B ix e

minusScalar :: Index ix => Array B ix e -> e -> Array B ix e

scalarMinus :: Index ix => e -> Array B ix e -> Array B ix e

multiplyScalar :: Index ix => Array B ix e -> e -> Array B ix e

absPointwise :: Index ix => Array B ix e -> Array B ix e

additionPointwise :: Index ix => Array B ix e -> Array B ix e -> Array B ix e

subtractionPointwise :: Index ix => Array B ix e -> Array B ix e -> Array B ix e

multiplicationPointwise :: Index ix => Array B ix e -> Array B ix e -> Array B ix e

powerPointwise :: Index ix => Array B ix e -> Int -> Array B ix e

unsafeLiftArray :: Index ix => (e -> e) -> Array B ix e -> Array B ix e

unsafeLiftArray2 :: Index ix => (e -> e -> e) -> Array B ix e -> Array B ix e -> Array B ix e

Num e => Numeric BL e

Defined in Data.Massiv.Array.Manifest.Boxed

Methods

plusScalar :: Index ix => Array BL ix e -> e -> Array BL ix e

minusScalar :: Index ix => Array BL ix e -> e -> Array BL ix e

scalarMinus :: Index ix => e -> Array BL ix e -> Array BL ix e

multiplyScalar :: Index ix => Array BL ix e -> e -> Array BL ix e

absPointwise :: Index ix => Array BL ix e -> Array BL ix e

additionPointwise :: Index ix => Array BL ix e -> Array BL ix e -> Array BL ix e

subtractionPointwise :: Index ix => Array BL ix e -> Array BL ix e -> Array BL ix e

multiplicationPointwise :: Index ix => Array BL ix e -> Array BL ix e -> Array BL ix e

powerPointwise :: Index ix => Array BL ix e -> Int -> Array BL ix e

unsafeLiftArray :: Index ix => (e -> e) -> Array BL ix e -> Array BL ix e

unsafeLiftArray2 :: Index ix => (e -> e -> e) -> Array BL ix e -> Array BL ix e -> Array BL ix e

class (Numeric r e, Floating e) => NumericFloat r e

Instances

Floating e => NumericFloat D e

Defined in Data.Massiv.Array.Delayed.Pull

Methods

divideScalar :: Index ix => Array D ix e -> e -> Array D ix e

scalarDivide :: Index ix => e -> Array D ix e -> Array D ix e

divisionPointwise :: Index ix => Array D ix e -> Array D ix e -> Array D ix e

recipPointwise :: Index ix => Array D ix e -> Array D ix e

sqrtPointwise :: Index ix => Array D ix e -> Array D ix e

(Storable e, Floating e) => NumericFloat S e

Defined in Data.Massiv.Array.Manifest.Storable

Methods

divideScalar :: Index ix => Array S ix e -> e -> Array S ix e

scalarDivide :: Index ix => e -> Array S ix e -> Array S ix e

divisionPointwise :: Index ix => Array S ix e -> Array S ix e -> Array S ix e

recipPointwise :: Index ix => Array S ix e -> Array S ix e

sqrtPointwise :: Index ix => Array S ix e -> Array S ix e

(Prim e, Floating e) => NumericFloat P e

Defined in Data.Massiv.Array.Manifest.Primitive

Methods

divideScalar :: Index ix => Array P ix e -> e -> Array P ix e

scalarDivide :: Index ix => e -> Array P ix e -> Array P ix e

divisionPointwise :: Index ix => Array P ix e -> Array P ix e -> Array P ix e

recipPointwise :: Index ix => Array P ix e -> Array P ix e

sqrtPointwise :: Index ix => Array P ix e -> Array P ix e

Exceptions

class Monad m => MonadThrow (m :: Type -> Type) where

A class for monads in which exceptions may be thrown.

Instances should obey the following law:

throwM e >> x = throwM e

In other words, throwing an exception short-circuits the rest of the monadic computation.

Methods

throwM :: Exception e => e -> m a

Throw an exception. Note that this throws when this action is run in the monad m, not when it is applied. It is a generalization of Control.Exception's throwIO.

Should satisfy the law:

throwM e >> f = throwM e

Instances

MonadThrow []

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> [a]

MonadThrow Maybe

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> Maybe a

MonadThrow IO

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> IO a

MonadThrow Q

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> Q a

MonadThrow STM

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> STM a

e ~ SomeException => MonadThrow (Either e)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e0 => e0 -> Either e a

MonadThrow (ST s)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> ST s a

MonadThrow m => MonadThrow (MaybeT m)

Throws exceptions into the base monad.

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> MaybeT m a

MonadThrow m => MonadThrow (ListT m)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> ListT m a

MonadThrow m => MonadThrow (ExceptT e m)

Throws exceptions into the base monad.

Defined in Control.Monad.Catch

Methods

throwM :: Exception e0 => e0 -> ExceptT e m a

MonadThrow m => MonadThrow (IdentityT m)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> IdentityT m a

(Error e, MonadThrow m) => MonadThrow (ErrorT e m)

Throws exceptions into the base monad.

Defined in Control.Monad.Catch

Methods

throwM :: Exception e0 => e0 -> ErrorT e m a

MonadThrow m => MonadThrow (ReaderT r m)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> ReaderT r m a

MonadThrow m => MonadThrow (StateT s m)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> StateT s m a

MonadThrow m => MonadThrow (StateT s m)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> StateT s m a

(MonadThrow m, Monoid w) => MonadThrow (WriterT w m)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> WriterT w m a

(MonadThrow m, Monoid w) => MonadThrow (WriterT w m)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> WriterT w m a

MonadThrow m => MonadThrow (ContT r m)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> ContT r m a

(MonadThrow m, Monoid w) => MonadThrow (RWST r w s m)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> RWST r w s m a

(MonadThrow m, Monoid w) => MonadThrow (RWST r w s m)

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> RWST r w s m a

data IndexException where

Exceptions that get thrown when there is a problem with an index, size or dimension.

Since: 0.3.0

Constructors

IndexZeroException :: Index ix => !ix -> IndexException

Index contains a zero value along one of the dimensions.

IndexDimensionException :: (NFData ix, Eq ix, Show ix, Typeable ix) => !ix -> !Dim -> IndexException

Dimension is out of reach.

IndexOutOfBoundsException :: Index ix => !(Sz ix) -> !ix -> IndexException

Index is out of bounds.

Instances

Eq IndexException

Defined in Data.Massiv.Core.Index.Internal

Methods

(==) :: IndexException -> IndexException -> Bool

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

Show IndexException

Defined in Data.Massiv.Core.Index.Internal

Methods

showsPrec :: Int -> IndexException -> ShowS

show :: IndexException -> String

showList :: [IndexException] -> ShowS

Exception IndexException

Defined in Data.Massiv.Core.Index.Internal

Methods

toException :: IndexException -> SomeException

fromException :: SomeException -> Maybe IndexException

displayException :: IndexException -> String

NFData IndexException

Defined in Data.Massiv.Core.Index.Internal

Methods

rnf :: IndexException -> ()

data SizeException where

Exception that indicates an issue with an array size.

Since: 0.3.0

Constructors

SizeMismatchException :: Index ix => !(Sz ix) -> !(Sz ix) -> SizeException

Two sizes are expected to be equal along some or all dimensions, but they are not.

SizeElementsMismatchException :: (Index ix, Index ix') => !(Sz ix) -> !(Sz ix') -> SizeException

Total number of elements does not match between the two sizes.

SizeSubregionException :: Index ix => !(Sz ix) -> !ix -> !(Sz ix) -> SizeException

Described subregion is too big for the specified size.

SizeEmptyException :: Index ix => !(Sz ix) -> SizeException

An array with the size cannot contain any elements.

SizeOverflowException :: Index ix => !(Sz ix) -> SizeException

Total number of elements is too large resulting in overflow.

Since: 0.6.0

SizeNegativeException :: Index ix => !(Sz ix) -> SizeException

At least one dimensions contain a negative value.

Since: 0.6.0

Instances

Eq SizeException

Defined in Data.Massiv.Core.Index.Internal

Methods

(==) :: SizeException -> SizeException -> Bool

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

Show SizeException

Defined in Data.Massiv.Core.Index.Internal

Methods

showsPrec :: Int -> SizeException -> ShowS

show :: SizeException -> String

showList :: [SizeException] -> ShowS

Exception SizeException

Defined in Data.Massiv.Core.Index.Internal

Methods

toException :: SizeException -> SomeException

fromException :: SomeException -> Maybe SizeException

displayException :: SizeException -> String

NFData SizeException

Defined in Data.Massiv.Core.Index.Internal

Methods

rnf :: SizeException -> ()

data ShapeException

Exception that can happen upon conversion of a ragged type array into the rectangular kind. Which means conversion from lists is susceptible to this exception.

Since: 0.3.0

Constructors

DimTooShortException !Dim !(Sz Ix1) !(Sz Ix1)

Across a specific dimension there was not enough elements for the supplied size

DimTooLongException !Dim !(Sz Ix1) !(Sz Ix1)

Across a specific dimension there was too many elements for the supplied size

ShapeNonEmpty

Expected an empty size, but the shape was not empty.

Instances

Eq ShapeException

Defined in Data.Massiv.Core.Index.Internal

Methods

(==) :: ShapeException -> ShapeException -> Bool

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

Show ShapeException

Defined in Data.Massiv.Core.Index.Internal

Methods

showsPrec :: Int -> ShapeException -> ShowS

show :: ShapeException -> String

showList :: [ShapeException] -> ShowS

Exception ShapeException

Defined in Data.Massiv.Core.Index.Internal

Methods

toException :: ShapeException -> SomeException

fromException :: SomeException -> Maybe ShapeException

displayException :: ShapeException -> String

throwImpossible :: HasCallStack => Exception e => e -> a

Throw an impossible error.

Since: 0.5.6

throwEither :: HasCallStack => Either SomeException a -> a

Throw an error on Left or produce the result on Right. Exception type is lost, so do not expect to be able to catch it as such. Stick to IO if you need exception control flow.

Since: 0.5.6

data Uninitialized

An error that gets thrown when an unitialized element of a boxed array gets accessed. Can only happen when array was constructed with unsafeNew.

Constructors

Uninitialized

Instances

Show Uninitialized

Defined in Data.Massiv.Core.Exception

Methods

showsPrec :: Int -> Uninitialized -> ShowS

show :: Uninitialized -> String

showList :: [Uninitialized] -> ShowS

Exception Uninitialized

Defined in Data.Massiv.Core.Exception

Methods

toException :: Uninitialized -> SomeException

fromException :: SomeException -> Maybe Uninitialized

displayException :: Uninitialized -> String

guardNumberOfElements :: (MonadThrow m, Index ix, Index ix') => Sz ix -> Sz ix' -> m ()

Throw SizeElementsMismatchException whenever number of elements in both sizes do not match.

Since: 0.3.5

class (Typeable e, Show e) => Exception e where

Any type that you wish to throw or catch as an exception must be an instance of the Exception class. The simplest case is a new exception type directly below the root:

data MyException = ThisException | ThatException
    deriving Show

instance Exception MyException

The default method definitions in the Exception class do what we need in this case. You can now throw and catch ThisException and ThatException as exceptions:

*Main> throw ThisException `catch` \e -> putStrLn ("Caught " ++ show (e :: MyException))
Caught ThisException

In more complicated examples, you may wish to define a whole hierarchy of exceptions:

---------------------------------------------------------------------
-- Make the root exception type for all the exceptions in a compiler

data SomeCompilerException = forall e . Exception e => SomeCompilerException e

instance Show SomeCompilerException where
    show (SomeCompilerException e) = show e

instance Exception SomeCompilerException

compilerExceptionToException :: Exception e => e -> SomeException
compilerExceptionToException = toException . SomeCompilerException

compilerExceptionFromException :: Exception e => SomeException -> Maybe e
compilerExceptionFromException x = do
    SomeCompilerException a <- fromException x
    cast a

---------------------------------------------------------------------
-- Make a subhierarchy for exceptions in the frontend of the compiler

data SomeFrontendException = forall e . Exception e => SomeFrontendException e

instance Show SomeFrontendException where
    show (SomeFrontendException e) = show e

instance Exception SomeFrontendException where
    toException = compilerExceptionToException
    fromException = compilerExceptionFromException

frontendExceptionToException :: Exception e => e -> SomeException
frontendExceptionToException = toException . SomeFrontendException

frontendExceptionFromException :: Exception e => SomeException -> Maybe e
frontendExceptionFromException x = do
    SomeFrontendException a <- fromException x
    cast a

---------------------------------------------------------------------
-- Make an exception type for a particular frontend compiler exception

data MismatchedParentheses = MismatchedParentheses
    deriving Show

instance Exception MismatchedParentheses where
    toException   = frontendExceptionToException
    fromException = frontendExceptionFromException

We can now catch a MismatchedParentheses exception as MismatchedParentheses, SomeFrontendException or SomeCompilerException, but not other types, e.g. IOException:

*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: MismatchedParentheses))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: SomeFrontendException))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: SomeCompilerException))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: IOException))
*** Exception: MismatchedParentheses

Minimal complete definition

Nothing

Methods

toException :: e -> SomeException

fromException :: SomeException -> Maybe e

displayException :: e -> String

Render this exception value in a human-friendly manner.

Default implementation: show.

Since: base-4.8.0.0

Instances

Exception Void

Since: base-4.8.0.0

Defined in Data.Void

Methods

toException :: Void -> SomeException

fromException :: SomeException -> Maybe Void

displayException :: Void -> String

Exception PatternMatchFail

Since: base-4.0

Defined in Control.Exception.Base

Methods

toException :: PatternMatchFail -> SomeException

fromException :: SomeException -> Maybe PatternMatchFail

displayException :: PatternMatchFail -> String

Exception RecSelError

Since: base-4.0

Defined in Control.Exception.Base

Methods

toException :: RecSelError -> SomeException

fromException :: SomeException -> Maybe RecSelError

displayException :: RecSelError -> String

Exception RecConError

Since: base-4.0

Defined in Control.Exception.Base

Methods

toException :: RecConError -> SomeException

fromException :: SomeException -> Maybe RecConError

displayException :: RecConError -> String

Exception RecUpdError

Since: base-4.0

Defined in Control.Exception.Base

Methods

toException :: RecUpdError -> SomeException

fromException :: SomeException -> Maybe RecUpdError

displayException :: RecUpdError -> String

Exception NoMethodError

Since: base-4.0

Defined in Control.Exception.Base

Methods

toException :: NoMethodError -> SomeException

fromException :: SomeException -> Maybe NoMethodError

displayException :: NoMethodError -> String

Exception TypeError

Since: base-4.9.0.0

Defined in Control.Exception.Base

Methods

toException :: TypeError -> SomeException

fromException :: SomeException -> Maybe TypeError

displayException :: TypeError -> String

Exception NonTermination

Since: base-4.0

Defined in Control.Exception.Base

Methods

toException :: NonTermination -> SomeException

fromException :: SomeException -> Maybe NonTermination

displayException :: NonTermination -> String

Exception NestedAtomically

Since: base-4.0

Defined in Control.Exception.Base

Methods

toException :: NestedAtomically -> SomeException

fromException :: SomeException -> Maybe NestedAtomically

displayException :: NestedAtomically -> String

Exception BlockedIndefinitelyOnMVar

Since: base-4.1.0.0

Defined in GHC.IO.Exception

Methods

toException :: BlockedIndefinitelyOnMVar -> SomeException

fromException :: SomeException -> Maybe BlockedIndefinitelyOnMVar

displayException :: BlockedIndefinitelyOnMVar -> String

Exception BlockedIndefinitelyOnSTM

Since: base-4.1.0.0

Defined in GHC.IO.Exception

Methods

toException :: BlockedIndefinitelyOnSTM -> SomeException

fromException :: SomeException -> Maybe BlockedIndefinitelyOnSTM

displayException :: BlockedIndefinitelyOnSTM -> String

Exception Deadlock

Since: base-4.1.0.0

Defined in GHC.IO.Exception

Methods

toException :: Deadlock -> SomeException

fromException :: SomeException -> Maybe Deadlock

displayException :: Deadlock -> String

Exception AllocationLimitExceeded

Since: base-4.8.0.0

Defined in GHC.IO.Exception

Methods

toException :: AllocationLimitExceeded -> SomeException

fromException :: SomeException -> Maybe AllocationLimitExceeded

displayException :: AllocationLimitExceeded -> String

Exception CompactionFailed

Since: base-4.10.0.0

Defined in GHC.IO.Exception

Methods

toException :: CompactionFailed -> SomeException

fromException :: SomeException -> Maybe CompactionFailed

displayException :: CompactionFailed -> String

Exception AssertionFailed

Since: base-4.1.0.0

Defined in GHC.IO.Exception

Methods

toException :: AssertionFailed -> SomeException

fromException :: SomeException -> Maybe AssertionFailed

displayException :: AssertionFailed -> String

Exception SomeAsyncException

Since: base-4.7.0.0

Defined in GHC.IO.Exception

Methods

toException :: SomeAsyncException -> SomeException

fromException :: SomeException -> Maybe SomeAsyncException

displayException :: SomeAsyncException -> String

Exception AsyncException

Since: base-4.7.0.0

Defined in GHC.IO.Exception

Methods

toException :: AsyncException -> SomeException

fromException :: SomeException -> Maybe AsyncException

displayException :: AsyncException -> String

Exception ArrayException

Since: base-4.1.0.0

Defined in GHC.IO.Exception

Methods

toException :: ArrayException -> SomeException

fromException :: SomeException -> Maybe ArrayException

displayException :: ArrayException -> String

Exception FixIOException

Since: base-4.11.0.0

Defined in GHC.IO.Exception

Methods

toException :: FixIOException -> SomeException

fromException :: SomeException -> Maybe FixIOException

displayException :: FixIOException -> String

Exception ExitCode

Since: base-4.1.0.0

Defined in GHC.IO.Exception

Methods

toException :: ExitCode -> SomeException

fromException :: SomeException -> Maybe ExitCode

displayException :: ExitCode -> String

Exception IOException

Since: base-4.1.0.0

Defined in GHC.IO.Exception

Methods

toException :: IOException -> SomeException

fromException :: SomeException -> Maybe IOException

displayException :: IOException -> String

Exception ErrorCall

Since: base-4.0.0.0

Defined in GHC.Exception

Methods

toException :: ErrorCall -> SomeException

fromException :: SomeException -> Maybe ErrorCall

displayException :: ErrorCall -> String

Exception ArithException

Since: base-4.0.0.0

Defined in GHC.Exception.Type

Methods

toException :: ArithException -> SomeException

fromException :: SomeException -> Maybe ArithException

displayException :: ArithException -> String

Exception SomeException

Since: base-3.0

Defined in GHC.Exception.Type

Methods

toException :: SomeException -> SomeException

fromException :: SomeException -> Maybe SomeException

displayException :: SomeException -> String

Exception TerminateEarlyException

Defined in Control.Scheduler.Types

Methods

toException :: TerminateEarlyException -> SomeException

fromException :: SomeException -> Maybe TerminateEarlyException

displayException :: TerminateEarlyException -> String

Exception CancelBatchException

Defined in Control.Scheduler.Types

Methods

toException :: CancelBatchException -> SomeException

fromException :: SomeException -> Maybe CancelBatchException

displayException :: CancelBatchException -> String

Exception WorkerTerminateException

Defined in Control.Scheduler.Types

Methods

toException :: WorkerTerminateException -> SomeException

fromException :: SomeException -> Maybe WorkerTerminateException

displayException :: WorkerTerminateException -> String

Exception WorkerException

Defined in Control.Scheduler.Types

Methods

toException :: WorkerException -> SomeException

fromException :: SomeException -> Maybe WorkerException

displayException :: WorkerException -> String

Exception MutexException

Defined in Control.Scheduler.Types

Methods

toException :: MutexException -> SomeException

fromException :: SomeException -> Maybe MutexException

displayException :: MutexException -> String

Exception ShapeException

Defined in Data.Massiv.Core.Index.Internal

Methods

toException :: ShapeException -> SomeException

fromException :: SomeException -> Maybe ShapeException

displayException :: ShapeException -> String

Exception SizeException

Defined in Data.Massiv.Core.Index.Internal

Methods

toException :: SizeException -> SomeException

fromException :: SomeException -> Maybe SizeException

displayException :: SizeException -> String

Exception IndexException

Defined in Data.Massiv.Core.Index.Internal

Methods

toException :: IndexException -> SomeException

fromException :: SomeException -> Maybe IndexException

displayException :: IndexException -> String

Exception Uninitialized

Defined in Data.Massiv.Core.Exception

Methods

toException :: Uninitialized -> SomeException

fromException :: SomeException -> Maybe Uninitialized

displayException :: Uninitialized -> String

data SomeException

The SomeException type is the root of the exception type hierarchy. When an exception of type e is thrown, behind the scenes it is encapsulated in a SomeException.

Instances

Show SomeException

Since: base-3.0

Defined in GHC.Exception.Type

Methods

showsPrec :: Int -> SomeException -> ShowS

show :: SomeException -> String

showList :: [SomeException] -> ShowS

Exception SomeException

Since: base-3.0

Defined in GHC.Exception.Type

Methods

toException :: SomeException -> SomeException

fromException :: SomeException -> Maybe SomeException

displayException :: SomeException -> String

type HasCallStack = ?callStack :: CallStack

Request a CallStack.

NOTE: The implicit parameter ?callStack :: CallStack is an implementation detail and should not be considered part of the CallStack API, we may decide to change the implementation in the future.

Since: base-4.9.0.0

Stateful Monads

class MonadIO m => MonadUnliftIO (m :: Type -> Type)

Monads which allow their actions to be run in IO.

While MonadIO allows an IO action to be lifted into another monad, this class captures the opposite concept: allowing you to capture the monadic context. Note that, in order to meet the laws given below, the intuition is that a monad must have no monadic state, but may have monadic context. This essentially limits MonadUnliftIO to ReaderT and IdentityT transformers on top of IO.

Laws. For any value u returned by askUnliftIO, it must meet the monad transformer laws as reformulated for MonadUnliftIO:

• unliftIO u . return = return

• unliftIO u (m >>= f) = unliftIO u m >>= unliftIO u . f

Instances of MonadUnliftIO must also satisfy the idempotency law:

• askUnliftIO >>= \u -> (liftIO . unliftIO u) m = m

This law showcases two properties. First, askUnliftIO doesn't change the monadic context, and second, liftIO . unliftIO u is equivalent to id IF called in the same monadic context as askUnliftIO.

Since: unliftio-core-0.1.0.0

Minimal complete definition

withRunInIO

Instances

MonadUnliftIO IO

Defined in Control.Monad.IO.Unlift

Methods

withRunInIO :: ((forall a. IO a -> IO a) -> IO b) -> IO b

MonadUnliftIO m => MonadUnliftIO (IdentityT m)

Defined in Control.Monad.IO.Unlift

Methods

withRunInIO :: ((forall a. IdentityT m a -> IO a) -> IO b) -> IdentityT m b

MonadUnliftIO m => MonadUnliftIO (ReaderT r m)

Defined in Control.Monad.IO.Unlift

Methods

withRunInIO :: ((forall a. ReaderT r m a -> IO a) -> IO b) -> ReaderT r m b

class Monad m => MonadIO (m :: Type -> Type) where

Monads in which IO computations may be embedded. Any monad built by applying a sequence of monad transformers to the IO monad will be an instance of this class.

Instances should satisfy the following laws, which state that liftIO is a transformer of monads:

• liftIO . return = return

• liftIO (m >>= f) = liftIO m >>= (liftIO . f)

Methods

liftIO :: IO a -> m a

Lift a computation from the IO monad.

Instances

MonadIO IO

Since: base-4.9.0.0

Defined in Control.Monad.IO.Class

Methods

liftIO :: IO a -> IO a

MonadIO Q

Defined in Language.Haskell.TH.Syntax

Methods

liftIO :: IO a -> Q a

MonadIO m => MonadIO (MaybeT m)

Defined in Control.Monad.Trans.Maybe

Methods

liftIO :: IO a -> MaybeT m a

MonadIO m => MonadIO (ListT m)

Defined in Control.Monad.Trans.List

Methods

liftIO :: IO a -> ListT m a

MonadIO m => MonadIO (ExceptT e m)

Defined in Control.Monad.Trans.Except

Methods

liftIO :: IO a -> ExceptT e m a

MonadIO m => MonadIO (IdentityT m)

Defined in Control.Monad.Trans.Identity

Methods

liftIO :: IO a -> IdentityT m a

(Error e, MonadIO m) => MonadIO (ErrorT e m)

Defined in Control.Monad.Trans.Error

Methods

liftIO :: IO a -> ErrorT e m a

MonadIO m => MonadIO (ReaderT r m)

Defined in Control.Monad.Trans.Reader

Methods

liftIO :: IO a -> ReaderT r m a

MonadIO m => MonadIO (StateT s m)

Defined in Control.Monad.Trans.State.Lazy

Methods

liftIO :: IO a -> StateT s m a

MonadIO m => MonadIO (StateT s m)

Defined in Control.Monad.Trans.State.Strict

Methods

liftIO :: IO a -> StateT s m a

(Monoid w, MonadIO m) => MonadIO (WriterT w m)

Defined in Control.Monad.Trans.Writer.Lazy

Methods

liftIO :: IO a -> WriterT w m a

(Monoid w, MonadIO m) => MonadIO (WriterT w m)

Defined in Control.Monad.Trans.Writer.Strict

Methods

liftIO :: IO a -> WriterT w m a

(Monoid w, Functor m, MonadIO m) => MonadIO (AccumT w m)

Defined in Control.Monad.Trans.Accum

Methods

liftIO :: IO a -> AccumT w m a

MonadIO m => MonadIO (WriterT w m)

Defined in Control.Monad.Trans.Writer.CPS

Methods

liftIO :: IO a -> WriterT w m a

MonadIO m => MonadIO (SelectT r m)

Defined in Control.Monad.Trans.Select

Methods

liftIO :: IO a -> SelectT r m a

MonadIO m => MonadIO (ContT r m)

Defined in Control.Monad.Trans.Cont

Methods

liftIO :: IO a -> ContT r m a

(Monoid w, MonadIO m) => MonadIO (RWST r w s m)

Defined in Control.Monad.Trans.RWS.Lazy

Methods

liftIO :: IO a -> RWST r w s m a

(Monoid w, MonadIO m) => MonadIO (RWST r w s m)

Defined in Control.Monad.Trans.RWS.Strict

Methods

liftIO :: IO a -> RWST r w s m a

MonadIO m => MonadIO (RWST r w s m)

Defined in Control.Monad.Trans.RWS.CPS

Methods

liftIO :: IO a -> RWST r w s m a

class Monad m => PrimMonad (m :: Type -> Type)

Class of monads which can perform primitive state-transformer actions.

Minimal complete definition

primitive

Associated Types

type PrimState (m :: Type -> Type)

State token type.

Instances

PrimMonad IO

Defined in Control.Monad.Primitive

Associated Types

type PrimState IO

Methods

primitive :: (State# (PrimState IO) -> (# State# (PrimState IO), a #)) -> IO a

PrimMonad (ST s)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (ST s)

Methods

primitive :: (State# (PrimState (ST s)) -> (# State# (PrimState (ST s)), a #)) -> ST s a

PrimMonad (ST s)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (ST s)

Methods

primitive :: (State# (PrimState (ST s)) -> (# State# (PrimState (ST s)), a #)) -> ST s a

PrimMonad m => PrimMonad (MaybeT m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (MaybeT m)

Methods

primitive :: (State# (PrimState (MaybeT m)) -> (# State# (PrimState (MaybeT m)), a #)) -> MaybeT m a

PrimMonad m => PrimMonad (ListT m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (ListT m)

Methods

primitive :: (State# (PrimState (ListT m)) -> (# State# (PrimState (ListT m)), a #)) -> ListT m a

PrimMonad m => PrimMonad (ExceptT e m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (ExceptT e m)

Methods

primitive :: (State# (PrimState (ExceptT e m)) -> (# State# (PrimState (ExceptT e m)), a #)) -> ExceptT e m a

PrimMonad m => PrimMonad (IdentityT m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (IdentityT m)

Methods

primitive :: (State# (PrimState (IdentityT m)) -> (# State# (PrimState (IdentityT m)), a #)) -> IdentityT m a

(Error e, PrimMonad m) => PrimMonad (ErrorT e m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (ErrorT e m)

Methods

primitive :: (State# (PrimState (ErrorT e m)) -> (# State# (PrimState (ErrorT e m)), a #)) -> ErrorT e m a

PrimMonad m => PrimMonad (ReaderT r m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (ReaderT r m)

Methods

primitive :: (State# (PrimState (ReaderT r m)) -> (# State# (PrimState (ReaderT r m)), a #)) -> ReaderT r m a

PrimMonad m => PrimMonad (StateT s m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (StateT s m)

Methods

primitive :: (State# (PrimState (StateT s m)) -> (# State# (PrimState (StateT s m)), a #)) -> StateT s m a

PrimMonad m => PrimMonad (StateT s m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (StateT s m)

Methods

primitive :: (State# (PrimState (StateT s m)) -> (# State# (PrimState (StateT s m)), a #)) -> StateT s m a

(Monoid w, PrimMonad m) => PrimMonad (WriterT w m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (WriterT w m)

Methods

primitive :: (State# (PrimState (WriterT w m)) -> (# State# (PrimState (WriterT w m)), a #)) -> WriterT w m a

(Monoid w, PrimMonad m) => PrimMonad (WriterT w m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (WriterT w m)

Methods

primitive :: (State# (PrimState (WriterT w m)) -> (# State# (PrimState (WriterT w m)), a #)) -> WriterT w m a

(Monoid w, PrimMonad m) => PrimMonad (AccumT w m)

Since: primitive-0.6.3.0

Defined in Control.Monad.Primitive

Associated Types

type PrimState (AccumT w m)

Methods

primitive :: (State# (PrimState (AccumT w m)) -> (# State# (PrimState (AccumT w m)), a #)) -> AccumT w m a

(Monoid w, PrimMonad m) => PrimMonad (WriterT w m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (WriterT w m)

Methods

primitive :: (State# (PrimState (WriterT w m)) -> (# State# (PrimState (WriterT w m)), a #)) -> WriterT w m a

PrimMonad m => PrimMonad (SelectT r m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (SelectT r m)

Methods

primitive :: (State# (PrimState (SelectT r m)) -> (# State# (PrimState (SelectT r m)), a #)) -> SelectT r m a

PrimMonad m => PrimMonad (ContT r m)

Since: primitive-0.6.3.0

Defined in Control.Monad.Primitive

Associated Types

type PrimState (ContT r m)

Methods

primitive :: (State# (PrimState (ContT r m)) -> (# State# (PrimState (ContT r m)), a #)) -> ContT r m a

(Monoid w, PrimMonad m) => PrimMonad (RWST r w s m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (RWST r w s m)

Methods

primitive :: (State# (PrimState (RWST r w s m)) -> (# State# (PrimState (RWST r w s m)), a #)) -> RWST r w s m a

(Monoid w, PrimMonad m) => PrimMonad (RWST r w s m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (RWST r w s m)

Methods

primitive :: (State# (PrimState (RWST r w s m)) -> (# State# (PrimState (RWST r w s m)), a #)) -> RWST r w s m a

(Monoid w, PrimMonad m) => PrimMonad (RWST r w s m)

Defined in Control.Monad.Primitive

Associated Types

type PrimState (RWST r w s m)

Methods

primitive :: (State# (PrimState (RWST r w s m)) -> (# State# (PrimState (RWST r w s m)), a #)) -> RWST r w s m a