package dose3

  1. Overview
  2. Docs
package dose3
Legend:
Library
Module
Module type
Parameter
Class
Class type
module R : sig ... end
module S : sig ... end
type solver = {
  1. constraints : S.state;
  2. map : Common.Util.projection;
  3. globalid : (bool * bool) * int;
}
type global_constraints = (Cudf_types.vpkglist * int list) list
type dep_t = (Cudf_types.vpkg list * int list) list * (Cudf_types.vpkg * int list) list
and pool = dep_t array
and t = [
  1. | `CudfPool of bool * pool
  2. | `SolverPool of pool
]
type result =
  1. | Success of unit -> int list
  2. | Failure of unit -> Diagnostic.reason_int list
val init_pool_univ : global_constraints:global_constraints -> Cudf.universe -> [> `CudfPool of bool * pool ]
val init_solver_pool : Common.Util.projection -> [< `CudfPool of bool * pool ] -> 'a list -> [> `SolverPool of pool ]
val init_solver_cache : ?buffer:bool -> ?explain:bool -> [< `SolverPool of pool ] -> S.state
val solve : ?tested:bool array -> explain:bool -> solver -> Diagnostic.request_int -> Diagnostic.result_int
val pkgcheck : ((Diagnostic.result_int * Diagnostic.request_int) -> 'a) option -> bool -> solver -> bool array -> int -> bool
val init_solver_univ : global_constraints:global_constraints -> ?buffer:bool -> ?explain:bool -> Cudf.universe -> solver
val init_solver_closure : global_constraints:global_constraints -> ?buffer:bool -> [< `CudfPool of bool * pool ] -> int list -> solver
val copy_solver : solver -> solver
val reverse_dependencies : Cudf.universe -> int list array
val dependency_closure_cache : ?maxdepth:int -> ?conjunctive:bool -> [< `CudfPool of bool * pool ] -> int list -> S.var list
val reverse_dependency_closure : ?maxdepth:int -> int list array -> int list -> int list
val progressbar_init : Common.Util.Progress.t
val progressbar_univcheck : Common.Util.Progress.t