sig
module Version :
sig
type t
val of_string : string -> t
val to_string : t -> string
val to_json : t -> OpamJson.t
module Set :
sig
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
val map : (elt -> elt) -> t -> t
val choose_one : t -> elt
val of_list : elt list -> t
val to_string : t -> string
val to_json : t -> OpamJson.t
val find : (elt -> bool) -> t -> elt
end
module Map :
sig
type key = t
type +'a t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_string : ('a -> string) -> 'a t -> string
val to_json : ('a -> OpamJson.t) -> 'a t -> OpamJson.t
val values : 'a t -> 'a list
val keys : 'a t -> key list
val union : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val of_list : (key * 'a) list -> 'a t
end
val pinned : t
val compare : t -> t -> int
end
module Name :
sig
type t
val of_string : string -> t
val to_string : t -> string
val to_json : t -> OpamJson.t
module Set :
sig
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
val map : (elt -> elt) -> t -> t
val choose_one : t -> elt
val of_list : elt list -> t
val to_string : t -> string
val to_json : t -> OpamJson.t
val find : (elt -> bool) -> t -> elt
end
module Map :
sig
type key = t
type +'a t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_string : ('a -> string) -> 'a t -> string
val to_json : ('a -> OpamJson.t) -> 'a t -> OpamJson.t
val values : 'a t -> 'a list
val keys : 'a t -> key list
val union : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val of_list : (key * 'a) list -> 'a t
end
val global_config : t
end
type t
val of_string : string -> t
val to_string : t -> string
val to_json : t -> OpamJson.t
module Set :
sig
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
val map : (elt -> elt) -> t -> t
val choose_one : t -> elt
val of_list : elt list -> t
val to_string : t -> string
val to_json : t -> OpamJson.t
val find : (elt -> bool) -> t -> elt
end
module Map :
sig
type key = t
type +'a t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge :
(key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_string : ('a -> string) -> 'a t -> string
val to_json : ('a -> OpamJson.t) -> 'a t -> OpamJson.t
val values : 'a t -> 'a list
val keys : 'a t -> key list
val union : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val of_list : (key * 'a) list -> 'a t
end
val name : t -> OpamPackage.Name.t
val of_string_opt : string -> t option
val version : t -> OpamPackage.Version.t
val create : OpamPackage.Name.t -> OpamPackage.Version.t -> t
val of_filename : OpamFilename.t -> t option
val of_dirname : OpamFilename.Dir.t -> t option
val of_archive : OpamFilename.t -> t option
val to_map : Set.t -> OpamPackage.Version.Set.t OpamPackage.Name.Map.t
val versions_of_packages : Set.t -> OpamPackage.Version.Set.t
val versions_of_name :
Set.t -> OpamPackage.Name.t -> OpamPackage.Version.Set.t
val names_of_packages : Set.t -> OpamPackage.Name.Set.t
val packages_of_name : Set.t -> OpamPackage.Name.t -> Set.t
val packages_of_names : Set.t -> OpamPackage.Name.Set.t -> Set.t
val compare : t -> t -> int
val equal : t -> t -> bool
val hash : t -> int
val list : OpamFilename.Dir.t -> Set.t
val prefixes : OpamFilename.Dir.t -> string option Map.t
val unknown : OpamPackage.Name.t -> OpamPackage.Version.t option -> 'a
val unavailable : OpamPackage.Name.t -> OpamPackage.Version.t option -> 'a
val unavailable_because_pinned :
OpamPackage.Name.t -> OpamPackage.Version.t option -> 'a
val pinned : OpamPackage.Name.t -> t
val is_pinned : t -> bool
module Parallel :
sig
module G :
sig
type t
module V :
sig
type t = t
val compare : t -> t -> int
val hash : t -> int
val equal : t -> t -> bool
type label
val create : label -> t
val label : t -> label
end
type vertex = V.t
module E :
sig
type t
val compare : t -> t -> int
type vertex = vertex
val src : t -> vertex
val dst : t -> vertex
type label
val create : vertex -> label -> vertex -> t
val label : t -> label
end
type edge = E.t
val is_directed : bool
val is_empty : t -> bool
val nb_vertex : t -> int
val nb_edges : t -> int
val out_degree : t -> vertex -> int
val mem_vertex : t -> vertex -> bool
val mem_edge : t -> vertex -> vertex -> bool
val mem_edge_e : t -> edge -> bool
val find_edge : t -> vertex -> vertex -> edge
val find_all_edges : t -> vertex -> vertex -> edge list
val succ : t -> vertex -> vertex list
val pred : t -> vertex -> vertex list
val succ_e : t -> vertex -> edge list
val pred_e : t -> vertex -> edge list
val fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges : (vertex -> vertex -> unit) -> t -> unit
val fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges_e : (edge -> unit) -> t -> unit
val fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a
val map_vertex : (vertex -> vertex) -> t -> t
val iter_pred : (vertex -> unit) -> t -> vertex -> unit
val fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_succ_e : (edge -> unit) -> t -> vertex -> unit
val fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_pred_e : (edge -> unit) -> t -> vertex -> unit
val fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val create : ?size:int -> unit -> t
val clear : t -> unit
val copy : t -> t
val add_vertex : t -> vertex -> unit
val remove_vertex : t -> vertex -> unit
val add_edge : t -> vertex -> vertex -> unit
val add_edge_e : t -> edge -> unit
val remove_edge : t -> vertex -> vertex -> unit
val remove_edge_e : t -> edge -> unit
val iter_vertex : (V.t -> unit) -> t -> unit
val iter_succ : (V.t -> unit) -> t -> V.t -> unit
val in_degree : t -> V.t -> int
val has_cycle : t -> bool
val scc_list : t -> V.t list list
val string_of_vertex : V.t -> string
end
val iter :
int ->
G.t ->
pre:(G.V.t -> unit) ->
child:(G.V.t -> unit) -> post:(G.V.t -> unit) -> unit
val iter_l :
int ->
G.vertex list ->
pre:(G.V.t -> unit) ->
child:(G.V.t -> unit) -> post:(G.V.t -> unit) -> unit
val map_reduce :
int ->
G.t -> map:(G.V.t -> 'a) -> merge:('a -> 'a -> 'a) -> init:'a -> 'a
val map_reduce_l :
int ->
G.vertex list ->
map:(G.V.t -> 'a) -> merge:('a -> 'a -> 'a) -> init:'a -> 'a
val create : G.V.t list -> G.t
exception Errors of (G.V.t * OpamParallel.error) list * G.V.t list
exception Cyclic of G.V.t list list
end
end