Module Eager_deferred

module type S = sig ... end
include 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 -> unit
include Core.Monad with type 'a t := 'a Async_kernel.Deferred.t
val return : 'a 'i 'p 'q. 'a -> 'a Async_kernel.Deferred.t

Convert 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.t

Transforms 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.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 x
  • t >>= return is equivalent to t
  • (t >>= f) >>= g is equivalent to t >>= fun x -> f x >>= g

Combines 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.t

Ignores 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.t

Combines a list of t.

val all_unit : 'i 'p 'q. unit Async_kernel.Deferred.t list -> unit Async_kernel.Deferred.t

Combines 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.t

Infix bind.

val (>>|) : 'a 'b 'i 'j 'p 'q. 'a Async_kernel.Deferred.t -> ('a -> 'b) -> 'b Async_kernel.Deferred.t

Infix map.

module Monad_infix : sig ... end
module Let_syntax : sig ... end
module Infix : sig ... end
val any_unit : unit Async_kernel.Deferred.t list -> unit Async_kernel.Deferred.t
val create : ('a Async_kernel.Ivar.t -> unit) -> 'a Async_kernel.Deferred.t
val don't_wait_for : unit Async_kernel.Deferred.t -> unit
val is_determined : 'a Async_kernel.Deferred.t -> bool
val never : unit -> _ Async_kernel.Deferred.t
val peek : 'a Async_kernel.Deferred.t -> 'a option
val unit : unit Async_kernel.Deferred.t
val upon : 'a Async_kernel.Deferred.t -> ('a -> unit) -> unit
val value_exn : 'a Async_kernel.Deferred.t -> 'a
val repeat_until_finished : 'state -> ('state -> [ `Repeat of 'state | `Finished of 'result ] Async_kernel.Deferred.t) -> 'result Async_kernel.Deferred.t
module Array : Async_kernel.Monad_sequence.S with type 'a monad := 'a Async_kernel.Deferred.t with type 'a t := 'a array
module Iarray : Async_kernel.Monad_sequence.S with type 'a monad := 'a Async_kernel.Deferred.t with type 'a t := 'a iarray
module List : sig ... end
module Queue : Async_kernel.Monad_sequence.S with type 'a monad := 'a Async_kernel.Deferred.t with type 'a t := 'a Core.Queue.t

Similar 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 ... end
module Result : sig ... end
module Use : sig ... end

Intended usage is to open Eager_deferred.Use to shadow operations from the non-eager world and rebind them to their eager counterparts.