Product.Fval neutral : 'a tThe neutral element of the Alternative.
include Preface_specs.Applicative.WITH_PURE with type 'a t := 'a tinclude Preface_specs.Applicative.WITH_PURE with type 'a t := 'a tinclude Preface_specs.Apply.WITH_MAP_AND_PRODUCT with type 'a t := 'a tinclude Preface_specs.Functor.WITH_MAP with type 'a t := 'a tinclude Preface_specs.Applicative.WITH_PURE with type 'a t := 'a tval pure : 'a -> 'a tLift a value from 'a into a new 'a t.
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 t Preface_core.Nonempty_list.t -> 'a tReduce a Nonempty_list.t using combine.
Create a new 'a t, replacing all values in the 'b t by given a value of 'a.
times n x apply combine on x n times. If n is lower than 1 the function will returns neutral.
module Infix : Preface_specs.Alternative.INFIX with type 'a t = 'a tinclude Preface_specs.Apply.INFIX with type 'a t := 'a tFlipped Applicative functor of ('a -> 'b) t over 'a t to 'b t.
Infix version of Preface_specs.Functor.CORE.map.
Flipped and infix version of Preface_specs.Functor.CORE.map.
Infix version of Preface_specs.Functor.OPERATION.replace.
Flipped and infix version of Preface_specs.Functor.OPERATION.replace.
module Syntax : Preface_specs.Alternative.SYNTAX with type 'a t = 'a t