struct
(* precedence, skel1, skel2, term *)
type t = int * NCic.term * NCic.term * NCic.term
- let compare = Pervasives.compare
+ let compare = Stdlib.compare
end
module EOT : Set.OrderedType
with type t = int * NCic.term =
struct
type t = int * NCic.term
- let compare = Pervasives.compare
+ let compare = Stdlib.compare
end
module HintSet = Set.Make(HOT)
method uhint_db = db
method set_uhint_db v = {< db = v >}
method set_unifhint_status
- : 'status. #g_status as 'status -> 'self
+ : 'status. (#g_status as 'status) -> 'self
= fun o -> {< db = o#uhint_db >}
end
rc
in
let rc =
- List.sort (fun (x,_,_,_) (y,_,_,_) -> Pervasives.compare x y) rc
+ List.sort (fun (x,_,_,_) (y,_,_,_) -> Stdlib.compare x y) rc
in
let rc = List.map (fun (_,x,y,z) -> x,y,z) rc in
edges := (mangle l, mangle r, shint, precedence, hint) :: !edges)
(HintSet.elements dataset);
);
- List.iter (fun x, l -> Pp.node x ~attrs:["label",l] fmt) !nodes;
- List.iter (fun x, y, _l, _, _ ->
+ List.iter (fun (x, l) -> Pp.node x ~attrs:["label",l] fmt) !nodes;
+ List.iter (fun (x, y, _l, _, _) ->
Pp.raw (Printf.sprintf "%s -- %s [ label=\"%s\" ];\n" x y "?") fmt)
!edges;
edges := List.sort (fun (_,_,_,p1,_) (_,_,_,p2,_) -> p1 - p2) !edges;
- List.iter (fun _x, _y, _, p, l -> pp_hint l p) !edges;
+ List.iter (fun (_x, _y, _, p, l) -> pp_hint l p) !edges;
;;