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
41
42
43
44
45
46
47
48
49
|
(* TEST
setup-ocamlc.byte-build-env;
module = "stack_space.ml";
ocamlc.byte;
program = "./test.byte.exe";
all_modules = "stack_space.cmo";
module = "";
ocamlc.byte;
ocamlrunparam += ",l=300";
run;
*)
(* large with respect to the stack-size=300 setting above *)
let large = 30000
let init n f =
let[@tail_mod_cons] rec init_aux i n f =
if i = n then []
else f i :: init_aux (i + 1) n f
in init_aux 0 n f
module ListMap = struct
let[@tail_mod_cons] rec map f = function
| [] -> []
| x :: xs ->
(* Note: tail-mod-cons guarantees that 'map f xs' is evaluated last *)
f x :: map f xs
let _ =
init large Fun.id
|> map succ
end
module TreeMap = struct
type 'a tree =
| Leaf of 'a
| Node of 'a tree * 'a tree
let[@tail_mod_cons] rec map f = function
| Leaf v -> Leaf (f v)
| Node (left, right) ->
Node (map f left, (map [@tailcall]) f right)
let _ =
init large Fun.id
|> List.fold_left (fun t n -> Node (Leaf n, t)) (Leaf (-1))
(* large right-leaning tree *)
|> map succ
end
|
