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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
open! Base
(* this no longer allocates closures. hurray! *)
module T0 = struct
type 'a t = 'a list [@@deriving_inline hash]
let _ = fun (_ : 'a t) -> ()
let hash_fold_t :
'a.
(Ppx_hash_lib.Std.Hash.state -> 'a -> Ppx_hash_lib.Std.Hash.state)
-> Ppx_hash_lib.Std.Hash.state
-> 'a t
-> Ppx_hash_lib.Std.Hash.state
=
hash_fold_list
;;
let _ = hash_fold_t
[@@@deriving.end]
end
module T1 = struct
type 'a t = 'a option list [@@deriving_inline hash]
let _ = fun (_ : 'a t) -> ()
let hash_fold_t :
'a.
(Ppx_hash_lib.Std.Hash.state -> 'a -> Ppx_hash_lib.Std.Hash.state)
-> Ppx_hash_lib.Std.Hash.state
-> 'a t
-> Ppx_hash_lib.Std.Hash.state
=
fun _hash_fold_a hsv arg ->
hash_fold_list (fun hsv arg -> hash_fold_option _hash_fold_a hsv arg) hsv arg
;;
let _ = hash_fold_t
[@@@deriving.end]
end
module T2 = struct
type 'a t = ('a * 'a) list [@@deriving_inline hash]
let _ = fun (_ : 'a t) -> ()
let hash_fold_t :
'a.
(Ppx_hash_lib.Std.Hash.state -> 'a -> Ppx_hash_lib.Std.Hash.state)
-> Ppx_hash_lib.Std.Hash.state
-> 'a t
-> Ppx_hash_lib.Std.Hash.state
=
fun _hash_fold_a hsv arg ->
hash_fold_list
(fun hsv arg ->
let e0, e1 = arg in
let hsv = _hash_fold_a hsv e0 in
let hsv = _hash_fold_a hsv e1 in
hsv)
hsv
arg
;;
let _ = hash_fold_t
[@@@deriving.end]
end
module T3 = struct
type 'a t =
| Leaf
| Node of 'a t list
[@@deriving_inline hash]
let _ = fun (_ : 'a t) -> ()
let rec hash_fold_t
: type a.
(Ppx_hash_lib.Std.Hash.state -> a -> Ppx_hash_lib.Std.Hash.state)
-> Ppx_hash_lib.Std.Hash.state
-> a t
-> Ppx_hash_lib.Std.Hash.state
=
fun _hash_fold_a hsv arg ->
match arg with
| Leaf -> Ppx_hash_lib.Std.Hash.fold_int hsv 0
| Node _a0 ->
let hsv = Ppx_hash_lib.Std.Hash.fold_int hsv 1 in
let hsv = hsv in
hash_fold_list (fun hsv arg -> hash_fold_t _hash_fold_a hsv arg) hsv _a0
;;
let _ = hash_fold_t
[@@@deriving.end]
let hash_fold_t_no_closure_allocation
: type a.
(Ppx_hash_lib.Std.Hash.state -> a -> Ppx_hash_lib.Std.Hash.state)
-> Ppx_hash_lib.Std.Hash.state
-> a t
-> Ppx_hash_lib.Std.Hash.state
=
fun _hash_fold_a ->
let rec hash_fold_t_of_a hsv arg =
match arg with
| Leaf -> Ppx_hash_lib.Std.Hash.fold_int hsv 0
| Node _a0 ->
hash_fold_list hash_fold_t_of_a (Ppx_hash_lib.Std.Hash.fold_int hsv 1) _a0
in
hash_fold_t_of_a
;;
end
module T4 = struct
type 'a t =
| Leaf
| Node of ('a * 'a) t list
[@@deriving_inline hash]
let _ = fun (_ : 'a t) -> ()
let rec hash_fold_t
: type a.
(Ppx_hash_lib.Std.Hash.state -> a -> Ppx_hash_lib.Std.Hash.state)
-> Ppx_hash_lib.Std.Hash.state
-> a t
-> Ppx_hash_lib.Std.Hash.state
=
fun _hash_fold_a hsv arg ->
match arg with
| Leaf -> Ppx_hash_lib.Std.Hash.fold_int hsv 0
| Node _a0 ->
let hsv = Ppx_hash_lib.Std.Hash.fold_int hsv 1 in
let hsv = hsv in
hash_fold_list
(fun hsv arg ->
hash_fold_t
(fun hsv arg ->
let e0, e1 = arg in
let hsv = _hash_fold_a hsv e0 in
let hsv = _hash_fold_a hsv e1 in
hsv)
hsv
arg)
hsv
_a0
;;
let _ = hash_fold_t
[@@@deriving.end]
let rec hash_fold_t_lazy_closure_allocation
: type a.
(Ppx_hash_lib.Std.Hash.state -> a -> Ppx_hash_lib.Std.Hash.state)
-> Ppx_hash_lib.Std.Hash.state
-> a t
-> Ppx_hash_lib.Std.Hash.state
=
fun _hash_fold_a ->
let hash_fold_t_of_tuple =
lazy
(hash_fold_t_lazy_closure_allocation (fun hsv arg ->
let e0, e1 = arg in
_hash_fold_a (_hash_fold_a hsv e0) e1))
in
fun hsv arg ->
match arg with
| Leaf -> Ppx_hash_lib.Std.Hash.fold_int hsv 0
| Node _a0 ->
hash_fold_list
(Lazy.force hash_fold_t_of_tuple)
(Ppx_hash_lib.Std.Hash.fold_int hsv 1)
_a0
;;
end
|
