Eager_deferredmodule type S = sig ... endinclude S with type 'a t := 'a Async_kernel.Deferred.tinclude Async_kernel.Invariant.S1 with type 'a t := 'a Async_kernel.Deferred.tval invariant : ('a -> unit) -> 'a Async_kernel.Deferred.t -> unitinclude Core.Monad with type 'a t := 'a Async_kernel.Deferred.tval return : 'a 'i 'p 'q. 'a -> 'a Async_kernel.Deferred.tConvert a value to a t.
val map :
'a 'b 'i 'j 'p 'q. 'a Async_kernel.Deferred.t ->
f:('a -> 'b) ->
'b Async_kernel.Deferred.tTransforms the contents of a t.
val bind :
'a 'b 'i 'j 'k 'p 'q. 'a Async_kernel.Deferred.t ->
f:('a -> 'b Async_kernel.Deferred.t) ->
'b Async_kernel.Deferred.tSequences 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 >>= gval join :
'a 'i 'j 'k 'p 'q. 'a Async_kernel.Deferred.t Async_kernel.Deferred.t ->
'a Async_kernel.Deferred.tCombines nested t into just one layer. Equivalent to bind t ~f:Fn.id.
val ignore_m :
'a 'i 'j 'p 'q. 'a Async_kernel.Deferred.t ->
unit Async_kernel.Deferred.tIgnores contained values of t. Equivalent to map t ~f:ignore.
val all :
'a 'i 'p 'q. 'a Async_kernel.Deferred.t list ->
'a list Async_kernel.Deferred.tCombines a list of t.
val all_unit :
'i 'p 'q. unit Async_kernel.Deferred.t list ->
unit Async_kernel.Deferred.tCombines a list of t whose contents are unimportant.
val (>>=) :
'a 'b 'i 'j 'k 'p 'q. 'a Async_kernel.Deferred.t ->
('a -> 'b Async_kernel.Deferred.t) ->
'b Async_kernel.Deferred.tInfix bind.
val (>>|) :
'a 'b 'i 'j 'p 'q. 'a Async_kernel.Deferred.t ->
('a -> 'b) ->
'b Async_kernel.Deferred.tInfix map.
module Monad_infix : sig ... endmodule Let_syntax : sig ... endmodule Infix : sig ... endval any : 'a Async_kernel.Deferred.t list -> 'a Async_kernel.Deferred.tval any_unit :
unit Async_kernel.Deferred.t list ->
unit Async_kernel.Deferred.tval both :
'a Async_kernel.Deferred.t ->
'b Async_kernel.Deferred.t ->
('a * 'b) Async_kernel.Deferred.tval create : ('a Async_kernel.Ivar.t -> unit) -> 'a Async_kernel.Deferred.tval don't_wait_for : unit Async_kernel.Deferred.t -> unitval is_determined : 'a Async_kernel.Deferred.t -> boolval never : unit -> _ Async_kernel.Deferred.tval ok :
'a Async_kernel.Deferred.t ->
('a, _) Core.Result.t Async_kernel.Deferred.tval peek : 'a Async_kernel.Deferred.t -> 'a optionval unit : unit 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 ->
[ `Repeat of 'state | `Finished of 'result ] Async_kernel.Deferred.t) ->
'result Async_kernel.Deferred.tmodule Array :
Async_kernel.Monad_sequence.S
with type 'a monad := 'a Async_kernel.Deferred.t
with type 'a t := 'a arraymodule Iarray :
Async_kernel.Monad_sequence.S
with type 'a monad := 'a Async_kernel.Deferred.t
with type 'a t := 'a iarraymodule List : sig ... endmodule Queue :
Async_kernel.Monad_sequence.S
with type 'a monad := 'a Async_kernel.Deferred.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 Async_kernel.Deferred.tmodule Result : 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.