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
|
(**************************************************************************)
(* Copyright © 2009-2013 Stéphane Glondu <steph@glondu.net> *)
(* *)
(* This program is free software: you can redistribute it and/or modify *)
(* it under the terms of the GNU Affero General Public License as *)
(* published by the Free Software Foundation, either version 3 of the *)
(* License, or (at your option) any later version, with the additional *)
(* exemption that compiling, linking, and/or using OpenSSL is allowed. *)
(* *)
(* This program is distributed in the hope that it will be useful, but *)
(* WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *)
(* Affero General Public License for more details. *)
(* *)
(* You should have received a copy of the GNU Affero General Public *)
(* License along with this program. If not, see *)
(* <http://www.gnu.org/licenses/>. *)
(**************************************************************************)
open Types
type source
type binary
type 'a t
module Name : sig
type 'a t
val of_string : string -> 'a t
val to_string : 'a t -> string
end
val get : string -> 'a t -> string
val has : string -> 'a t -> bool
val add : string -> string -> 'a t -> 'a t
val print : Format.formatter -> 'a t -> unit
val filter_print : string list -> Format.formatter -> 'a t -> unit
module Set : sig
type 'a t
val empty : 'a t
val is_empty : 'a t -> bool
val add : 'a Name.t -> 'a t -> 'a t
val remove : 'a Name.t -> 'a t -> 'a t
val from_list : 'a Name.t list -> 'a t
val mem : 'a Name.t -> 'a t -> bool
val exists : ('a Name.t -> bool) -> 'a t -> bool
val iter : ('a Name.t -> unit) -> 'a t -> unit
val cardinal : 'a t -> int
val elements : 'a t -> 'a Name.t list
val fold : ('a Name.t -> 'b -> 'b) -> 'a t -> 'b -> 'b
val filter : ('a Name.t -> bool) -> 'a t -> 'a t
val for_all : ('a Name.t -> bool) -> 'a t -> bool
end
type _ kind = Source : source kind | Binary : binary kind
val of_stanza : 'a kind -> Stanza.t -> 'a t
module Map : sig
type ('a, 'b) t
val empty : ('a, 'b) t
val is_empty : ('a, 'b) t -> bool
val add : 'a Name.t -> 'b -> ('a, 'b) t -> ('a, 'b) t
val remove : 'a Name.t -> ('a, 'b) t -> ('a, 'b) t
val find : 'a Name.t -> ('a, 'b) t -> 'b
val find_opt : 'a Name.t -> ('a, 'b) t -> 'b option
val iter : ('a Name.t -> 'b -> unit) -> ('a, 'b) t -> unit
val mapi : ('a Name.t -> 'b -> 'c) -> ('a, 'b) t -> ('a, 'c) t
val fold : ('a Name.t -> 'b -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'c
val bindings : ('a, 'b) t -> ('a Name.t * 'b) list
val update_default : 'b -> ('b -> 'b) -> 'a Name.t -> ('a, 'b) t -> ('a, 'b) t
val mem : 'a Name.t -> ('a, 'b) t -> bool
end
val build_depends : source t -> binary Name.t list
val binaries : source t -> binary Name.t list
type dependency = {
dep_name : string;
dep_version : (comparison * string) option;
}
val dependencies : string -> 'a t -> dependency list
|
