The unpac monorepo manager self-hosting as a monorepo using unpac
Boris' monomorphisation
+19
-71
+1
-1
dgraph/dGraphModel.ml
+1
-1
dgraph/dGraphModel.ml
···
133
133
type t = XDot.edge_layout
134
134
let default = XDot.mk_edge_layout
135
135
~draw:[] ~ldraw:[] ~hdraw:[] ~tdraw:[] ~hldraw:[] ~tldraw:[]
136
-
let compare = compare
136
+
let compare : t -> t -> int = Pervasives.compare
137
137
end
138
138
139
139
module DotG = Imperative.Digraph.AbstractLabeled(Vertex)(Edge)
+1
-1
dgraph/dGraphRandModel.ml
+1
-1
dgraph/dGraphRandModel.ml
+1
-1
dgraph/xDot.ml
+1
-1
dgraph/xDot.ml
+1
-1
editor/ed_graph.ml
+1
-1
editor/ed_graph.ml
-20
editor/tests/test2,1_2.gml~
-20
editor/tests/test2,1_2.gml~
···
1
-
graph [
2
-
comment "This is a sample graph"
3
-
directed 1
4
-
id 42
5
-
label "Hello, I am a graph"
6
-
node [ id 1 label "Node 1" ]
7
-
node [ id 2 label "node 2" ]
8
-
node [ id 3 label "node 3" ]
9
-
node [ id 4 label "node 4" ]
10
-
node [ id 5 label "node 5" ]
11
-
node [ id 6 label "node 6" ]
12
-
edge [ source 1 target 2 ]
13
-
edge [ source 1 target 3 ]
14
-
edge [ source 1 target 4 ]
15
-
edge [ source 1 target 5 ]
16
-
edge [ source 1 target 6 ]
17
-
edge [ source 2 target 3 ]
18
-
edge [ source 4 target 6]
19
-
20
-
]
-22
editor/tests/test2,1_3.gml~
-22
editor/tests/test2,1_3.gml~
···
1
-
graph [
2
-
comment "This is a sample graph"
3
-
directed 1
4
-
id 42
5
-
label "Hello, I am a graph"
6
-
node [ id 1 label "Node 1" ]
7
-
node [ id 2 label "node 2" ]
8
-
node [ id 3 label "node 3" ]
9
-
node [ id 4 label "node 4" ]
10
-
node [ id 5 label "node 5" ]
11
-
node [ id 6 label "node 6" ]
12
-
node [ id 7 label "node 7" ]
13
-
edge [ source 1 target 2 ]
14
-
edge [ source 1 target 3 ]
15
-
edge [ source 1 target 4 ]
16
-
edge [ source 1 target 5 ]
17
-
edge [ source 1 target 6 ]
18
-
edge [ source 1 target 7 ]
19
-
edge [ source 2 target 4 ]
20
-
edge [ source 5 target 6]
21
-
22
-
]
-15
editor/tests/test2_2.gml~
-15
editor/tests/test2_2.gml~
···
1
-
graph [
2
-
comment "This is a sample graph"
3
-
directed 1
4
-
id 42
5
-
label "Hello, I am a graph"
6
-
node [ id 1 label "Node 1" ]
7
-
node [ id 2 label "node 2" ]
8
-
node [ id 3 label "node 3" ]
9
-
node [ id 4 label "node 4" ]
10
-
node [ id 5 label "node 5" ]
11
-
edge [ source 1 target 2 ]
12
-
edge [ source 1 target 3 ]
13
-
edge [ source 1 target 4 ]
14
-
edge [ source 1 target 5 ]
15
-
]
+3
-3
src/cliquetree.ml
+3
-3
src/cliquetree.ml
···
107
107
(struct
108
108
type t = int
109
109
type label = int
110
-
let compare x y = Pervasives.compare x y
110
+
let compare : t -> t -> int = Pervasives.compare
111
111
let hash = Hashtbl.hash
112
112
let equal x y = x = y
113
113
let label x = x
···
117
117
module CliqueTreeE = struct
118
118
type t = int * CVS.t
119
119
120
-
let compare (x, _) (y, _) = Pervasives.compare x y
120
+
let compare (x, _ : t) (y, _ : t) = Pervasives.compare x y
121
121
122
122
let default = (0, CVS.empty)
123
123
···
168
168
List.sort
169
169
(fun x y ->
170
170
(*let markx = mark x and marky = mark y in*)
171
-
- Pervasives.compare (number x) (number y))
171
+
(Pervasives.compare : int -> int -> int) (number y) (number x))
172
172
l
173
173
174
174
let mcs_clique g =
+6
-1
src/dot.ml
+6
-1
src/dot.ml
···
54
54
struct
55
55
56
56
module Attr = struct
57
-
module M = Map.Make(struct type t = id let compare = compare end)
57
+
module M =
58
+
Map.Make
59
+
(struct
60
+
type t = id
61
+
let compare : t -> t -> int = Pervasives.compare
62
+
end)
58
63
type t = id option M.t
59
64
let empty = M.empty
60
65
let add = List.fold_left (fun a (x,v) -> M.add x v a)
+2
-2
src/imperative.ml
+2
-2
src/imperative.ml
···
368
368
module V = struct
369
369
type t = int
370
370
type label = int
371
-
let compare = Pervasives.compare
371
+
let compare : t -> t -> int = Pervasives.compare
372
372
let hash = Hashtbl.hash
373
373
let equal = (==)
374
374
let create i = i
···
378
378
module E = struct
379
379
type t = V.t * V.t
380
380
type vertex = V.t
381
-
let compare = Pervasives.compare
381
+
let compare : t -> t -> int = Pervasives.compare
382
382
type label = unit
383
383
let create v1 _ v2 = (v1, v2)
384
384
let src = fst
+4
-4
src/pack.ml
+4
-4
src/pack.ml
···
48
48
let weight x = x
49
49
let zero = 0
50
50
let add = (+)
51
-
let compare = compare
51
+
let compare : t -> t -> int = Pervasives.compare
52
52
end
53
53
54
54
include Path.Dijkstra(G)(W)
···
61
61
let flow _ = 0
62
62
let add = (+)
63
63
let sub = (-)
64
-
let compare = compare
64
+
let compare : t -> t -> int = Pervasives.compare
65
65
let max = max_int
66
66
let min = 0
67
67
let zero = 0
···
86
86
87
87
module Int = struct
88
88
type t = int
89
-
let compare = Pervasives.compare
89
+
let compare : t -> t -> int = Pervasives.compare
90
90
end
91
91
92
92
include Kruskal.Make(G)(Int)
···
167
167
168
168
module I = struct
169
169
type t = int
170
-
let compare = compare
170
+
let compare : t -> t -> int = Pervasives.compare
171
171
let hash = Hashtbl.hash
172
172
let equal = (=)
173
173
let default = 0