Use.Deferredtype nonrec 'a t = 'a Async_kernel.Deferred.tval sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'a t -> Sexplib0.Sexp.tinclude Async_kernel.Invariant.S1 with type 'a t := 'a tval invariant : ('a -> unit) -> 'a t -> unitinclude Core.Monad with type 'a t := 'a tval return : 'a 'i 'p 'q. 'a -> 'a tConvert a value to a t.
Sequences computations. bind t ~f computes f v for value(s) v in t. Well-behaved monads satisfy these "laws" (where ( >>= ) is the infix bind operator):
map t ~f is equivalent to bind t ~f:(fun x -> return (f x))return x >>= f is equivalent to f xt >>= return is equivalent to t(t >>= f) >>= g is equivalent to t >>= fun x -> f x >>= gCombines nested t into just one layer. Equivalent to bind t ~f:Fn.id.
Ignores contained values of t. Equivalent to map t ~f:ignore.
module Monad_infix : sig ... endmodule Let_syntax : sig ... endmodule 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.Result.t tval peek : 'a t -> 'a optionval unit : unit tval upon : 'a t -> ('a -> unit) -> unitval value_exn : 'a t -> 'amodule Array :
Async_kernel.Monad_sequence.S
with type 'a monad := 'a t
with type 'a t := 'a arraymodule Iarray :
Async_kernel.Monad_sequence.S
with type 'a monad := 'a t
with type 'a t := 'a iarraymodule List : sig ... endmodule Queue :
Async_kernel.Monad_sequence.S
with type 'a monad := 'a t
with type 'a t := 'a Core.Queue.tSimilar to {Deferred.Queue} but eager when passing ~how:`Sequential. The functions in Queue raise if the queue is mutated during execution.
module Or_error : sig ... endmodule Memo : Async_kernel.Deferred.Memo.S with type 'a deferred := 'a tmodule Result : sig ... end