kind stringclasses 5
values | name stringlengths 1 106 ⌀ | signature stringlengths 5 19.8k | documentation stringlengths 0 21.3k ⌀ | package_name stringclasses 1
value | package_version stringclasses 1
value | module_name stringlengths 1 134 | full_path stringlengths 1 155 |
|---|---|---|---|---|---|---|---|
value | find_last | val 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 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.find_last |
value | find_last_opt | val 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 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.find_last_opt |
value | iter | val 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. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.iter |
value | fold | val 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. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.fold |
value | map | val 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. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.map |
value | mapi | val 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. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.mapi |
value | filter | val 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.12before 4.03 Physical equality was not ensured. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.filter |
value | filter_map | val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t | filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:if f k v is None then k is not in the result,if f k v is Some v' then the binding (k, v') is in the output map.For example, the following function on maps whose values are listsfilter... | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.filter_map |
value | partition | val 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 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.partition |
value | split | val 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 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.split |
value | is_empty | val is_empty : 'a t -> bool | Test whether a map is empty or not. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.is_empty |
value | mem | val mem : key -> 'a t -> bool | mem x m returns true if m contains a binding for x, and false otherwise. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.mem |
value | equal | val 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. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.equal |
value | compare | val 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. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.compare |
value | for_all | val 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 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.for_all |
value | exists | val 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 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.exists |
value | to_seq | val to_seq : 'a t -> (key * 'a) Seq.t | Iterate on the whole map, in ascending order of keyssince 4.07 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.to_seq |
value | to_rev_seq | val to_rev_seq : 'a t -> (key * 'a) Seq.t | Iterate on the whole map, in descending order of keyssince 4.12 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.to_rev_seq |
value | to_seq_from | val 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 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.to_seq_from |
value | get | val get : key -> 'a t -> 'a option | get k m returns Some v if the current binding of k in m is v, or None if the key k is not present. Safe version of find. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.get |
value | get_or | val get_or : key -> 'a t -> default:'a -> 'a | get_or k m ~default returns the value associated to k if present, and returns default otherwise (if k doesn't belong in m).since 0.16 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.get_or |
value | update | val update : key -> ('a option -> 'a option) -> 'a t -> 'a t | update k f m calls f (Some v) if find k m = v, otherwise it calls f None. In any case, if the result is None k is removed from m, and if the result is Some v' then add k v' m is returned. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.update |
value | choose_opt | val choose_opt : 'a t -> (key * 'a) option | choose_opt m returns one binding of the given map m, or None if m is empty. Safe version of choose.since 1.5 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.choose_opt |
value | min_binding_opt | val min_binding_opt : 'a t -> (key * 'a) option | min_binding_opt m returns the smallest binding of the given map m, or None if m is empty. Safe version of min_binding.since 1.5 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.min_binding_opt |
value | max_binding_opt | val max_binding_opt : 'a t -> (key * 'a) option | max_binding_opt m returns the largest binding of the given map m, or None if m is empty. Safe version of max_binding.since 1.5 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.max_binding_opt |
value | find_opt | val find_opt : key -> 'a t -> 'a option | find_opt k m returns Some v if the current binding of k in m is v, or None if the key k is not present. Safe version of find.since 1.5 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.find_opt |
value | find_first | val 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. See Map.S.find_first.since 1.5 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.find_first |
value | find_first_opt | val 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. Safe version of find_first.since 1.5 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.find_first_opt |
value | merge_safe | val merge_safe : f:(key -> [ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] -> 'c option) -> 'a t -> 'b t -> 'c t | merge_safe ~f a b merges the maps a and b together.since 0.17 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.merge_safe |
value | add_seq | val add_seq : 'a t -> (key * 'a) Seq.t -> 'a t | add_seq m seq adds the given Seq.t of bindings to the map m. Like add_list. Renamed from add_std_seq since 3.0.since 3.0 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.add_seq |
value | add_seq_with | val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Seq.t -> 'a t | add_seq ~f m l adds the given seq l of bindings to the map m, using f to combine values that have the same key. If a key occurs several times, all its bindings are combined using the function f, with f key v1 v2 being called with v1 occurring later in the seq than v2.since 3.3 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.add_seq_with |
value | of_seq | val of_seq : (key * 'a) Seq.t -> 'a t | of_seq seq builds a map from the given Seq.t of bindings. Like of_list. Renamed from of_std_seq since 3.0.since 3.0 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.of_seq |
value | of_seq_with | val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Seq.t -> 'a t | of_seq_with ~f l builds a map from the given seq l of bindings k_i -> v_i, added in order using add. If a key occurs several times, all its bindings are combined using the function f, with f key v1 v2 being called with v1 occurring later in the seq than v2.since 3.3 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.of_seq_with |
value | add_iter | val add_iter : 'a t -> (key * 'a) CCMap.iter -> 'a t | add_iter m iter adds the given iter of bindings to the map m. Like add_list.since 2.8 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.add_iter |
value | add_iter_with | val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCMap.iter -> 'a t | add_iter ~f m l adds the given iter l of bindings to the map m, using f to combine values that have the same key. If a key occurs several times, all its bindings are combined using the function f, with f key v1 v2 being called with v1 occurring later in the seq than v2.since 3.3 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.add_iter_with |
value | of_iter | val of_iter : (key * 'a) CCMap.iter -> 'a t | of_iter iter builds a map from the given iter of bindings. Like of_list.since 2.8 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.of_iter |
value | of_iter_with | val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCMap.iter -> 'a t | of_iter_with ~f l builds a map from the given iter l of bindings k_i -> v_i, added in order using add. If a key occurs several times, all its bindings are combined using the function f, with f key v1 v2 being called with v1 occurring later in the iter than v2.since 3.3 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.of_iter_with |
value | to_iter | val to_iter : 'a t -> (key * 'a) CCMap.iter | to_iter m iterates on the whole map m, creating an iter of bindings. Like to_list.since 2.8 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.to_iter |
value | of_list | val of_list : (key * 'a) list -> 'a t | of_list l builds a map from the given list l of bindings k_i -> v_i, added in order using add. If a key occurs several times, only its last binding will be present in the result. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.of_list |
value | of_list_with | val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t | of_list_with ~f l builds a map from the given list l of bindings k_i -> v_i, added in order using add. If a key occurs several times, all its bindings are combined using the function f, with f key v1 v2 being called with v1 occurring later in the list than v2.since 3.3 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.of_list_with |
value | add_list | val add_list : 'a t -> (key * 'a) list -> 'a t | add_list m l adds the given list l of bindings to the map m.since 0.14 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.add_list |
value | add_list_with | val add_list_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) list -> 'a t | add_list ~f m l adds the given list l of bindings to the map m, using f to combine values that have the same key. If a key occurs several times, all its bindings are combined using the function f, with f key v1 v2 being called with v1 occurring later in the seq than v2.since 3.3 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.add_list_with |
value | keys | val keys : _ t -> key CCMap.iter | keys m iterates on the keys of m only, creating an iter of keys.since 0.15 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.keys |
value | values | val values : 'a t -> 'a CCMap.iter | values m iterates on the values of m only, creating an iter of values.since 0.15 | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.values |
value | to_list | val to_list : 'a t -> (key * 'a) list | to_list m builds a list of the bindings of the given map m. The order is unspecified. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.to_list |
value | pp | val pp : ?pp_start:unit CCMap.printer -> ?pp_stop:unit CCMap.printer -> ?pp_arrow:unit CCMap.printer -> ?pp_sep:unit CCMap.printer -> key CCMap.printer -> 'a CCMap.printer -> 'a t CCMap.printer | pp ?pp_start ?pp_stop ?pp_arrow ?pp_sep pp_key pp_v m pretty-prints the contents of the map. | earley-ocaml | unknown | Mc2_core.Int_map | Mc2_core.Int_map.pp |
type | null | type view = .. | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term |
type | null | type t | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term |
type | null | type tc | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term |
value | id | val id : t -> int | Globally unique ID of this term | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.id |
value | view | val view : t -> view | Globally unique ID of this term | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.view |
value | equal | val equal : t -> t -> bool | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.equal |
value | compare | val compare : t -> t -> int | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.compare |
value | hash | val hash : t -> int | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.hash |
value | pp | val pp : t CCFormat.printer | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.pp |
value | debug | val debug : t CCFormat.printer | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.debug |
value | debug_no_val | val debug_no_val : t CCFormat.printer | like debug but does not print val | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.debug_no_val |
value | plugin_id_width | val plugin_id_width : int | Number of bits dedicated to plugin IDs. There can be at most 2 ** plugin_id_width plugins in a solver. | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.plugin_id_width |
value | plugin_id | val plugin_id : t -> int | Which plugin owns this term? | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.plugin_id |
value | plugin_specific_id | val plugin_specific_id : t -> int | Which plugin owns this term?ID of the term for the plugin itself | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.plugin_specific_id |
value | mark | val mark : t -> unit | Mark the variable | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.mark |
value | unmark | val unmark : t -> unit | Mark the variableClear the fields of the variable. | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.unmark |
value | marked | val marked : t -> bool | Clear the fields of the variable.Was mark called on this var? | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.marked |
value | is_deleted | val is_deleted : t -> bool | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.is_deleted |
value | is_added | val is_added : t -> bool | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.is_added |
value | level | val level : t -> int | decision/assignment level of the term | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.level |
value | level_for | val level_for : t -> Mc2_core__.Solver_types.value -> int | decision/assignment level of the termlevel for evaluating into this value | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.level_for |
value | var | val var : t -> Mc2_core__.Solver_types.var | level for evaluating into this value | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.var |
value | ty | val ty : t -> Type.t | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.ty |
value | reason | val reason : t -> Mc2_core__.Solver_types.reason option | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.reason |
value | reason_exn | val reason_exn : t -> Mc2_core__.Solver_types.reason | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.reason_exn |
value | eval | val eval : t -> Mc2_core__.Solver_types.eval_res | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.eval |
value | is_bool | val is_bool : t -> bool | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.is_bool |
value | level_semantic | val level_semantic : t -> int | maximum level of subterms, or -1 if some subterm is not assigned | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.level_semantic |
value | level_sub | val level_sub : t -> int | maximum level of subterms, ignoring unassigned subterms | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.level_sub |
value | max_level | val max_level : int -> int -> int | maximum of the levels, or -1 if either is -1 | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.max_level |
value | iter_subterms | val iter_subterms : t -> t Iter.t | Iteration over subterms. When incrementing activity, adding new terms, etc. we want to be able to iterate over all subterms of a formula. | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.iter_subterms |
value | subterms | val subterms : t -> t list | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.subterms |
value | decide_state_exn | val decide_state_exn : t -> Mc2_core__.Solver_types.decide_state | Obtain decide state, or raises if the variable is not semantic | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.decide_state_exn |
value | weight | val weight : t -> float | Heuristic weight | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.weight |
value | set_weight | val set_weight : t -> float -> unit | Heuristic weight | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.set_weight |
value | has_some_value | val has_some_value : t -> bool | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.has_some_value |
value | has_value | val has_value : t -> Mc2_core__.Solver_types.value -> bool | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.has_value |
value | value | val value : t -> Mc2_core__.Solver_types.value option | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.value |
value | value_exn | val value_exn : t -> Mc2_core__.Solver_types.value | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.value_exn |
value | mk_eq | val mk_eq : t -> t -> t | Use the term's type to make two terms equal | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.mk_eq |
value | gc_unmark | val gc_unmark : t -> unit | Unmark just this term | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.gc_unmark |
value | gc_marked | val gc_marked : t -> bool | Unmark just this term | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.gc_marked |
value | gc_mark | val gc_mark : t -> unit | Non recursive | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.gc_mark |
value | field_get | val field_get : Mc2_core__.Solver_types.Term_fields.field -> t -> bool | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.field_get |
value | field_set | val field_set : Mc2_core__.Solver_types.Term_fields.field -> t -> unit | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.field_set |
value | field_clear | val field_clear : Mc2_core__.Solver_types.Term_fields.field -> t -> unit | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.field_clear |
value | has_var | val has_var : t -> bool | is there a variable for the term? | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.has_var |
value | setup_var | val setup_var : t -> unit | is there a variable for the term?create a variable for the term | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.setup_var |
value | add_watch | val add_watch : t -> t -> unit | add_watch t u adds u to the list of watches of t. u will be notified whenever t is assigned | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.add_watch |
module | null | module Bool : sig ... end | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term |
module | null | module Watch1 : sig ... end | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term |
module | null | module Watch2 : sig ... end | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term |
value | assigned | val assigned : t -> bool | null | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.assigned |
value | assignment | val assignment : t -> Mc2_core__.Solver_types.assignment_view option | Current assignment of this term | earley-ocaml | unknown | Mc2_core.Term | Mc2_core.Term.assignment |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.