forked from ocaml/opam
-
Notifications
You must be signed in to change notification settings - Fork 4
/
type_Types.NV.html
99 lines (99 loc) · 18.9 KB
/
type_Types.NV.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
<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>Types.NV</title>
</head>
<body>
<code class="code"><span class="keyword">sig</span><br>
<span class="keyword">type</span> t<br>
<span class="keyword">val</span> of_string : string <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> to_string : t <span class="keywordsign">-></span> string<br>
<span class="keyword">module</span> <span class="constructor">Set</span> :<br>
<span class="keyword">sig</span><br>
<span class="keyword">type</span> elt = t<br>
<span class="keyword">type</span> t<br>
<span class="keyword">val</span> empty : t<br>
<span class="keyword">val</span> is_empty : t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> mem : elt <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> add : elt <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> singleton : elt <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> remove : elt <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> union : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> inter : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> diff : t <span class="keywordsign">-></span> t <span class="keywordsign">-></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> equal : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> subset : t <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> iter : (elt <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold : (elt <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> for_all : (elt <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> exists : (elt <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> filter : (elt <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> partition : (elt <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t * t<br>
<span class="keyword">val</span> cardinal : t <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> elements : t <span class="keywordsign">-></span> elt list<br>
<span class="keyword">val</span> min_elt : t <span class="keywordsign">-></span> elt<br>
<span class="keyword">val</span> max_elt : t <span class="keywordsign">-></span> elt<br>
<span class="keyword">val</span> choose : t <span class="keywordsign">-></span> elt<br>
<span class="keyword">val</span> split : elt <span class="keywordsign">-></span> t <span class="keywordsign">-></span> t * bool * t<br>
<span class="keyword">val</span> choose_one : t <span class="keywordsign">-></span> elt<br>
<span class="keyword">val</span> of_list : elt list <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> to_string : t <span class="keywordsign">-></span> string<br>
<span class="keyword">end</span><br>
<span class="keyword">module</span> <span class="constructor">Map</span> :<br>
<span class="keyword">sig</span><br>
<span class="keyword">type</span> key = t<br>
<span class="keyword">type</span> +<span class="keywordsign">'</span>a t<br>
<span class="keyword">val</span> empty : <span class="keywordsign">'</span>a t<br>
<span class="keyword">val</span> is_empty : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> mem : key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> add : key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br>
<span class="keyword">val</span> singleton : key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br>
<span class="keyword">val</span> remove : key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br>
<span class="keyword">val</span> merge :<br>
(key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a option <span class="keywordsign">-></span> <span class="keywordsign">'</span>b option <span class="keywordsign">-></span> <span class="keywordsign">'</span>c option) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t <span class="keywordsign">-></span> <span class="keywordsign">'</span>c t<br>
<span class="keyword">val</span> compare : (<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> int) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> equal : (<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> iter : (key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> unit) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> unit<br>
<span class="keyword">val</span> fold : (key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>b <span class="keywordsign">-></span> <span class="keywordsign">'</span>b<br>
<span class="keyword">val</span> for_all : (key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> exists : (key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> bool<br>
<span class="keyword">val</span> filter : (key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br>
<span class="keyword">val</span> partition : (key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> bool) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t * <span class="keywordsign">'</span>a t<br>
<span class="keyword">val</span> cardinal : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> int<br>
<span class="keyword">val</span> bindings : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> (key * <span class="keywordsign">'</span>a) list<br>
<span class="keyword">val</span> min_binding : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> key * <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> max_binding : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> key * <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> choose : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> key * <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> split : key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t * <span class="keywordsign">'</span>a option * <span class="keywordsign">'</span>a t<br>
<span class="keyword">val</span> find : key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a<br>
<span class="keyword">val</span> map : (<span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br>
<span class="keyword">val</span> mapi : (key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>b) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>b t<br>
<span class="keyword">val</span> values : <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a list<br>
<span class="keyword">val</span> merge_max : (key <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a <span class="keywordsign">-></span> <span class="keywordsign">'</span>a option) <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t <span class="keywordsign">-></span> <span class="keywordsign">'</span>a t<br>
<span class="keyword">end</span><br>
<span class="keyword">val</span> name : t <span class="keywordsign">-></span> <span class="constructor">Types</span>.name<br>
<span class="keyword">val</span> version : t <span class="keywordsign">-></span> <span class="constructor">Types</span>.version<br>
<span class="keyword">val</span> create : <span class="constructor">Types</span>.name <span class="keywordsign">-></span> <span class="constructor">Types</span>.version <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> of_filename : <span class="constructor">Types</span>.filename <span class="keywordsign">-></span> t option<br>
<span class="keyword">val</span> of_dirname : <span class="constructor">Types</span>.dirname <span class="keywordsign">-></span> t option<br>
<span class="keyword">val</span> of_dpkg : <span class="constructor">Debian</span>.<span class="constructor">Packages</span>.package <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> of_cudf : <span class="constructor">Debian</span>.<span class="constructor">Debcudf</span>.tables <span class="keywordsign">-></span> <span class="constructor">Cudf</span>.package <span class="keywordsign">-></span> t<br>
<span class="keyword">val</span> to_map : <span class="constructor">Set</span>.t <span class="keywordsign">-></span> <span class="constructor">V</span>.<span class="constructor">Set</span>.t <span class="constructor">N</span>.<span class="constructor">Map</span>.t<br>
<span class="keyword">end</span></code></body></html>