package opam-solver

You can search for identifiers within the package.

in-package search v0.2.0

package opam-solver

opam-solver
- Library opam-solver
  - OpamActionGraph
    
    ACTION
    
    Pkg
    
    Set
    
    Op
    
    Map
    
    MakeAction
    
    Pkg
    
    Set
    
    Op
    
    Map
    
    SIG
    
    V
    
    E
    
    Topological
    
    Parallel
    
    G
    
    V
    
    E
    
    Vertex
    
    Topological
    
    Dot
    
    Make
    
    V
    
    E
    
    Topological
    
    Parallel
    
    G
    
    V
    
    E
    
    Vertex
    
    Topological
    
    Dot
  - OpamBuiltin0install
  - OpamBuiltinMccs
  - OpamBuiltinZ3
  - OpamCudf
    
    Package
    
    Set
    
    Op
    
    Map
    
    Graph
    
    V
    
    E
    
    Action
    
    Pkg
    
    Set
    
    Op
    
    Map
    
    ActionGraph
    
    V
    
    E
    
    Topological
    
    Parallel
    
    G
    
    V
    
    E
    
    Vertex
    
    Topological
    
    Dot
    
    Json
  - OpamCudfCriteria
  - OpamCudfSolver
    
    S
    
    Aspcud
    
    Aspcud_old
    
    Mccs
    
    Packup
  - OpamCudfSolverSig
    
    S
  - OpamSolver
    
    Action
    
    Pkg
    
    Set
    
    Op
    
    Map
    
    ActionGraph
    
    V
    
    E
    
    Topological
    
    Parallel
    
    G
    
    V
    
    E
    
    Vertex
    
    Topological
    
    Dot
    
    PkgGraph
    
    V
    
    E
  - OpamSolverConfig
    
    E
- Sources
  - opam-solver
    
    opamActionGraph.ml
    
    opamBuiltin0install.ml
    
    opamBuiltinMccs.ml
    
    opamBuiltinZ3.ml
    
    opamCudf.ml
    
    opamCudfCriteria.ml
    
    opamCudfSolver.ml
    
    opamCudfSolverSig.ml
    
    opamSolver.ml
    
    opamSolverConfig.ml

Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module `Action.Map`Source

include Map.S with type key = package OpamTypes.action

Maps

Sourcetype key = package OpamTypes.action

The type of the map keys.

Sourcetype !+'a t

The type of maps from type key to type 'a.

Sourceval empty : 'a t

The empty map.

Sourceval add : key -> 'a -> 'a t -> 'a t

add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

before 4.03
Physical equality was not ensured.

Sourceval add_to_list : key -> 'a -> 'a list t -> 'a list t

add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

since 5.1

Sourceval singleton : key -> 'a -> 'a t

singleton x y returns the one-element map that contains a binding y for x.

since 3.12

Sourceval remove : key -> 'a t -> 'a t

remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

before 4.03
Physical equality was not ensured.

Source

val merge : 
  (key -> 'a option -> 'b option -> 'c option) ->
  'a t ->
  'b t ->
  'c t

merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

since 3.12

Sourceval cardinal : 'a t -> int

Return the number of bindings of a map.

since 3.12

Bindings

Sourceval bindings : 'a t -> (key * 'a) list

Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

since 3.12

Sourceval min_binding : 'a t -> key * 'a

Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

since 3.12

Sourceval min_binding_opt : 'a t -> (key * 'a) option

Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

since 4.05

Sourceval max_binding : 'a t -> key * 'a

Same as min_binding, but returns the binding with the largest key in the given map.

since 3.12

Sourceval max_binding_opt : 'a t -> (key * 'a) option

Same as min_binding_opt, but returns the binding with the largest key in the given map.

since 4.05

Sourceval choose : 'a t -> key * 'a

Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

since 3.12

Searching

Sourceval find : key -> 'a t -> 'a

find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

Sourceval find_first : (key -> bool) -> 'a t -> key * 'a

find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

since 4.05

Sourceval find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

since 4.05

Sourceval find_last : (key -> bool) -> 'a t -> key * 'a

find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

since 4.05

Sourceval find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

since 4.05

Traversing

Sourceval iter : (key -> 'a -> unit) -> 'a t -> unit

iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

Sourceval fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

Transforming

Sourceval map : ('a -> 'b) -> 'a t -> 'b t

map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

Sourceval mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

Sourceval filter : (key -> 'a -> bool) -> 'a t -> 'a t

filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

since 3.12

before 4.03
Physical equality was not ensured.

Sourceval partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

since 3.12

Sourceval split : key -> 'a t -> 'a t * 'a option * 'a t

split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

since 3.12

Predicates and comparisons

Sourceval is_empty : 'a t -> bool

Test whether a map is empty or not.

Sourceval mem : key -> 'a t -> bool

mem x m returns true if m contains a binding for x, and false otherwise.

Sourceval equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

Sourceval compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

Sourceval for_all : (key -> 'a -> bool) -> 'a t -> bool

for_all f m checks if all the bindings of the map satisfy the predicate f.

since 3.12

Sourceval exists : (key -> 'a -> bool) -> 'a t -> bool

exists f m checks if at least one binding of the map satisfies the predicate f.

since 3.12

Converting

Sourceval to_list : 'a t -> (key * 'a) list

to_list m is bindings m.

since 5.1

Sourceval to_seq : 'a t -> (key * 'a) Seq.t

Iterate on the whole map, in ascending order of keys

since 4.07

Sourceval to_rev_seq : 'a t -> (key * 'a) Seq.t

Iterate on the whole map, in descending order of keys

since 4.12

Sourceval to_seq_from : key -> 'a t -> (key * 'a) Seq.t

to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

since 4.07

Sourceval add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

Add the given bindings to the map, in order.

since 4.07

Sourceval of_seq : (key * 'a) Seq.t -> 'a t

Build a map from the given bindings

since 4.07

Sourceval to_string : ('a -> string) -> 'a t -> string

Sourceval to_json : 'a OpamJson.encoder -> 'a t OpamJson.encoder

Sourceval of_json : 'a OpamJson.decoder -> 'a t OpamJson.decoder

Sourceval keys : 'a t -> key list

Sourceval values : 'a t -> 'a list

Sourceval find_opt : key -> 'a t -> 'a option

Sourceval choose_opt : 'a t -> (key * 'a) option

Sourceval union : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t

A key will be in the union of m1 and m2 if it is appears either m1 or m2, with the corresponding value. If a key appears in both m1 and m2, then the resulting value is built using the function given as argument.

Sourceval is_singleton : 'a t -> bool

Sourceval of_list : (key * 'a) list -> 'a t

Sourceval safe_add : key -> 'a -> 'a t -> 'a t

raises Failure
in case the element is already present

Sourceval update : key -> ('a -> 'a) -> 'a -> 'a t -> 'a t

update k f zero map updates the binding of k in map using function f, applied to the current value bound to k or zero if none

Source

val map_reduce : 
  ?default:'b ->
  (key -> 'a -> 'b) ->
  ('b -> 'b -> 'b) ->
  'a t ->
  'b

map_reduce f op t applies f to every binding of t and combines the results using associative operator op.

raises Invalid_argument
on an empty map if default is not defined

Sourceval filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

package opam-solver

Module Action.MapSource

Maps

Bindings

Searching

Traversing

Transforming

Predicates and comparisons

Converting

Module `Action.Map`Source