module type S = Eager_deferred__Eager_deferred_intf.Sinclude S with type 'a t := 'a Async_kernel.Deferred.t
include Async_kernel.Invariant.S1 with type 'a t := 'a Async_kernel.Deferred.t
val invariant : ('a -> unit) -> 'a Async_kernel.Deferred.t -> unitinclude Core_kernel.Monad with type 'a t := 'a Async_kernel.Deferred.t
val (>>=) : 'a Async_kernel.Deferred.t -> ('a -> 'a Async_kernel.Deferred.t) -> 'a Async_kernel.Deferred.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.
val (>>|) : 'a Async_kernel.Deferred.t -> ('a -> 'b) -> 'a Async_kernel.Deferred.tt >>| f is t >>= (fun a -> return (f a)).
module Monad_infix : sig ... endval bind : 'a Async_kernel.Deferred.t -> f:('a -> 'a Async_kernel.Deferred.t) -> 'a Async_kernel.Deferred.tbind t ~f = t >>= f
val return : 'a -> 'a Async_kernel.Deferred.treturn v returns the (trivial) computation that returns v.
val map : 'a Async_kernel.Deferred.t -> f:('a -> 'b) -> 'a Async_kernel.Deferred.tmap t ~f is t >>| f.
val join : 'a Async_kernel.Deferred.t -> 'a Async_kernel.Deferred.tjoin t is t >>= (fun t' -> t').
val ignore_m : 'a Async_kernel.Deferred.t -> 'a Async_kernel.Deferred.tignore_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.
val all : 'a Async_kernel.Deferred.t list -> 'a Async_kernel.Deferred.tval all_unit : 'a Async_kernel.Deferred.t list -> 'a Async_kernel.Deferred.tLike 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 ... endmodule Infix : sig ... endval any : 'a Async_kernel.Deferred.t list -> 'a Async_kernel.Deferred.tval any_unit : 'a Async_kernel.Deferred.t list -> 'a Async_kernel.Deferred.tval both : 'a Async_kernel.Deferred.t -> 'a Async_kernel.Deferred.t -> 'a Async_kernel.Deferred.tval create : ('a Async_kernel.Ivar.t -> unit) -> 'a Async_kernel.Deferred.tval don't_wait_for : 'a Async_kernel.Deferred.t -> unitval ignore : 'a Async_kernel.Deferred.t -> 'a Async_kernel.Deferred.tval is_determined : 'a Async_kernel.Deferred.t -> boolval never : unit -> 'a Async_kernel.Deferred.tval ok : 'a Async_kernel.Deferred.t -> 'a Async_kernel.Deferred.tval peek : 'a Async_kernel.Deferred.t -> 'a optionval unit : 'a Async_kernel.Deferred.tval upon : 'a Async_kernel.Deferred.t -> ('a -> unit) -> unitval value_exn : 'a Async_kernel.Deferred.t -> 'aval repeat_until_finished : 'state -> ('state -> 'a Async_kernel.Deferred.t) -> 'a Async_kernel.Deferred.tmodule List : Async_kernel.Monad_sequence.S with type 'a monad := 'a Async_kernel.Deferred.t with type 'a t := 'a listmodule Or_error : sig ... endmodule Use : sig ... endIntended usage is to open Eager_deferred.Use to shadow operations from the non-eager world and rebind them to their eager counterparts.