This file is a modified version of lazy.mli from the OCaml distribution.
A value of type 'a Lazy.t is a deferred computation, called
a suspension, that has a result of type 'a. The special
expression syntax lazy (expr) makes a suspension of the
computation of expr, without computing expr itself yet.
"Forcing" the suspension will then compute expr and return its
result.
Note: lazy_t is the built-in type constructor used by the compiler
for the lazy keyword. You should not use it directly. Always use
Lazy.t instead.
Note: Lazy.force is not thread-safe. If you use this module in
a multi-threaded program, you will need to add some locks.
Note: if the program is compiled with the -rectypes option,
ill-founded recursive definitions of the form let rec x = lazy x
or let rec x = lazy(lazy(...(lazy x))) are accepted by the type-checker
and lead, when forced, to ill-formed values that trigger infinite
loops in the garbage collector and other parts of the run-time system.
Without the -rectypes option, such ill-founded recursive definitions
are rejected by the type-checker.
include sig ... endval t_of_sexp : (Base__.Sexplib.Sexp.t ‑> 'a) ‑> Base__.Sexplib.Sexp.t ‑> 'a tval sexp_of_t : ('a ‑> Base__.Sexplib.Sexp.t) ‑> 'a t ‑> Base__.Sexplib.Sexp.tval hash_fold_t : (Base__.Ppx_hash_lib.Std.Hash.state ‑> 'a ‑> Base__.Ppx_hash_lib.Std.Hash.state) ‑> Base__.Ppx_hash_lib.Std.Hash.state ‑> 'a t ‑> Base__.Ppx_hash_lib.Std.Hash.stateinclude Monad.S with type a t := a tinclude Base__.Monad_intf.S_without_syntax with type a t := a ttype 'a tA monad is an abstraction of the concept of sequencing of computations. A value of type 'a monad represents a computation that returns a value of type 'a.
include Base__.Monad_intf.Infix with type a t := a tmodule Monad_infix : Base__.Monad_intf.Infix with type a t := a texternal force : 'a t ‑> 'a = "%lazy_force" force x forces the suspension x and returns its result.
If x has already been forced, Lazy.force x returns the
same value again without recomputing it. If it raised an exception,
the same exception is raised again.
Raise Undefined if the forcing of x tries to force x itself
recursively.
val force_val : 'a t ‑> 'aLike force except that force_val x does not use an exception handler, so it may be
more efficient. However, if the computation of x raises an exception, it is
unspecified whether force_val x raises the same exception or Undefined.
val from_fun : (unit ‑> 'a) ‑> 'a tfrom_fun f is the same as lazy (f ()) but slightly more efficient if f is a
variable. from_fun should only be used if the function f is already defined. In
particular it is always less efficient to write from_fun (fun () -> expr) than lazy
expr.
val from_val : 'a ‑> 'a tfrom_val v returns an already-forced suspension of v (where v can be any
expression). Essentially, from_val expr is the same as let var = expr in lazy
var.
val is_val : 'a t ‑> boolis_val x returns true if x has already been forced and
did not raise an exception.
module T_unforcing : sig ... endThis type offers a serialization function sexp_of_t that won't force its argument.
Instead, it will serialize the 'a if it is available, or just use a custom string
indicating is not forced. Note that this is not a round-trippable type, thus the type
does not expose of_sexp. To be used in debug code for example, or while tracking an
Heisenbug, etc.