Over_monad_and_alternative.Alternativetype ('a, 'index) t = ('a, 'index) Monad.tThe type held by the Indexed Alternative.
val neutral : ('a, 'index) tThe neutral element of the t.
include Preface_specs.Indexed_applicative.WITH_PURE
with type ('a, 'index) t := ('a, 'index) tinclude Preface_specs.Indexed_applicative.WITH_PURE
with type ('a, 'index) t := ('a, 'index) tinclude Preface_specs.Indexed_apply.WITH_MAP_AND_PRODUCT
with type ('a, 'index) t := ('a, 'index) tinclude Preface_specs.Indexed_functor.WITH_MAP
with type ('a, 'index) t := ('a, 'index) tinclude Preface_specs.Indexed_applicative.WITH_PURE
with type ('a, 'index) t := ('a, 'index) tval pure : 'a -> ('a, 'index) tLift a value from 'a into a new t.
val lift3 :
('a -> 'b -> 'c -> 'd) ->
('a, 'index) t ->
('b, 'index) t ->
('c, 'index) t ->
('d, 'index) tLift a ternary function that acts on arbitrary values into a function that acts t values.
times_nel n x apply combine on x n times. If n is lower than 1 the function will returns None.
val reduce_nel : ('a, 'index) t Preface_core.Nonempty_list.t -> ('a, 'index) tReduce a Nonempty_list.t using combine.
Create a new t, replacing all values of the given functor by given a value of 'a.
Create a new t, replacing all values in the given functor by unit.
times n x apply combine on x n times. If n is lower than 1 the function will returns neutral.
module Infix :
Preface_specs.Indexed_alternative.INFIX
with type ('a, 'index) t := ('a, 'index) tApplicative functor of ('a -> 'b) t over ('a, 'index) t to ('b, 'index) t.
Flipped Applicative functor of ('a -> 'b) t over ('a, 'index) t to ('b, 'index) t.
Discard the value of the first argument.
Discard the value of the second argument.
Infix version of CORE.map.
Flipped and infix version of CORE.map.
Flipped and infix version of OPERATION.replace.
Infix version of CORE.map.
Flipped and infix version of CORE.map.
Flipped and infix version of OPERATION.replace.
module Syntax :
Preface_specs.Indexed_alternative.SYNTAX
with type ('a, 'index) t := ('a, 'index) t