interface IndexedFunctor : (x : Type) -> (y : Type) -> (Type -> x -> y -> Type) -> Type An Indexed Functor.
This interface is indexed backwards of similar utlities in Haskell
to make it more readily compatible with the evolution of a type from
Indexed simply on values (or types) but also on functions that depend on
those values.
An indexed functor where the mappable type comes last does not later
refactor into what this library calls a TransitionIndexed type as readily.
Parameters: x, y, f
Methods:
map : (a -> b) -> f a j k -> f b j k
Implementation: IndexedApplicative z f -> IndexedFunctor z z f
map : IndexedFunctor x y f => (a -> b) -> f a j k -> f b j k- Visibility: public export
(<<$>>) : IndexedFunctor x y f => (a -> b) -> f a j k -> f b j k Map for indexed functors.
Visibility: public export
Fixity Declaration: infixr operator, level 4(<<&>>) : IndexedFunctor x y f => f a j k -> (a -> b) -> f b j k Flipped version of `<<$>>`
Visibility: public export
Fixity Declaration: infixl operator, level 1(<<$) : IndexedFunctor x y f => b -> f a j k -> f b j k Run something for effects, replacing the return value afterwards.
Visibility: public export
Fixity Declaration: infixr operator, level 4($>>) : IndexedFunctor x y f => f a j k -> b -> f b j k Flipped version of `<<$`
Visibility: public export
Fixity Declaration: infixr operator, level 4ignore : IndexedFunctor x y f => f a j k -> f () j k Run something for effects, throwing away the return value.
Visibility: public export