Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell98 |
Documentation
paramWith :: (Natural rank, Natural (FromUnary rank), Natural (FromUnary rank :*: SizeOf Size)) => T p (T tag rank) -> (forall parameters. C parameters => (p -> parameters) -> (forall val. Value val => T parameters -> val (T tag rank)) -> a) -> a Source #
tunnel :: (Natural rank, Natural (FromUnary rank), Natural (FromUnary rank :*: SizeOf Size)) => T p (T tag rank) -> Tunnel p (T tag rank) Source #
Instances
Natural rank => Storable (T tag rank) Source # | |
Defined in Data.Array.Knead.Shape.Cubic | |
(tag ~ ShapeTag, Natural rank) => C (T tag rank) Source # | |
Defined in Data.Array.Knead.Shape.Cubic | |
(tag ~ ShapeTag, Natural rank) => Indexed (T tag rank) Source # | |
Defined in Data.Array.Knead.Shape.Cubic indices :: T tag rank -> [Index (T tag rank)] # offset :: T tag rank -> Index (T tag rank) -> Int # uncheckedOffset :: T tag rank -> Index (T tag rank) -> Int # unifiedOffset :: Checking check => T tag rank -> Index (T tag rank) -> Result check Int # inBounds :: T tag rank -> Index (T tag rank) -> Bool # sizeOffset :: T tag rank -> (Int, Index (T tag rank) -> Int) # uncheckedSizeOffset :: T tag rank -> (Int, Index (T tag rank) -> Int) # unifiedSizeOffset :: Checking check => T tag rank -> (Int, Index (T tag rank) -> Result check Int) # | |
(tag ~ ShapeTag, Natural rank) => C (T tag rank) Source # | |
Defined in Data.Array.Knead.Shape.Cubic intersectCode :: T0 (T tag rank) -> T0 (T tag rank) -> CodeGenFunction r (T0 (T tag rank)) Source # size :: T0 (T tag rank) -> CodeGenFunction r (Value Size) Source # sizeOffset :: Index (T tag rank) ~ ix => T0 (T tag rank) -> CodeGenFunction r (Value Size, T0 ix -> CodeGenFunction r (Value Size)) Source # iterator :: Index (T tag rank) ~ ix => T0 (T tag rank) -> T1 r (T0 ix) Source # loop :: (Index (T tag rank) ~ ix, Phi state) => (T0 ix -> state -> CodeGenFunction r state) -> T0 (T tag rank) -> state -> CodeGenFunction r state Source # | |
(tag ~ ShapeTag, rank ~ Zero) => Scalar (T tag rank) Source # | |
(Natural rank, Natural (FromUnary rank), Natural (FromUnary rank :*: SizeOf Size)) => C (T tag rank) Source # | |
Natural rank => C (T tag rank) Source # | |
Defined in Data.Array.Knead.Shape.Cubic | |
type Index (T tag rank) Source # | |
Defined in Data.Array.Knead.Shape.Cubic | |
type Repr (T tag rank) Source # | |
data tail :. head infixl 3 Source #
!tail :. !head infixl 3 |
Instances
(Read tail, Read head) => Read (tail :. head) Source # | |
(Show tail, Show head) => Show (tail :. head) Source # | |
(Eq tail, Eq head) => Eq (tail :. head) Source # | |
(Ord tail, Ord head) => Ord (tail :. head) Source # | |
Defined in Data.Array.Knead.Shape.Cubic compare :: (tail :. head) -> (tail :. head) -> Ordering # (<) :: (tail :. head) -> (tail :. head) -> Bool # (<=) :: (tail :. head) -> (tail :. head) -> Bool # (>) :: (tail :. head) -> (tail :. head) -> Bool # (>=) :: (tail :. head) -> (tail :. head) -> Bool # | |
(Compose sh, Composed sh ~ T (Tag (Composed sh)) (Rank (Composed sh)), Compose s, Composed s ~ Int) => Compose (sh :. s) Source # | |
(Decompose sh, Decompose s, Decomposed Exp s ~ Exp Int, PatternTuple s ~ Int, PatternTuple sh ~ T (AtomTag sh) (AtomRank sh), Natural (AtomRank sh)) => Decompose (sh :. s) Source # | |
Defined in Data.Array.Knead.Shape.Cubic decompose :: (sh :. s) -> Exp (PatternTuple (sh :. s)) -> Decomposed Exp (sh :. s) # | |
type Decomposed f (sh :. s) Source # | |
Defined in Data.Array.Knead.Shape.Cubic | |
type Composed (sh :. s) Source # | |
Defined in Data.Array.Knead.Shape.Cubic | |
type PatternTuple (sh :. s) Source # | |
Defined in Data.Array.Knead.Shape.Cubic |