1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
open! Import
type 'a t = 'a lazy_t [@@deriving_inline sexp]
let t_of_sexp : 'a. (Ppx_sexp_conv_lib.Sexp.t -> 'a) -> Ppx_sexp_conv_lib.Sexp.t -> 'a t =
lazy_t_of_sexp
;;
let sexp_of_t : 'a. ('a -> Ppx_sexp_conv_lib.Sexp.t) -> 'a t -> Ppx_sexp_conv_lib.Sexp.t =
sexp_of_lazy_t
;;
[@@@end]
include (Caml.Lazy : module type of Caml.Lazy with type 'a t := 'a t)
let map t ~f = lazy (f (force t))
let compare compare_a t1 t2 =
if phys_equal t1 t2 then 0 else compare_a (force t1) (force t2)
;;
let hash_fold_t = Hash.Builtin.hash_fold_lazy_t
include Monad.Make (struct
type nonrec 'a t = 'a t
let return x = from_val x
let bind t ~f = lazy (force (f (force t)))
let map = map
let map = `Custom map
end)
module T_unforcing = struct
type nonrec 'a t = 'a t
let sexp_of_t sexp_of_a t =
if is_val t then sexp_of_a (force t) else sexp_of_string "<unforced lazy>"
;;
end