Use.Deferredtype nonrec 'a t = 'a Async_kernel.Deferred.tinclude Async_kernel.Invariant.S1 with type 'a t := 'a tval invariant : ('a -> unit) -> 'a t -> unitinclude Core_kernel.Monad 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:
module Infix : sig ... endval create : ('a Async_kernel.Ivar.t -> unit) -> 'a tval don't_wait_for : unit t -> unitval is_determined : 'a t -> boolval never : unit -> _ tval ok : 'a t -> ('a, _) Core_kernel.Result.t tval peek : 'a t -> 'a optionval unit : unit tval upon : 'a t -> ('a -> unit) -> unitval value_exn : 'a t -> 'amodule List :
Async_kernel.Monad_sequence.S
with type 'a monad := 'a t
with type 'a t := 'a listmodule Or_error : sig ... end