← Back to branch summary

~ubuntu-branches/ubuntu/maverick/dose2/maverick

« back to all changes in this revision

Viewing changes to packetology/installability.mli

  • Committer: Bazaar Package Importer
  • Author(s): Ralf Treinen
  • Date: 2009-03-24 22:07:37 UTC
  • mfrom: (1.1.1 upstream)
  • Revision ID: james.westby@ubuntu.com-20090324220737-1rwtkm8318x266mp
Tags: 1.4-1
http://bugs.debian.org/493866
* New Upstream Version
* Fixed FTBFS due to wrong order of ocamlfind options. Thanks to
  Samuel Thibault for the patch! (Closes: #493866)
* Section: ocaml
* Standards-Version 3.8.1 (no change)
* Some improvements on long package dscriptions
* CDBS includes in debian/rules: class/ocaml.mk -> rules/ocaml.mk
* Add build-dependencies on dh-ocaml and libbz2-ocaml-dev
* Use debian/libdose2-ocaml.install file to install stublibs

Show diffs side-by-side

added added

removed removed

Lines of Context:
packetology/installability.mli
15
15
You should have received a copy of the GNU Lesser General Public License
16
16
along with this program.  If not, see <http://www.gnu.org/licenses/>. *)
17
17
 
 
18
open Napkin
18
19
open Rapids
 
20
open Diagnosis
 
21
 
 
22
module N:
 
23
sig
 
24
        type t = (package_id, (unit_id, version_number * release_number, glob) versioned) reason
 
25
        type reason = t
 
26
end;;
 
27
 
 
28
(* This doesn't do anything, but is preserved for upwards compatibility with
 
29
 * unstable versions *)
 
30
type solver =
 
31
        SAT (* Jerome Vouillon's SAT-based solver *)
 
32
| Direct (* Direct solver *)
 
33
 
 
34
val set_solver: solver -> unit
 
35
val get_solver: unit -> solver
 
36
 
 
37
val set_verifier: solver option -> unit
 
38
val get_verifier: unit -> solver option
 
39
 
 
40
val prepare : 
 
41
        db ->
 
42
        ?log:(string -> unit) ->
 
43
        indicator:Progress.indicator ->
 
44
        ?targets:Package_set.t ->
 
45
        available:Package_set.t ->
 
46
        unit ->
 
47
        int * (Package_set.elt -> Solver.M(N).var) * (Solver.M(N).var -> Package_set.elt) * Package_set.t * Solver.M(N).state * 'a list ref * int ref * int ref * int ref
19
48
 
20
49
val check : 
21
50
    db ->
22
 
    ?log:(string -> unit) ->
 
51
                ?log:(string -> unit) ->
 
52
                ?preparation:(int * (Package_set.elt -> Solver.M(N).var) * (Solver.M(N).var -> Package_set.elt) * Package_set.t * Solver.M(N).state * (Package_set.elt * N.reason list) list ref * int ref * int ref * int ref) ->
23
53
    indicator:Progress.indicator ->
24
54
    targets:Package_set.t ->
25
55
    available:Package_set.t ->
26
56
    unit ->
27
 
    (Package_set.elt, Package_set.elt, (Rapids.unit_id, (Rapids.version_number * Rapids.release_number)) Napkin.versioned) Diagnosis.diagnosis
 
57
    (Package_set.elt, Package_set.elt, (Rapids.unit_id, (Rapids.version_number * Rapids.release_number), glob) Napkin.versioned) Diagnosis.diagnosis
 
58
 
28
59
val check_together : 
29
60
    db ->
30
 
    ?log:(string -> unit) ->
 
61
                ?log:(string -> unit) ->
 
62
                ?preparation:int * (Package_set.elt -> Solver.M(N).var) * (Solver.M(N).var -> Package_set.elt) * Package_set.t * Solver.M(N).state * (Package_set.elt list * N.reason list) list ref * int ref * int ref * int ref ->
31
63
    indicator:Progress.indicator ->
32
64
    targets:Package_set.t ->
33
65
    available:Package_set.t ->
34
66
    unit ->
35
 
    (Package_set.elt list, Package_set.elt, (Rapids.unit_id, (Rapids.version_number * Rapids.release_number)) Napkin.versioned) Diagnosis.diagnosis
36
 
val check_archive: db -> ?log:(string -> unit) ->
37
 
        indicator:Progress.indicator -> archive:Package_set.t ->
38
 
        available:Package_set.t -> unit ->
39
 
        (Package_set.elt * (Rapids.package_id, (Rapids.unit_id, Rapids.version_number * Rapids.release_number) Napkin.versioned) Diagnosis.reason list) list
 
67
    (Package_set.elt list, Package_set.elt, (Rapids.unit_id, (Rapids.version_number * Rapids.release_number), glob) Napkin.versioned) Diagnosis.diagnosis
 
68
 
40
69
val install : 
41
70
    db ->
42
 
    ?log:(string -> unit) ->
 
71
                ?log:(string -> unit) ->
 
72
                ?preparation:(int * (Package_set.elt -> Solver.M(N).var) *
 
73
                  (Solver.M(N).var -> Package_set.elt) * Package_set.t * Solver.M(N).state *
 
74
                        'a list ref * int ref * int ref * int ref) ->
43
75
    indicator:Progress.indicator ->
44
76
    targets:Package_set.t ->
45
77
    available:Package_set.t ->
46
78
                ?known:Package_set.t ->
47
79
    unit ->
48
80
                Package_set.t
 
81
 
49
82
val abundance : db -> Package_set.t -> package_id option
 
83
 
 
84
val strong_dep:
 
85
        db -> ?is:Package_set.t ->
 
86
        ?preparation:int * (Package_set.elt -> Solver.M(N).var) * (Solver.M(N).var -> Package_set.elt) * Package_set.t * Solver.M(N).state * 'a list ref * int ref * int ref * int ref ->
 
87
        Package_set.t -> package_id -> package_id -> bool
 
88
 
 
89
val trim:
 
90
        db ->
 
91
        Package_set.t ->
 
92
        Package_set.t