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
|
(* Co-installability tools
* http://coinst.irill.org/
* Copyright (C) 2010-2011 Jérôme Vouillon
* Laboratoire PPS - CNRS Université Paris Diderot
*
* These programs are free software; you can redistribute them and/or
* modify them under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of the
* License, or (at your option) any later version.
*
* 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*)
module type S = sig
type pool
module Package : sig
type t
val compare : t -> t -> int
val print : pool -> Format.formatter -> t -> unit
val print_name : pool -> Format.formatter -> t -> unit
val index : t -> int
val of_index : int -> t
val of_index_list : int list -> t list
end
module PSet : Ptset.SET_SIG with type elt = Package.t
module PMap : Map.S with type key = Package.t
val pset_indices : PSet.t -> Util.IntSet.t
module PTbl : sig
type 'a t
val create : pool -> 'a -> 'a t
val init : pool -> (Package.t -> 'a) -> 'a t
val get : 'a t -> Package.t -> 'a
val set : 'a t -> Package.t -> 'a -> unit
val iteri : (Package.t -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (Package.t -> 'a -> 'b) -> 'a t -> 'b t
val copy : 'a t -> 'a t
end
module type DISJ = sig
type t
val print : ?compact:bool -> pool -> Format.formatter -> t -> unit
val implies : t -> t -> bool
val equiv : t -> t -> bool
val lit : Package.t -> t
val lit_disj : Package.t list -> t
val _false : t
val disj : t -> t -> t
end
module Disj : sig
include DISJ
val iter : t -> (Package.t -> unit) -> unit
val fold : (Package.t -> 'a -> 'a) -> t -> 'a -> 'a
val cut : t -> Package.t -> t -> t
val for_all : (Package.t -> bool) -> t -> bool
val exists : (Package.t -> bool) -> t -> bool
val filter : (Package.t -> bool) -> t -> t
val compare : t -> t -> int
val implies1 : Package.t -> t -> bool
val to_lit : t -> Package.t option
val to_lits : t -> PSet.t
val of_lits : PSet.t -> t
val diff : t -> t -> t
val disj1 : Package.t -> t -> t
val cardinal : t -> int
module Set : Set.S with type elt = t
end
module Formula : sig
include DISJ
val _true : t
val conj : t -> t -> t
val conjl : t list -> t
val implies1 : t -> Disj.t -> bool
val iter : t -> (Disj.t -> unit) -> unit
val of_disj : Disj.t -> t
val fold : (Disj.t -> 'a -> 'a) -> t -> 'a -> 'a
val filter : (Disj.t -> bool) -> t -> t
val exists : (Disj.t -> bool) -> t -> bool
val normalize : t -> t
end
type dependencies = Formula.t PTbl.t
module Conflict : sig
type t
val create : pool -> t
val check : t -> Package.t -> Package.t -> bool (*XXX rename in [mem]*)
val add : t -> Package.t -> Package.t -> unit
val remove : t -> Package.t -> Package.t -> unit
val iter : t -> (Package.t -> Package.t -> unit) -> unit
val copy : t -> t
val has : t -> Package.t -> bool
val of_package : t -> Package.t -> PSet.t
val iter_on_packages : t -> (Package.t -> PSet.t -> unit) -> unit
val exists : t -> (Package.t -> bool) -> Package.t -> bool
val for_all : t -> (Package.t -> bool) -> Package.t -> bool
end
end
module F : functor (M : Api.S) -> S with type pool = M.pool
|
