package spotlib

  1. Overview
  2. Docs
include module type of struct include Lazy end
type 'a t = 'a CamlinternalLazy.t

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. Matching a suspension with the special pattern syntax lazy(pattern) also computes the underlying expression and tries to bind it to pattern:

let lazy_option_map f x =
match x with
| lazy (Some x) -> Some (Lazy.force f x)
| _ -> None

Note: If lazy patterns appear in multiple cases in a pattern-matching, lazy expressions may be forced even outside of the case ultimately selected by the pattern matching. In the example above, the suspension x is always computed.

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.

exception Undefined
val force : 'a t -> 'a

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.

  • raises Undefined

    if the forcing of x tries to force x itself recursively.

Iterators

val map : ('a -> 'b) -> 'a t -> 'b t

map f x returns a suspension that, when forced, forces x and applies f to its value.

It is equivalent to lazy (f (Lazy.force x)).

  • since 4.13.0

Reasoning on already-forced suspensions

val map_val : ('a -> 'b) -> 'a t -> 'b t

map_val f x applies f directly if x is already forced, otherwise it behaves as map f x.

When x is already forced, this behavior saves the construction of a suspension, but on the other hand it performs more work eagerly that may not be useful if you never force the function result.

If f raises an exception, it will be raised immediately when is_val x, or raised only when forcing the thunk otherwise.

If map_val f x does not raise an exception, then is_val (map_val f x) is equal to is_val x.

  • since 4.13.0

Advanced

The following definitions are for advanced uses only; they require familiary with the lazy compilation scheme to be used appropriately.

val from_fun : (unit -> 'a) -> 'a t

from_fun f is the same as lazy (f ()) but slightly more efficient.

It 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.

  • since 4.00.0
val force_val : 'a t -> 'a

force_val x forces the suspension x and returns its result. If x has already been forced, force_val x returns the same value again without recomputing it.

If the computation of x raises an exception, it is unspecified whether force_val x raises the same exception or Undefined.

  • raises Undefined

    if the forcing of x tries to force x itself recursively.

Deprecated

val lazy_from_fun : (unit -> 'a) -> 'a t
  • deprecated

    synonym for from_fun.

val lazy_from_val : 'a -> 'a t
  • deprecated

    synonym for from_val.

val lazy_is_val : 'a t -> bool
  • deprecated

    synonym for is_val.

include module type of struct include Xlazy end
include Monad.T with type 'a t := 'a Lazy.t
val return : 'a -> 'a Lazy.t
val bind : 'a Lazy.t -> ('a -> 'b Lazy.t) -> 'b Lazy.t
val fmap : ('a -> 'b) -> 'a Lazy.t -> 'b Lazy.t

fmap in Haskell

val liftM : ('a -> 'b) -> 'a Lazy.t -> 'b Lazy.t

synonym of fmap

val fmap2 : ('a -> 'b -> 'c) -> 'a Lazy.t -> 'b Lazy.t -> 'c Lazy.t

fmap2 in Haskell

val liftM2 : ('a -> 'b -> 'c) -> 'a Lazy.t -> 'b Lazy.t -> 'c Lazy.t

synonym of fmap2

val void : 'a Lazy.t -> unit Lazy.t
val seq : 'a Lazy.t list -> 'a list Lazy.t

sequence in Haskell. Not tail recursive.

val seq_ : unit Lazy.t list -> unit Lazy.t

sequence_ in Haskell. Not tail recursive.

val mapM : ('a -> 'b Lazy.t) -> 'a list -> 'b list Lazy.t

Not tail recursive by default

val mapM_ : ('a -> unit Lazy.t) -> 'a list -> unit Lazy.t

Not tail recursive by default

val iteri : (int -> 'a -> unit Lazy.t) -> 'a list -> unit Lazy.t

Iteration with index starting from 0. Not tail recursive by default

val for_ : int -> int -> (int -> unit Lazy.t) -> unit Lazy.t

for like iteration. Not tail recursive by default

val join : 'a Lazy.t Lazy.t -> 'a Lazy.t
val (!!) : 'a Lazy.t -> 'a

Same as Lazy.force

val eager : 'a -> 'a Lazy.t
val from_val : 'a -> 'a Lazy.t
val peek : 'a Lazy.t -> 'a option
val is_val : 'a Lazy.t -> bool
val detuple : ('a * 'b) Lazy.t -> 'a Lazy.t * 'b Lazy.t
OCaml

Innovation. Community. Security.