t is an appendable type for defining nonempty_getter accessors. See the documentation of Accessor.nonempty_getter for more information.
include Base.Monad.S with type 'a t := 'a tt >>= f returns a computation that sequences the computations represented by two monad elements. The resulting computation first does t to yield a value v, and then runs the computation returned by f v.
module Monad_infix : sig ... endval return : 'a -> 'a treturn v returns the (trivial) computation that returns v.
ignore_m t is map t ~f:(fun _ -> ()). ignore_m used to be called ignore, but we decided that was a bad name, because it shadowed the widely used Caml.ignore. Some monads still do let ignore = ignore_m for historical reasons.
Like all, but ensures that every monadic value in the list produces a unit value, all of which are discarded rather than being collected into a list.
module Let_syntax : sig ... endThese are convenient to have in scope when programming with a monad:
val access : 'a -> 'a taccess a "accesses" a.
append a b accesses everything a accesses, then accesses everything b accesses.
module O : sig ... endval map_reduce : 'a t -> combine:('r -> 'r -> 'r) -> f:('a -> 'r) -> 'rval of_nonempty : (_, 'a, _) Nonempty.t -> 'a tmodule Make_access (T : sig ... end) : sig ... endmodule Make_access3 (T : sig ... end) : sig ... endmodule Make_access4 (T : sig ... end) : sig ... end