forked from ocaml/opam
/
type_Parallel.html
151 lines (151 loc) · 32 KB
/
type_Parallel.html
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
<html><head>
<link rel="stylesheet" href="style.css" type="text/css">
<meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type">
<link rel="Start" href="index.html">
<link title="Index of types" rel=Appendix href="index_types.html">
<link title="Index of exceptions" rel=Appendix href="index_exceptions.html">
<link title="Index of values" rel=Appendix href="index_values.html">
<link title="Index of modules" rel=Appendix href="index_modules.html">
<link title="Index of module types" rel=Appendix href="index_module_types.html">
<link title="Client" rel="Chapter" href="Client.html">
<link title="File" rel="Chapter" href="File.html">
<link title="File_format" rel="Chapter" href="File_format.html">
<link title="Parallel" rel="Chapter" href="Parallel.html">
<link title="Parser" rel="Chapter" href="Parser.html">
<link title="Path" rel="Chapter" href="Path.html">
<link title="Process" rel="Chapter" href="Process.html">
<link title="Repositories" rel="Chapter" href="Repositories.html">
<link title="Run" rel="Chapter" href="Run.html">
<link title="Solver" rel="Chapter" href="Solver.html">
<link title="Types" rel="Chapter" href="Types.html"><title>Parallel</title>
</head>
<body>
<code class="code"><span class="keyword">sig</span><br>
<span class="keyword">module</span> <span class="keyword">type</span> <span class="constructor">G</span> =<br>
<span class="keyword">sig</span><br>
<span class="keyword">type</span> t<br>
<span class="keyword">module</span> <span class="constructor">V</span> : <span class="constructor">Graph</span>.<span class="constructor">Sig</span>.<span class="constructor">VERTEX</span><br>
<span class="keyword">type</span> vertex = <span class="constructor">V</span>.t<br>
<span class="keyword">module</span> <span class="constructor">E</span> :<br>
<span class="keyword">sig</span><br>
<span class="keyword">type</span> t<br>
<span class="keyword">val</span> compare : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br>
<span class="keyword">type</span> vertex = vertex<br>
<span class="keyword">val</span> src : t <span class="keywordsign">-></span> vertex<br>
<span class="keyword">val</span> dst : t <span class="keywordsign">-></span> vertex<br>
<span class="keyword">type</span> label<br>
<span class="keyword">val</span> create : vertex <span class="keywordsign">-></span> label <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> label : t <span class="keywordsign">-></span> label<br>
<span class="keyword">end</span><br>
<span class="keyword">type</span> edge = <span class="constructor">E</span>.t<br>
<span class="keyword">val</span> is_directed : bool<br>
<span class="keyword">val</span> is_empty : t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> nb_vertex : t <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> nb_edges : t <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> out_degree : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> mem_vertex : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> mem_edge : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> mem_edge_e : t <span class="keywordsign">-></span> edge <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> find_edge : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> edge<br>
<span class="keyword">val</span> find_all_edges : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> edge list<br>
<span class="keyword">val</span> succ : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> vertex list<br>
<span class="keyword">val</span> pred : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> vertex list<br>
<span class="keyword">val</span> succ_e : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> edge list<br>
<span class="keyword">val</span> pred_e : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> edge list<br>
<span class="keyword">val</span> fold_vertex : (vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> iter_edges : (vertex <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold_edges : (vertex <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> iter_edges_e : (edge <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold_edges_e : (edge <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> map_vertex : (vertex <span class="keywordsign">-></span> vertex) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> iter_pred : (vertex <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold_succ : (vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> fold_pred : (vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> iter_succ_e : (edge <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold_succ_e : (edge <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> iter_pred_e : (edge <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold_pred_e : (edge <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> iter_vertex : (<span class="constructor">V</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> iter_succ : (<span class="constructor">V</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> <span class="constructor">V</span>.t <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> in_degree : t <span class="keywordsign">-></span> <span class="constructor">V</span>.t <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> string_of_vertex : <span class="constructor">V</span>.t <span class="keywordsign">-></span> string<br>
<span class="keyword">end</span><br>
<span class="keyword">module</span> <span class="keyword">type</span> <span class="constructor">SIG</span> =<br>
<span class="keyword">sig</span><br>
<span class="keyword">module</span> <span class="constructor">G</span> : <span class="constructor">G</span><br>
<span class="keyword">val</span> iter :<br>
int <span class="keywordsign">-></span><br>
<span class="constructor">Parallel</span>.<span class="constructor">G</span>.t <span class="keywordsign">-></span><br>
pre:(<span class="constructor">G</span>.<span class="constructor">V</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span><br>
child:(<span class="constructor">G</span>.<span class="constructor">V</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> post:(<span class="constructor">G</span>.<span class="constructor">V</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> unit<br>
<span class="keyword">exception</span> <span class="constructor">Errors</span> <span class="keyword">of</span> <span class="constructor">G</span>.<span class="constructor">V</span>.t list<br>
<span class="keyword">end</span><br>
<span class="keyword">module</span> <span class="constructor">Make</span> :<br>
<span class="keyword">functor</span> (<span class="constructor">G</span> : <span class="constructor">G</span>) <span class="keywordsign">-></span><br>
<span class="keyword">sig</span><br>
<span class="keyword">module</span> <span class="constructor">G</span> :<br>
<span class="keyword">sig</span><br>
<span class="keyword">type</span> t = <span class="constructor">G</span>.t<br>
<span class="keyword">module</span> <span class="constructor">V</span> :<br>
<span class="keyword">sig</span><br>
<span class="keyword">type</span> t = <span class="constructor">G</span>.<span class="constructor">V</span>.t<br>
<span class="keyword">val</span> compare : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> hash : t <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> equal : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br>
<span class="keyword">type</span> label = <span class="constructor">G</span>.<span class="constructor">V</span>.label<br>
<span class="keyword">val</span> create : label <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> label : t <span class="keywordsign">-></span> label<br>
<span class="keyword">end</span><br>
<span class="keyword">type</span> vertex = <span class="constructor">V</span>.t<br>
<span class="keyword">module</span> <span class="constructor">E</span> :<br>
<span class="keyword">sig</span><br>
<span class="keyword">type</span> t = <span class="constructor">G</span>.<span class="constructor">E</span>.t<br>
<span class="keyword">val</span> compare : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> int<br>
<span class="keyword">type</span> vertex = vertex<br>
<span class="keyword">val</span> src : t <span class="keywordsign">-></span> vertex<br>
<span class="keyword">val</span> dst : t <span class="keywordsign">-></span> vertex<br>
<span class="keyword">type</span> label = <span class="constructor">G</span>.<span class="constructor">E</span>.label<br>
<span class="keyword">val</span> create : vertex <span class="keywordsign">-></span> label <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> label : t <span class="keywordsign">-></span> label<br>
<span class="keyword">end</span><br>
<span class="keyword">type</span> edge = <span class="constructor">E</span>.t<br>
<span class="keyword">val</span> is_directed : bool<br>
<span class="keyword">val</span> is_empty : t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> nb_vertex : t <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> nb_edges : t <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> out_degree : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> mem_vertex : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> mem_edge : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> mem_edge_e : t <span class="keywordsign">-></span> edge <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> find_edge : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> edge<br>
<span class="keyword">val</span> find_all_edges : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> edge list<br>
<span class="keyword">val</span> succ : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> vertex list<br>
<span class="keyword">val</span> pred : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> vertex list<br>
<span class="keyword">val</span> succ_e : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> edge list<br>
<span class="keyword">val</span> pred_e : t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> edge list<br>
<span class="keyword">val</span> fold_vertex : (vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> iter_edges : (vertex <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold_edges : (vertex <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> iter_edges_e : (edge <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold_edges_e : (edge <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> map_vertex : (vertex <span class="keywordsign">-></span> vertex) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> iter_pred : (vertex <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold_succ : (vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> fold_pred : (vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> iter_succ_e : (edge <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold_succ_e : (edge <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> iter_pred_e : (edge <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold_pred_e : (edge <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> vertex <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> iter_vertex : (<span class="constructor">V</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> iter_succ : (<span class="constructor">V</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> <span class="constructor">V</span>.t <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> in_degree : t <span class="keywordsign">-></span> <span class="constructor">V</span>.t <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> string_of_vertex : <span class="constructor">V</span>.t <span class="keywordsign">-></span> string<br>
<span class="keyword">end</span><br>
<span class="keyword">val</span> iter :<br>
int <span class="keywordsign">-></span><br>
<span class="constructor">G</span>.t <span class="keywordsign">-></span><br>
pre:(<span class="constructor">G</span>.<span class="constructor">V</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span><br>
child:(<span class="constructor">G</span>.<span class="constructor">V</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> post:(<span class="constructor">G</span>.<span class="constructor">V</span>.t <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> unit<br>
<span class="keyword">exception</span> <span class="constructor">Errors</span> <span class="keyword">of</span> <span class="constructor">G</span>.<span class="constructor">V</span>.t list<br>
<span class="keyword">end</span><br>
<span class="keyword">end</span></code></body></html>