Contents
A Divisible contravariant functor is the contravariant analogue of Applicative.
Continuing the intuition that 'Contravariant' functors (Cofunctor) consume input, a 'Divisible'
contravariant functor also has the ability to be composed "beside" another contravariant
functor.
Parameters
| type | F | Self referring type |
Methods
method K<F, A> lose <F, A> (Func<A, Void> f) Source #
Acts as identity to 'Choose'.
method K<F, Void> lost <F> () Source #
Acts as identity to 'Choose'.
lost = lose(identity)
A Divisible contravariant functor is the contravariant analogue of Applicative.
Continuing the intuition that 'Contravariant' functors (Cofunctor) consume input, a 'Divisible'
contravariant functor also has the ability to be composed "beside" another contravariant
functor.
Parameters
| type | F | Self referring type |
interface Decidable <F> Source #
A Decidable contravariant functor is the contravariant analogue of Alternative.
Noting the superclass constraint that f must also be Divisible, a Decidable functor has the ability to
"fan out" input, under the intuition that contravariant functors consume input.
Parameters
| type | F | Self referring type |