blob: 2fdf14ea77b0891c045c0ad139858fccfc931d45 (
plain)
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
|
(***********************************************************************)
(* *)
(* OCaml *)
(* *)
(* Gabriel Scherer, projet Gallium, INRIA Rocquencourt *)
(* *)
(* Copyright 2012 Institut National de Recherche en Informatique et *)
(* en Automatique. All rights reserved. This file is distributed *)
(* under the terms of the Q Public License version 1.0. *)
(* *)
(***********************************************************************)
(* testing backreferences; some compilation scheme may handle
differently recursive references to a mutually-recursive RHS
depending on whether it is before or after in the bindings list *)
type t = { x : t; y : t; z : t }
let test =
let rec x = { x; y; z }
and y = { x; y; z }
and z = { x; y; z }
in
List.iter (fun (f, t_ref) ->
List.iter (fun t -> assert (f t == t_ref)) [x; y; z]
)
[
(fun t -> t.x), x;
(fun t -> t.y), y;
(fun t -> t.z), z;
]
|
