Data.Array.Knead.Shape

Documentation

class (C sh, C (Index sh), Indexed sh) => C sh where

Minimal complete definition

intersectCode, size, sizeOffset, iterator

Methods

intersectCode :: T sh -> T sh -> CodeGenFunction r (T sh)

size :: T sh -> CodeGenFunction r (Value Size)

sizeOffset :: Index sh ~ ix => T sh -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

Result is (size, offset). size must equal the result of size. We use this for sharing intermediate results.

iterator :: Index sh ~ ix => T sh -> T r (T ix)

loop :: (Index sh ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T sh -> state -> CodeGenFunction r state

Instances

C ()

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T () -> T () -> CodeGenFunction r (T ())

size :: T () -> CodeGenFunction r (Value Size)

sizeOffset :: Index () ~ ix => T () -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index () ~ ix => T () -> T r (T ix)

loop :: (Index () ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T () -> state -> CodeGenFunction r state

(Integral n, ToSize n, Comparison n) => C (Cyclic n)

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (Cyclic n) -> T (Cyclic n) -> CodeGenFunction r (T (Cyclic n))

size :: T (Cyclic n) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (Cyclic n) ~ ix => T (Cyclic n) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (Cyclic n) ~ ix => T (Cyclic n) -> T r (T ix)

loop :: (Index (Cyclic n) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (Cyclic n) -> state -> CodeGenFunction r state

(Enum enum, Bounded enum, EnumBounded enum) => C (Enumeration enum)

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (Enumeration enum) -> T (Enumeration enum) -> CodeGenFunction r (T (Enumeration enum))

size :: T (Enumeration enum) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (Enumeration enum) ~ ix => T (Enumeration enum) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (Enumeration enum) ~ ix => T (Enumeration enum) -> T r (T ix)

loop :: (Index (Enumeration enum) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (Enumeration enum) -> state -> CodeGenFunction r state

(Ix n, ToSize n, Comparison n) => C (Range n)

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (Range n) -> T (Range n) -> CodeGenFunction r (T (Range n))

size :: T (Range n) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (Range n) ~ ix => T (Range n) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (Range n) ~ ix => T (Range n) -> T r (T ix)

loop :: (Index (Range n) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (Range n) -> state -> CodeGenFunction r state

(Integral n, ToSize n, Comparison n) => C (Shifted n)

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (Shifted n) -> T (Shifted n) -> CodeGenFunction r (T (Shifted n))

size :: T (Shifted n) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (Shifted n) ~ ix => T (Shifted n) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (Shifted n) ~ ix => T (Shifted n) -> T r (T ix)

loop :: (Index (Shifted n) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (Shifted n) -> state -> CodeGenFunction r state

(Integral n, ToSize n, Comparison n) => C (ZeroBased n)

Array dimensions and indexes cannot be negative, but computations in indices may temporarily yield negative values or we want to add negative values to indices.

So maybe, we would better have type Index (ZeroBased Word64) = Int64. This is not possible. Maybe we need an additional ZeroBased type for unsigned array sizes.

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (ZeroBased n) -> T (ZeroBased n) -> CodeGenFunction r (T (ZeroBased n))

size :: T (ZeroBased n) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (ZeroBased n) ~ ix => T (ZeroBased n) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (ZeroBased n) ~ ix => T (ZeroBased n) -> T r (T ix)

loop :: (Index (ZeroBased n) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (ZeroBased n) -> state -> CodeGenFunction r state

(tag ~ ShapeTag, Natural rank) => C (T tag rank)

Defined in Data.Array.Knead.Shape.Cubic

Methods

intersectCode :: T0 (T tag rank) -> T0 (T tag rank) -> CodeGenFunction r (T0 (T tag rank))

size :: T0 (T tag rank) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (T tag rank) ~ ix => T0 (T tag rank) -> CodeGenFunction r (Value Size, T0 ix -> CodeGenFunction r (Value Size))

iterator :: Index (T tag rank) ~ ix => T0 (T tag rank) -> T1 r (T0 ix)

loop :: (Index (T tag rank) ~ ix, Phi state) => (T0 ix -> state -> CodeGenFunction r state) -> T0 (T tag rank) -> state -> CodeGenFunction r state

(C n, C m) => C (n, m)

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (n, m) -> T (n, m) -> CodeGenFunction r (T (n, m))

size :: T (n, m) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (n, m) ~ ix => T (n, m) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (n, m) ~ ix => T (n, m) -> T r (T ix)

loop :: (Index (n, m) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (n, m) -> state -> CodeGenFunction r state

C sh => C (Tagged tag sh)

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (Tagged tag sh) -> T (Tagged tag sh) -> CodeGenFunction r (T (Tagged tag sh))

size :: T (Tagged tag sh) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (Tagged tag sh) ~ ix => T (Tagged tag sh) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (Tagged tag sh) ~ ix => T (Tagged tag sh) -> T r (T ix)

loop :: (Index (Tagged tag sh) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (Tagged tag sh) -> state -> CodeGenFunction r state

(C n, C m, C l) => C (n, m, l)

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (n, m, l) -> T (n, m, l) -> CodeGenFunction r (T (n, m, l))

size :: T (n, m, l) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (n, m, l) ~ ix => T (n, m, l) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (n, m, l) ~ ix => T (n, m, l) -> T r (T ix)

loop :: (Index (n, m, l) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (n, m, l) -> state -> CodeGenFunction r state

type family Index sh

Instances

type Index IntSet

Defined in Data.Array.Comfort.Shape

type Index IntSet = Int

type Index ()

Defined in Data.Array.Comfort.Shape

type Index () = ()

type Index (Constructed tag)

Defined in Data.Array.Comfort.Shape

type Index (Constructed tag) = ConsIndex tag

type Index (Cube sh)

Defined in Data.Array.Comfort.Shape

type Index (Cube sh) = (Index sh, Index sh, Index sh)

type Index (Cyclic n)

Defined in Data.Array.Comfort.Shape

type Index (Cyclic n) = n

type Index (Deferred sh)

Defined in Data.Array.Comfort.Shape

type Index (Deferred sh) = DeferredIndex sh

type Index (Enumeration n)

Defined in Data.Array.Comfort.Shape

type Index (Enumeration n) = n

type Index (OneBased n)

Defined in Data.Array.Comfort.Shape

type Index (OneBased n) = n

type Index (Range n)

Defined in Data.Array.Comfort.Shape

type Index (Range n) = n

type Index (Record f)

Defined in Data.Array.Comfort.Shape

type Index (Record f) = FieldIndex f

type Index (Shifted n)

Defined in Data.Array.Comfort.Shape

type Index (Shifted n) = n

type Index (Square sh)

Defined in Data.Array.Comfort.Shape

type Index (Square sh) = (Index sh, Index sh)

type Index (ZeroBased n)

Defined in Data.Array.Comfort.Shape

type Index (ZeroBased n) = n

type Index (IntMap shape)

Defined in Data.Array.Comfort.Shape

type Index (IntMap shape) = (Int, Index shape)

type Index (Set n)

Defined in Data.Array.Comfort.Shape

type Index (Set n) = n

type Index (sh0 ::+ sh1)

Defined in Data.Array.Comfort.Shape

type Index (sh0 ::+ sh1) = Either (Index sh0) (Index sh1)

type Index (NestedTuple TupleAccessor tuple)

Defined in Data.Array.Comfort.Shape

type Index (NestedTuple TupleAccessor tuple) = tuple -> Element

type Index (NestedTuple TupleIndex tuple)

Defined in Data.Array.Comfort.Shape

type Index (NestedTuple TupleIndex tuple) = ElementIndex tuple

type Index (Triangular part size)

Defined in Data.Array.Comfort.Shape

type Index (Triangular part size) = (Index size, Index size)

type Index (Map k shape)

Defined in Data.Array.Comfort.Shape

type Index (Map k shape) = (k, Index shape)

type Index (T tag rank)

Defined in Data.Array.Knead.Shape.Cubic

type Index (T tag rank) = Index rank

type Index (sh0, sh1)

Defined in Data.Array.Comfort.Shape

type Index (sh0, sh1) = (Index sh0, Index sh1)

type Index (Tagged s sh)

Defined in Data.Array.Comfort.Shape

type Index (Tagged s sh) = Tagged s (Index sh)

type Index (sh0, sh1, sh2)

Defined in Data.Array.Comfort.Shape

type Index (sh0, sh1, sh2) = (Index sh0, Index sh1, Index sh2)

type Index (Simplex order coll f size)

Defined in Data.Array.Comfort.Shape

type Index (Simplex order coll f size) = f (Index size)

type Size = Word

value :: (C sh, Value val) => sh -> val sh

paramWith :: C b => T p b -> (forall parameters. C parameters => (p -> parameters) -> (forall val. Value val => T parameters -> val b) -> a) -> a

load :: C sh => f sh -> Value (Ptr (Struct sh)) -> CodeGenFunction r (T sh)

intersect :: C sh => Exp sh -> Exp sh -> Exp sh

offset :: C sh => T sh -> T (Index sh) -> CodeGenFunction r (Value Size)

newtype ZeroBased n

ZeroBased denotes a range starting at zero and has a certain length.

>>> Shape.indices (Shape.ZeroBased (7::Int))
[0,1,2,3,4,5,6]

Constructors

ZeroBased n

Instances

Applicative ZeroBased

Defined in Data.Array.Comfort.Shape

Methods

pure :: a -> ZeroBased a

(<*>) :: ZeroBased (a -> b) -> ZeroBased a -> ZeroBased b

liftA2 :: (a -> b -> c) -> ZeroBased a -> ZeroBased b -> ZeroBased c

(*>) :: ZeroBased a -> ZeroBased b -> ZeroBased b

(<*) :: ZeroBased a -> ZeroBased b -> ZeroBased a

Functor ZeroBased

Defined in Data.Array.Comfort.Shape

Methods

fmap :: (a -> b) -> ZeroBased a -> ZeroBased b

(<$) :: a -> ZeroBased b -> ZeroBased a

Storable n => Storable (ZeroBased n)

Defined in Data.Array.Comfort.Shape

Methods

sizeOf :: ZeroBased n -> Int

alignment :: ZeroBased n -> Int

peekElemOff :: Ptr (ZeroBased n) -> Int -> IO (ZeroBased n)

pokeElemOff :: Ptr (ZeroBased n) -> Int -> ZeroBased n -> IO ()

peekByteOff :: Ptr b -> Int -> IO (ZeroBased n)

pokeByteOff :: Ptr b -> Int -> ZeroBased n -> IO ()

peek :: Ptr (ZeroBased n) -> IO (ZeroBased n)

poke :: Ptr (ZeroBased n) -> ZeroBased n -> IO ()

Show n => Show (ZeroBased n)

Defined in Data.Array.Comfort.Shape

Methods

showsPrec :: Int -> ZeroBased n -> ShowS

show :: ZeroBased n -> String

showList :: [ZeroBased n] -> ShowS

Integral n => AppendMonoid (ZeroBased n)

Defined in Data.Array.Comfort.Shape

Methods

empty :: ZeroBased n

Integral n => AppendSemigroup (ZeroBased n)

Defined in Data.Array.Comfort.Shape

Methods

append :: ZeroBased n -> ZeroBased n -> ZeroBased n

Integral n => C (ZeroBased n)

Defined in Data.Array.Comfort.Shape

Methods

size :: ZeroBased n -> Int

Integral n => Indexed (ZeroBased n)

Defined in Data.Array.Comfort.Shape

Associated Types

type Index (ZeroBased n)

Methods

indices :: ZeroBased n -> [Index (ZeroBased n)]

offset :: ZeroBased n -> Index (ZeroBased n) -> Int

uncheckedOffset :: ZeroBased n -> Index (ZeroBased n) -> Int

unifiedOffset :: Checking check => ZeroBased n -> Index (ZeroBased n) -> Result check Int

inBounds :: ZeroBased n -> Index (ZeroBased n) -> Bool

sizeOffset :: ZeroBased n -> (Int, Index (ZeroBased n) -> Int)

uncheckedSizeOffset :: ZeroBased n -> (Int, Index (ZeroBased n) -> Int)

unifiedSizeOffset :: Checking check => ZeroBased n -> (Int, Index (ZeroBased n) -> Result check Int)

Integral n => InvIndexed (ZeroBased n)

Defined in Data.Array.Comfort.Shape

Methods

indexFromOffset :: ZeroBased n -> Int -> Index (ZeroBased n)

uncheckedIndexFromOffset :: ZeroBased n -> Int -> Index (ZeroBased n)

unifiedIndexFromOffset :: Checking check => ZeroBased n -> Int -> Result check (Index (ZeroBased n))

Integral n => Pattern (ZeroBased n)

Defined in Data.Array.Comfort.Shape

Associated Types

type DataPattern (ZeroBased n) x

Methods

indexPattern :: (Index (ZeroBased n) -> x) -> ZeroBased n -> DataPattern (ZeroBased n) x

NFData n => NFData (ZeroBased n)

Defined in Data.Array.Comfort.Shape

Methods

rnf :: ZeroBased n -> ()

Eq n => Eq (ZeroBased n)

Defined in Data.Array.Comfort.Shape

Methods

(==) :: ZeroBased n -> ZeroBased n -> Bool

(/=) :: ZeroBased n -> ZeroBased n -> Bool

(Integral n, ToSize n, Comparison n) => C (ZeroBased n)

Array dimensions and indexes cannot be negative, but computations in indices may temporarily yield negative values or we want to add negative values to indices.

So maybe, we would better have type Index (ZeroBased Word64) = Int64. This is not possible. Maybe we need an additional ZeroBased type for unsigned array sizes.

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (ZeroBased n) -> T (ZeroBased n) -> CodeGenFunction r (T (ZeroBased n))

size :: T (ZeroBased n) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (ZeroBased n) ~ ix => T (ZeroBased n) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (ZeroBased n) ~ ix => T (ZeroBased n) -> T r (T ix)

loop :: (Index (ZeroBased n) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (ZeroBased n) -> state -> CodeGenFunction r state

(Integral n, ToSize n, Comparison n) => Sequence (ZeroBased n)

Defined in Data.Array.Knead.Shape

Methods

sequenceShapeFromIndex :: T (Index (ZeroBased n)) -> CodeGenFunction r (T (ZeroBased n))

Compose n => Compose (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Composed (ZeroBased n)

Methods

compose :: ZeroBased n -> Exp (Composed (ZeroBased n))

Decompose pn => Decompose (ZeroBased pn)

Defined in Data.Array.Knead.Shape.Orphan

Methods

decompose :: ZeroBased pn -> Exp (PatternTuple (ZeroBased pn)) -> Decomposed Exp (ZeroBased pn)

C n => C (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Struct (ZeroBased n)

Methods

load :: Value (Ptr (Struct (ZeroBased n))) -> CodeGenFunction r (ZeroBased n)

store :: ZeroBased n -> Value (Ptr (Struct (ZeroBased n))) -> CodeGenFunction r ()

decompose :: Value (Struct (ZeroBased n)) -> CodeGenFunction r (ZeroBased n)

compose :: ZeroBased n -> CodeGenFunction r (Value (Struct (ZeroBased n)))

C n => C (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

Methods

pack :: ZeroBased n -> Struct (ZeroBased n)

unpack :: Struct (ZeroBased n) -> ZeroBased n

C n => C (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Repr (ZeroBased n)

Methods

cons :: ZeroBased n -> T (ZeroBased n)

undef :: T (ZeroBased n)

zero :: T (ZeroBased n)

phi :: BasicBlock -> T (ZeroBased n) -> CodeGenFunction r (T (ZeroBased n))

addPhi :: BasicBlock -> T (ZeroBased n) -> T (ZeroBased n) -> CodeGenFunction r ()

Compose n => Compose (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Composed (ZeroBased n)

Methods

compose :: ZeroBased n -> T (Composed (ZeroBased n))

Decompose pn => Decompose (ZeroBased pn)

Defined in Data.Array.Knead.Shape.Orphan

Methods

decompose :: ZeroBased pn -> T (PatternTuple (ZeroBased pn)) -> Decomposed T (ZeroBased pn)

Value n => Value (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type ValueOf (ZeroBased n)

Methods

valueOf :: ZeroBased n -> ValueOf (ZeroBased n)

Phi n => Phi (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

Methods

phi :: BasicBlock -> ZeroBased n -> CodeGenFunction r (ZeroBased n)

addPhi :: BasicBlock -> ZeroBased n -> ZeroBased n -> CodeGenFunction r ()

Undefined n => Undefined (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

Methods

undef :: ZeroBased n

type Decomposed f (ZeroBased pn)

Defined in Data.Array.Knead.Shape.Orphan

type Decomposed f (ZeroBased pn) = ZeroBased (Decomposed f pn)

type Index (ZeroBased n)

Defined in Data.Array.Comfort.Shape

type Index (ZeroBased n) = n

type Composed (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

type Composed (ZeroBased n) = ZeroBased (Composed n)

type Struct (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

type Struct (ZeroBased n) = Struct n

type Composed (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

type Composed (ZeroBased n) = ZeroBased (Composed n)

type PatternTuple (ZeroBased pn)

Defined in Data.Array.Knead.Shape.Orphan

type PatternTuple (ZeroBased pn) = ZeroBased (PatternTuple pn)

type Repr (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

type Repr (ZeroBased n) = ZeroBased (Repr n)

type ValueOf (ZeroBased n)

Defined in Data.Array.Knead.Shape.Orphan

type ValueOf (ZeroBased n) = ZeroBased (ValueOf n)

type DataPattern (ZeroBased n) x

Defined in Data.Array.Comfort.Shape

type DataPattern (ZeroBased n) x = n -> x

zeroBased :: Value val => val n -> val (ZeroBased n)

zeroBasedSize :: Value val => val (ZeroBased n) -> val n

data Range n

Range denotes an inclusive range like those of the Haskell 98 standard Array type from the array package. E.g. the shape type (Range Int32, Range Int64) is equivalent to the ix type (Int32, Int64) for Arrays.

>>> Shape.indices (Shape.Range (-5) (5::Int))
[-5,-4,-3,-2,-1,0,1,2,3,4,5]
>>> Shape.indices (Shape.Range (-1,-1) (1::Int,1::Int))
[(-1,-1),(-1,0),(-1,1),(0,-1),(0,0),(0,1),(1,-1),(1,0),(1,1)]

Constructors

Range n n

Instances

Functor Range

Defined in Data.Array.Comfort.Shape

Methods

fmap :: (a -> b) -> Range a -> Range b

(<$) :: a -> Range b -> Range a

Storable n => Storable (Range n)

Defined in Data.Array.Comfort.Shape

Methods

sizeOf :: Range n -> Int

alignment :: Range n -> Int

peekElemOff :: Ptr (Range n) -> Int -> IO (Range n)

pokeElemOff :: Ptr (Range n) -> Int -> Range n -> IO ()

peekByteOff :: Ptr b -> Int -> IO (Range n)

pokeByteOff :: Ptr b -> Int -> Range n -> IO ()

peek :: Ptr (Range n) -> IO (Range n)

poke :: Ptr (Range n) -> Range n -> IO ()

Show n => Show (Range n)

Defined in Data.Array.Comfort.Shape

Methods

showsPrec :: Int -> Range n -> ShowS

show :: Range n -> String

showList :: [Range n] -> ShowS

Ix n => C (Range n)

Defined in Data.Array.Comfort.Shape

Methods

size :: Range n -> Int

Ix n => Indexed (Range n)

Defined in Data.Array.Comfort.Shape

Associated Types

type Index (Range n)

Methods

indices :: Range n -> [Index (Range n)]

offset :: Range n -> Index (Range n) -> Int

uncheckedOffset :: Range n -> Index (Range n) -> Int

unifiedOffset :: Checking check => Range n -> Index (Range n) -> Result check Int

inBounds :: Range n -> Index (Range n) -> Bool

sizeOffset :: Range n -> (Int, Index (Range n) -> Int)

uncheckedSizeOffset :: Range n -> (Int, Index (Range n) -> Int)

unifiedSizeOffset :: Checking check => Range n -> (Int, Index (Range n) -> Result check Int)

Ix n => InvIndexed (Range n)

Defined in Data.Array.Comfort.Shape

Methods

indexFromOffset :: Range n -> Int -> Index (Range n)

uncheckedIndexFromOffset :: Range n -> Int -> Index (Range n)

unifiedIndexFromOffset :: Checking check => Range n -> Int -> Result check (Index (Range n))

NFData n => NFData (Range n)

Defined in Data.Array.Comfort.Shape

Methods

rnf :: Range n -> ()

Eq n => Eq (Range n)

Defined in Data.Array.Comfort.Shape

Methods

(==) :: Range n -> Range n -> Bool

(/=) :: Range n -> Range n -> Bool

(Ix n, ToSize n, Comparison n) => C (Range n)

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (Range n) -> T (Range n) -> CodeGenFunction r (T (Range n))

size :: T (Range n) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (Range n) ~ ix => T (Range n) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (Range n) ~ ix => T (Range n) -> T r (T ix)

loop :: (Index (Range n) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (Range n) -> state -> CodeGenFunction r state

C n => C (Range n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Repr (Range n)

Methods

cons :: Range n -> T (Range n)

undef :: T (Range n)

zero :: T (Range n)

phi :: BasicBlock -> T (Range n) -> CodeGenFunction r (T (Range n))

addPhi :: BasicBlock -> T (Range n) -> T (Range n) -> CodeGenFunction r ()

Compose n => Compose (Range n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Composed (Range n)

Methods

compose :: Range n -> T (Composed (Range n))

Decompose pn => Decompose (Range pn)

Defined in Data.Array.Knead.Shape.Orphan

Methods

decompose :: Range pn -> T (PatternTuple (Range pn)) -> Decomposed T (Range pn)

Value n => Value (Range n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type ValueOf (Range n)

Methods

valueOf :: Range n -> ValueOf (Range n)

Undefined n => Undefined (Range n)

Defined in Data.Array.Knead.Shape.Orphan

Methods

undef :: Range n

type Decomposed f (Range pn)

Defined in Data.Array.Knead.Shape.Orphan

type Decomposed f (Range pn) = Range (Decomposed f pn)

type Index (Range n)

Defined in Data.Array.Comfort.Shape

type Index (Range n) = n

type Composed (Range n)

Defined in Data.Array.Knead.Shape.Orphan

type Composed (Range n) = Range (Composed n)

type PatternTuple (Range pn)

Defined in Data.Array.Knead.Shape.Orphan

type PatternTuple (Range pn) = Range (PatternTuple pn)

type Repr (Range n)

Defined in Data.Array.Knead.Shape.Orphan

type Repr (Range n) = Range (Repr n)

type ValueOf (Range n)

Defined in Data.Array.Knead.Shape.Orphan

type ValueOf (Range n) = Range (ValueOf n)

range :: Value val => val n -> val n -> val (Range n)

rangeFrom :: Value val => val (Range n) -> val n

rangeTo :: Value val => val (Range n) -> val n

data Shifted n

Shifted denotes a range defined by the start index and the length.

>>> Shape.indices (Shape.Shifted (-4) (8::Int))
[-4,-3,-2,-1,0,1,2,3]

Constructors

Shifted n n

Instances

Functor Shifted

Defined in Data.Array.Comfort.Shape

Methods

fmap :: (a -> b) -> Shifted a -> Shifted b

(<$) :: a -> Shifted b -> Shifted a

Storable n => Storable (Shifted n)

Defined in Data.Array.Comfort.Shape

Methods

sizeOf :: Shifted n -> Int

alignment :: Shifted n -> Int

peekElemOff :: Ptr (Shifted n) -> Int -> IO (Shifted n)

pokeElemOff :: Ptr (Shifted n) -> Int -> Shifted n -> IO ()

peekByteOff :: Ptr b -> Int -> IO (Shifted n)

pokeByteOff :: Ptr b -> Int -> Shifted n -> IO ()

peek :: Ptr (Shifted n) -> IO (Shifted n)

poke :: Ptr (Shifted n) -> Shifted n -> IO ()

Show n => Show (Shifted n)

Defined in Data.Array.Comfort.Shape

Methods

showsPrec :: Int -> Shifted n -> ShowS

show :: Shifted n -> String

showList :: [Shifted n] -> ShowS

Integral n => C (Shifted n)

Defined in Data.Array.Comfort.Shape

Methods

size :: Shifted n -> Int

Integral n => Indexed (Shifted n)

Defined in Data.Array.Comfort.Shape

Associated Types

type Index (Shifted n)

Methods

indices :: Shifted n -> [Index (Shifted n)]

offset :: Shifted n -> Index (Shifted n) -> Int

uncheckedOffset :: Shifted n -> Index (Shifted n) -> Int

unifiedOffset :: Checking check => Shifted n -> Index (Shifted n) -> Result check Int

inBounds :: Shifted n -> Index (Shifted n) -> Bool

sizeOffset :: Shifted n -> (Int, Index (Shifted n) -> Int)

uncheckedSizeOffset :: Shifted n -> (Int, Index (Shifted n) -> Int)

unifiedSizeOffset :: Checking check => Shifted n -> (Int, Index (Shifted n) -> Result check Int)

Integral n => InvIndexed (Shifted n)

Defined in Data.Array.Comfort.Shape

Methods

indexFromOffset :: Shifted n -> Int -> Index (Shifted n)

uncheckedIndexFromOffset :: Shifted n -> Int -> Index (Shifted n)

unifiedIndexFromOffset :: Checking check => Shifted n -> Int -> Result check (Index (Shifted n))

NFData n => NFData (Shifted n)

Defined in Data.Array.Comfort.Shape

Methods

rnf :: Shifted n -> ()

Eq n => Eq (Shifted n)

Defined in Data.Array.Comfort.Shape

Methods

(==) :: Shifted n -> Shifted n -> Bool

(/=) :: Shifted n -> Shifted n -> Bool

(Integral n, ToSize n, Comparison n) => C (Shifted n)

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (Shifted n) -> T (Shifted n) -> CodeGenFunction r (T (Shifted n))

size :: T (Shifted n) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (Shifted n) ~ ix => T (Shifted n) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (Shifted n) ~ ix => T (Shifted n) -> T r (T ix)

loop :: (Index (Shifted n) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (Shifted n) -> state -> CodeGenFunction r state

C n => C (Shifted n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Repr (Shifted n)

Methods

cons :: Shifted n -> T (Shifted n)

undef :: T (Shifted n)

zero :: T (Shifted n)

phi :: BasicBlock -> T (Shifted n) -> CodeGenFunction r (T (Shifted n))

addPhi :: BasicBlock -> T (Shifted n) -> T (Shifted n) -> CodeGenFunction r ()

Compose n => Compose (Shifted n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Composed (Shifted n)

Methods

compose :: Shifted n -> T (Composed (Shifted n))

Decompose pn => Decompose (Shifted pn)

Defined in Data.Array.Knead.Shape.Orphan

Methods

decompose :: Shifted pn -> T (PatternTuple (Shifted pn)) -> Decomposed T (Shifted pn)

Value n => Value (Shifted n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type ValueOf (Shifted n)

Methods

valueOf :: Shifted n -> ValueOf (Shifted n)

Undefined n => Undefined (Shifted n)

Defined in Data.Array.Knead.Shape.Orphan

Methods

undef :: Shifted n

type Decomposed f (Shifted pn)

Defined in Data.Array.Knead.Shape.Orphan

type Decomposed f (Shifted pn) = Shifted (Decomposed f pn)

type Index (Shifted n)

Defined in Data.Array.Comfort.Shape

type Index (Shifted n) = n

type Composed (Shifted n)

Defined in Data.Array.Knead.Shape.Orphan

type Composed (Shifted n) = Shifted (Composed n)

type PatternTuple (Shifted pn)

Defined in Data.Array.Knead.Shape.Orphan

type PatternTuple (Shifted pn) = Shifted (PatternTuple pn)

type Repr (Shifted n)

Defined in Data.Array.Knead.Shape.Orphan

type Repr (Shifted n) = Shifted (Repr n)

type ValueOf (Shifted n)

Defined in Data.Array.Knead.Shape.Orphan

type ValueOf (Shifted n) = Shifted (ValueOf n)

shifted :: Value val => val n -> val n -> val (Shifted n)

shiftedOffset :: Value val => val (Shifted n) -> val n

shiftedSize :: Value val => val (Shifted n) -> val n

newtype Cyclic n

Cyclic is a shape, where the indices wrap around at the array boundaries. E.g.

let shape = Shape.Cyclic (10::Int) in Shape.offset shape (-1) == Shape.offset shape 9

This also means that there are multiple indices that address the same array element.

>>> Shape.indices (Shape.Cyclic (7::Int))
[0,1,2,3,4,5,6]

Constructors

Cyclic n

Instances

Applicative Cyclic

Defined in Data.Array.Comfort.Shape

Methods

pure :: a -> Cyclic a

(<*>) :: Cyclic (a -> b) -> Cyclic a -> Cyclic b

liftA2 :: (a -> b -> c) -> Cyclic a -> Cyclic b -> Cyclic c

(*>) :: Cyclic a -> Cyclic b -> Cyclic b

(<*) :: Cyclic a -> Cyclic b -> Cyclic a

Functor Cyclic

Defined in Data.Array.Comfort.Shape

Methods

fmap :: (a -> b) -> Cyclic a -> Cyclic b

(<$) :: a -> Cyclic b -> Cyclic a

Storable n => Storable (Cyclic n)

Defined in Data.Array.Comfort.Shape

Methods

sizeOf :: Cyclic n -> Int

alignment :: Cyclic n -> Int

peekElemOff :: Ptr (Cyclic n) -> Int -> IO (Cyclic n)

pokeElemOff :: Ptr (Cyclic n) -> Int -> Cyclic n -> IO ()

peekByteOff :: Ptr b -> Int -> IO (Cyclic n)

pokeByteOff :: Ptr b -> Int -> Cyclic n -> IO ()

peek :: Ptr (Cyclic n) -> IO (Cyclic n)

poke :: Ptr (Cyclic n) -> Cyclic n -> IO ()

Show n => Show (Cyclic n)

Defined in Data.Array.Comfort.Shape

Methods

showsPrec :: Int -> Cyclic n -> ShowS

show :: Cyclic n -> String

showList :: [Cyclic n] -> ShowS

Integral n => C (Cyclic n)

Defined in Data.Array.Comfort.Shape

Methods

size :: Cyclic n -> Int

Integral n => Indexed (Cyclic n)

Defined in Data.Array.Comfort.Shape

Associated Types

type Index (Cyclic n)

Methods

indices :: Cyclic n -> [Index (Cyclic n)]

offset :: Cyclic n -> Index (Cyclic n) -> Int

uncheckedOffset :: Cyclic n -> Index (Cyclic n) -> Int

unifiedOffset :: Checking check => Cyclic n -> Index (Cyclic n) -> Result check Int

inBounds :: Cyclic n -> Index (Cyclic n) -> Bool

sizeOffset :: Cyclic n -> (Int, Index (Cyclic n) -> Int)

uncheckedSizeOffset :: Cyclic n -> (Int, Index (Cyclic n) -> Int)

unifiedSizeOffset :: Checking check => Cyclic n -> (Int, Index (Cyclic n) -> Result check Int)

Integral n => InvIndexed (Cyclic n)

Defined in Data.Array.Comfort.Shape

Methods

indexFromOffset :: Cyclic n -> Int -> Index (Cyclic n)

uncheckedIndexFromOffset :: Cyclic n -> Int -> Index (Cyclic n)

unifiedIndexFromOffset :: Checking check => Cyclic n -> Int -> Result check (Index (Cyclic n))

NFData n => NFData (Cyclic n)

Defined in Data.Array.Comfort.Shape

Methods

rnf :: Cyclic n -> ()

Eq n => Eq (Cyclic n)

Defined in Data.Array.Comfort.Shape

Methods

(==) :: Cyclic n -> Cyclic n -> Bool

(/=) :: Cyclic n -> Cyclic n -> Bool

(Integral n, ToSize n, Comparison n) => C (Cyclic n)

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (Cyclic n) -> T (Cyclic n) -> CodeGenFunction r (T (Cyclic n))

size :: T (Cyclic n) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (Cyclic n) ~ ix => T (Cyclic n) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (Cyclic n) ~ ix => T (Cyclic n) -> T r (T ix)

loop :: (Index (Cyclic n) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (Cyclic n) -> state -> CodeGenFunction r state

Compose n => Compose (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Composed (Cyclic n)

Methods

compose :: Cyclic n -> Exp (Composed (Cyclic n))

Decompose pn => Decompose (Cyclic pn)

Defined in Data.Array.Knead.Shape.Orphan

Methods

decompose :: Cyclic pn -> Exp (PatternTuple (Cyclic pn)) -> Decomposed Exp (Cyclic pn)

C n => C (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Struct (Cyclic n)

Methods

load :: Value (Ptr (Struct (Cyclic n))) -> CodeGenFunction r (Cyclic n)

store :: Cyclic n -> Value (Ptr (Struct (Cyclic n))) -> CodeGenFunction r ()

decompose :: Value (Struct (Cyclic n)) -> CodeGenFunction r (Cyclic n)

compose :: Cyclic n -> CodeGenFunction r (Value (Struct (Cyclic n)))

C n => C (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

Methods

pack :: Cyclic n -> Struct (Cyclic n)

unpack :: Struct (Cyclic n) -> Cyclic n

C n => C (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Repr (Cyclic n)

Methods

cons :: Cyclic n -> T (Cyclic n)

undef :: T (Cyclic n)

zero :: T (Cyclic n)

phi :: BasicBlock -> T (Cyclic n) -> CodeGenFunction r (T (Cyclic n))

addPhi :: BasicBlock -> T (Cyclic n) -> T (Cyclic n) -> CodeGenFunction r ()

Compose n => Compose (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Composed (Cyclic n)

Methods

compose :: Cyclic n -> T (Composed (Cyclic n))

Decompose pn => Decompose (Cyclic pn)

Defined in Data.Array.Knead.Shape.Orphan

Methods

decompose :: Cyclic pn -> T (PatternTuple (Cyclic pn)) -> Decomposed T (Cyclic pn)

Value n => Value (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type ValueOf (Cyclic n)

Methods

valueOf :: Cyclic n -> ValueOf (Cyclic n)

Phi n => Phi (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

Methods

phi :: BasicBlock -> Cyclic n -> CodeGenFunction r (Cyclic n)

addPhi :: BasicBlock -> Cyclic n -> Cyclic n -> CodeGenFunction r ()

Undefined n => Undefined (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

Methods

undef :: Cyclic n

type Decomposed f (Cyclic pn)

Defined in Data.Array.Knead.Shape.Orphan

type Decomposed f (Cyclic pn) = Cyclic (Decomposed f pn)

type Index (Cyclic n)

Defined in Data.Array.Comfort.Shape

type Index (Cyclic n) = n

type Composed (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

type Composed (Cyclic n) = Cyclic (Composed n)

type Struct (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

type Struct (Cyclic n) = Struct n

type Composed (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

type Composed (Cyclic n) = Cyclic (Composed n)

type PatternTuple (Cyclic pn)

Defined in Data.Array.Knead.Shape.Orphan

type PatternTuple (Cyclic pn) = Cyclic (PatternTuple pn)

type Repr (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

type Repr (Cyclic n) = Cyclic (Repr n)

type ValueOf (Cyclic n)

Defined in Data.Array.Knead.Shape.Orphan

type ValueOf (Cyclic n) = Cyclic (ValueOf n)

cyclic :: Value val => val n -> val (Cyclic n)

cyclicSize :: Value val => val (Cyclic n) -> val n

data Enumeration n

Enumeration denotes a shape of fixed size that is defined by Enum and Bounded methods. For correctness it is necessary that the Enum and Bounded instances are properly implemented. Automatically derived instances are fine.

>>> Shape.indices (Shape.Enumeration :: Shape.Enumeration Ordering)
[LT,EQ,GT]

Constructors

Enumeration

Instances

Storable (Enumeration n)

Defined in Data.Array.Comfort.Shape

Methods

sizeOf :: Enumeration n -> Int

alignment :: Enumeration n -> Int

peekElemOff :: Ptr (Enumeration n) -> Int -> IO (Enumeration n)

pokeElemOff :: Ptr (Enumeration n) -> Int -> Enumeration n -> IO ()

peekByteOff :: Ptr b -> Int -> IO (Enumeration n)

pokeByteOff :: Ptr b -> Int -> Enumeration n -> IO ()

peek :: Ptr (Enumeration n) -> IO (Enumeration n)

poke :: Ptr (Enumeration n) -> Enumeration n -> IO ()

Show (Enumeration n)

Defined in Data.Array.Comfort.Shape

Methods

showsPrec :: Int -> Enumeration n -> ShowS

show :: Enumeration n -> String

showList :: [Enumeration n] -> ShowS

(Enum n, Bounded n) => C (Enumeration n)

Defined in Data.Array.Comfort.Shape

Methods

size :: Enumeration n -> Int

(Enum n, Bounded n) => Indexed (Enumeration n)

Defined in Data.Array.Comfort.Shape

Associated Types

type Index (Enumeration n)

Methods

indices :: Enumeration n -> [Index (Enumeration n)]

offset :: Enumeration n -> Index (Enumeration n) -> Int

uncheckedOffset :: Enumeration n -> Index (Enumeration n) -> Int

unifiedOffset :: Checking check => Enumeration n -> Index (Enumeration n) -> Result check Int

inBounds :: Enumeration n -> Index (Enumeration n) -> Bool

sizeOffset :: Enumeration n -> (Int, Index (Enumeration n) -> Int)

uncheckedSizeOffset :: Enumeration n -> (Int, Index (Enumeration n) -> Int)

unifiedSizeOffset :: Checking check => Enumeration n -> (Int, Index (Enumeration n) -> Result check Int)

(Enum n, Bounded n) => InvIndexed (Enumeration n)

Defined in Data.Array.Comfort.Shape

Methods

indexFromOffset :: Enumeration n -> Int -> Index (Enumeration n)

uncheckedIndexFromOffset :: Enumeration n -> Int -> Index (Enumeration n)

unifiedIndexFromOffset :: Checking check => Enumeration n -> Int -> Result check (Index (Enumeration n))

(Enum n, Bounded n) => Static (Enumeration n)

Defined in Data.Array.Comfort.Shape

Methods

static :: Enumeration n

NFData (Enumeration n)

Defined in Data.Array.Comfort.Shape

Methods

rnf :: Enumeration n -> ()

Eq (Enumeration n)

Defined in Data.Array.Comfort.Shape

Methods

(==) :: Enumeration n -> Enumeration n -> Bool

(/=) :: Enumeration n -> Enumeration n -> Bool

(Enum enum, Bounded enum, EnumBounded enum) => C (Enumeration enum)

Defined in Data.Array.Knead.Shape

Methods

intersectCode :: T (Enumeration enum) -> T (Enumeration enum) -> CodeGenFunction r (T (Enumeration enum))

size :: T (Enumeration enum) -> CodeGenFunction r (Value Size)

sizeOffset :: Index (Enumeration enum) ~ ix => T (Enumeration enum) -> CodeGenFunction r (Value Size, T ix -> CodeGenFunction r (Value Size))

iterator :: Index (Enumeration enum) ~ ix => T (Enumeration enum) -> T r (T ix)

loop :: (Index (Enumeration enum) ~ ix, Phi state) => (T ix -> state -> CodeGenFunction r state) -> T (Enumeration enum) -> state -> CodeGenFunction r state

(Enum enum, Bounded enum) => Compose (Enumeration enum)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Composed (Enumeration enum)

Methods

compose :: Enumeration enum -> Exp (Composed (Enumeration enum))

Decompose (Enumeration enum)

Defined in Data.Array.Knead.Shape.Orphan

Methods

decompose :: Enumeration enum -> Exp (PatternTuple (Enumeration enum)) -> Decomposed Exp (Enumeration enum)

(Enum enum, Bounded enum) => C (Enumeration enum)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Repr (Enumeration enum)

Methods

cons :: Enumeration enum -> T (Enumeration enum)

undef :: T (Enumeration enum)

zero :: T (Enumeration enum)

phi :: BasicBlock -> T (Enumeration enum) -> CodeGenFunction r (T (Enumeration enum))

addPhi :: BasicBlock -> T (Enumeration enum) -> T (Enumeration enum) -> CodeGenFunction r ()

(Enum enum, Bounded enum) => Compose (Enumeration enum)

Defined in Data.Array.Knead.Shape.Orphan

Associated Types

type Composed (Enumeration enum)

Methods

compose :: Enumeration enum -> T (Composed (Enumeration enum))

Decompose (Enumeration enum)

Defined in Data.Array.Knead.Shape.Orphan

Methods

decompose :: Enumeration enum -> T (PatternTuple (Enumeration enum)) -> Decomposed T (Enumeration enum)

type Decomposed f (Enumeration enum)

Defined in Data.Array.Knead.Shape.Orphan

type Decomposed f (Enumeration enum) = Enumeration enum

type Index (Enumeration n)

Defined in Data.Array.Comfort.Shape

type Index (Enumeration n) = n

type Composed (Enumeration enum)

Defined in Data.Array.Knead.Shape.Orphan

type Composed (Enumeration enum) = Enumeration enum

type Composed (Enumeration enum)

Defined in Data.Array.Knead.Shape.Orphan

type Composed (Enumeration enum) = Enumeration enum

type PatternTuple (Enumeration enum)

Defined in Data.Array.Knead.Shape.Orphan

type PatternTuple (Enumeration enum) = Enumeration enum

type Repr (Enumeration enum)

Defined in Data.Array.Knead.Shape.Orphan

type Repr (Enumeration enum) = ()

class (Enum enum, Bounded enum) => EnumBounded enum where

Methods

enumOffset :: T enum -> CodeGenFunction r (Value Size)

Instances

(ToSize w, Additive w, IsInteger w, IntegerConstant w, Num w, Repr w ~ Value w, CmpRet w, IsPrimitive w, Enum e, Bounded e) => EnumBounded (T w e)

Defined in Data.Array.Knead.Shape

Methods

enumOffset :: T0 (T w e) -> CodeGenFunction r (Value Size)

class C sh => Scalar sh where

Methods

scalar :: Value val => val sh

zeroIndex :: Value val => f sh -> val (Index sh)

Instances

Scalar ()

Defined in Data.Array.Knead.Shape

Methods

scalar :: Value val => val ()

zeroIndex :: Value val => f () -> val (Index ())

(tag ~ ShapeTag, rank ~ Zero) => Scalar (T tag rank)

Defined in Data.Array.Knead.Shape.Cubic

Methods

scalar :: Value val => val (T tag rank)

zeroIndex :: Value val => f (T tag rank) -> val (Index (T tag rank))

class (C sh, IntegerConstant (Index sh), Additive (Index sh)) => Sequence sh where

Methods

sequenceShapeFromIndex :: T (Index sh) -> CodeGenFunction r (T sh)

Instances

(Integral n, ToSize n, Comparison n) => Sequence (ZeroBased n)

Defined in Data.Array.Knead.Shape

Methods

sequenceShapeFromIndex :: T (Index (ZeroBased n)) -> CodeGenFunction r (T (ZeroBased n))