module Depsolver:Dependency solver. Implementation of the Edos algorithmssig
..end
type
solver
val load : ?check:bool -> Cudf.universe -> solver
check
is true (default), then check
for universe consistency (cf. Cudf_checker.is_consistent)val edos_install : ?global_constraints:bool ->
Cudf.universe -> Cudf.package -> Diagnostic.diagnosis
global_constraints
: : enforce global constraints on the given
universe. In particular packages marked as `Keep_package must be always
installed. Default false.val edos_coinstall : ?global_constraints:bool ->
Cudf.universe -> Cudf.package list -> Diagnostic.diagnosis
global_constraints
: : enforce global constraints on the given
universe. In particular packages marked as `Keep_package must be always
installed. Default false.val edos_coinstall_prod : ?global_constraints:bool ->
Cudf.universe -> Cudf.package list list -> Diagnostic.diagnosis list
val trim : ?global_constraints:bool -> Cudf.universe -> Cudf.universe
val find_broken : ?global_constraints:bool -> Cudf.universe -> Cudf.package list
val univcheck : ?global_constraints:bool ->
?callback:(Diagnostic.diagnosis -> unit) -> Cudf.universe -> int
univcheck
check if all packages in the universe can be installed.
Since not all packages are directly tested for installation, if a packages
is installable, the installation might be empty. To obtain an installation
set for each installable packages, the correct procedure is to iter on the
list of packages.global_constraints
: : enforce global constraints on the given
universe. In particular packages marked as `Keep_package must be always
installed. Default true.callback
: : execute a function for each package. This function can
have side effects and can be used to collect the installation set or the
failure reason.listcheck ~callback:c solver l
check if all packages in l
can be
installed.
Invariant : l is a subset of universe can be installed in the solver universe.
val listcheck : ?global_constraints:bool ->
?callback:(Diagnostic.diagnosis -> unit) ->
Cudf.universe -> Cudf.package list -> int
val dependency_closure : ?maxdepth:int ->
?conjunctive:bool -> Cudf.universe -> Cudf.package list -> Cudf.package list
dependency_closure universe l
compute the dependencies closure
of the give package list.
Invariant : l must be a subset of universeval reverse_dependencies : Cudf.universe -> Cudf.package list Common.CudfAdd.Cudf_hashtbl.t
reverse_dependencies univ
compute the reverse dependency list of all
packages in the universe univ
val reverse_dependency_closure : ?maxdepth:int -> Cudf.universe -> Cudf.package list -> Cudf.package list
reverse_dependencies_closure univ
compute the reverse dependency list of all
packages in l
in the universe univ
type
enc =
| |
Cnf |
| |
Dimacs |
val output_clauses : ?global_constraints:bool -> ?enc:enc -> Cudf.universe -> string
output_clauses enc univ
return a string encoded accordingly to enc
(default cnf).global_constraints
: : enforce global constraints on the given universe.val check_request : Cudf.cudf_doc -> Diagnostic.diagnosis