14
14
15
15
module FunctionArgs = struct
16
16
type arg = {label : string ; functionName : FunctionName .t }
17
-
18
17
type t = arg list
19
18
20
19
let empty = []
21
-
22
20
let argToString {label; functionName} = label ^ " :" ^ functionName
23
21
24
22
let toString functionArgs =
@@ -82,17 +80,11 @@ module FunctionCallSet = Set.Make (FunctionCall)
82
80
83
81
module Stats = struct
84
82
let nCacheChecks = ref 0
85
-
86
83
let nCacheHits = ref 0
87
-
88
84
let nFiles = ref 0
89
-
90
85
let nFunctions = ref 0
91
-
92
86
let nHygieneErrors = ref 0
93
-
94
87
let nInfiniteLoops = ref 0
95
-
96
88
let nRecursiveBlocks = ref 0
97
89
98
90
let print ppf () =
@@ -107,7 +99,6 @@ module Stats = struct
107
99
Format. fprintf ppf " @]"
108
100
109
101
let dump ~ppf = Format. fprintf ppf " %a@." print ()
110
-
111
102
let newFile () = incr nFiles
112
103
113
104
let newRecursiveFunctions ~numFunctions =
@@ -246,7 +237,6 @@ module Trace = struct
246
237
| _ -> Tseq [t1; t2]
247
238
248
239
let some = Toption Rsome
249
-
250
240
let none = Toption Rnone
251
241
252
242
let retOptionToString r =
@@ -273,21 +263,15 @@ module Values : sig
273
263
type t
274
264
275
265
val getNone : t -> Progress .t option
276
-
277
266
val getSome : t -> Progress .t option
278
-
279
267
val nd : t -> t -> t
280
-
281
268
val none : progress :Progress .t -> t
282
-
283
269
val some : progress :Progress .t -> t
284
-
285
270
val toString : t -> string
286
271
end = struct
287
272
type t = {none : Progress .t option ; some : Progress .t option }
288
273
289
274
let getNone {none} = none
290
-
291
275
let getSome {some} = some
292
276
293
277
let toString x =
@@ -299,7 +283,6 @@ end = struct
299
283
|> String. concat " , "
300
284
301
285
let none ~progress = {none = Some progress; some = None }
302
-
303
286
let some ~progress = {none = None ; some = Some progress}
304
287
305
288
let nd (v1 : t ) (v2 : t ) : t =
384
367
385
368
module Command = struct
386
369
type progress = Progress .t
387
-
388
370
type retOption = Trace .retOption
389
371
390
372
type t =
450
432
451
433
module Kind = struct
452
434
type t = entry list
453
-
454
435
and entry = {label : string ; k : t }
455
436
456
437
let empty = ([] : t )
@@ -502,7 +483,6 @@ module FunctionTable = struct
502
483
Format. fprintf ppf " @]"
503
484
504
485
let dump tbl = Format. fprintf Format. std_formatter " %a@." print tbl
505
-
506
486
let initialFunctionDefinition () = {kind = Kind. empty; body = None }
507
487
508
488
let getFunctionDefinition ~functionName (tbl : t ) =
@@ -1034,7 +1014,6 @@ end
1034
1014
1035
1015
module CallStack = struct
1036
1016
type frame = {frameNumber : int ; pos : Lexing .position }
1037
-
1038
1017
type t = {tbl : (FunctionCall .t , frame ) Hashtbl .t ; mutable size : int }
1039
1018
1040
1019
let create () = {tbl = Hashtbl. create 1 ; size = 0 }
@@ -1072,7 +1051,6 @@ end
1072
1051
1073
1052
module Eval = struct
1074
1053
type progress = Progress .t
1075
-
1076
1054
type cache = (FunctionCall .t , State .t ) Hashtbl .t
1077
1055
1078
1056
let createCache () : cache = Hashtbl. create 1
0 commit comments