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 | decr | val decr : ?by:int -> int t -> key -> unit | decr ?by tbl x is like incr but subtract 1 (or the value of by). If the value reaches 0, the key is removed from the table. This does nothing if the key is not already present in the table.since 0.16 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.decr |
value | keys | val keys : 'a t -> key CCHashtbl.iter | keys tbl f iterates on keys (similar order as Hashtbl.iter). | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.keys |
value | values | val values : 'a t -> 'a CCHashtbl.iter | values tbl f iterates on values in the table. | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.values |
value | keys_list | val keys_list : _ t -> key list | keys_list tbl is the list of keys in tbl. If the key is in the Hashtable multiple times, all occurrences will be returned.since 0.8 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.keys_list |
value | values_list | val values_list : 'a t -> 'a list | values_list t is the list of values in t.since 0.8 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.values_list |
value | map_list | val map_list : (key -> 'a -> 'b) -> 'a t -> 'b list | Map on a hashtable's items, collect into a list. | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.map_list |
value | to_iter | val to_iter : 'a t -> (key * 'a) CCHashtbl.iter | Iterate on bindings in the table.since 2.8 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.to_iter |
value | add_iter | val add_iter : 'a t -> (key * 'a) CCHashtbl.iter -> unit | Add the corresponding pairs to the table, using Hashtbl.add.since 2.8 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.add_iter |
value | add_iter_with | val add_iter_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) CCHashtbl.iter -> unit | Add the corresponding pairs to the table, using Hashtbl.add. If a key occurs multiple times in the input, the values are combined using f in an unspecified order.since 3.3 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.add_iter_with |
value | add_seq | val add_seq : 'a t -> (key * 'a) Seq.t -> unit | Add the corresponding pairs to the table, using Hashtbl.add. Renamed from add_std_seq since 3.0.since 3.0 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.add_seq |
value | add_seq_with | val add_seq_with : f:(key -> 'a -> 'a -> 'a) -> 'a t -> (key * 'a) Seq.t -> unit | Add the corresponding pairs to the table, using Hashtbl.add. If a key occurs multiple times in the input, the values are combined using f in an unspecified order.since 3.3 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.add_seq_with |
value | of_iter | val of_iter : (key * 'a) CCHashtbl.iter -> 'a t | From the given bindings, added in order.since 2.8 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.of_iter |
value | of_iter_with | val of_iter_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) CCHashtbl.iter -> 'a t | From the given bindings, added in order. If a key occurs multiple times in the input, the values are combined using f in an unspecified order.since 3.3 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.of_iter_with |
value | of_seq | val of_seq : (key * 'a) Seq.t -> 'a t | From the given bindings, added in order. Renamed from of_std_seq since 3.0.since 3.0 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.of_seq |
value | of_seq_with | val of_seq_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) Seq.t -> 'a t | From the given bindings, added in order. If a key occurs multiple times in the input, the values are combined using f in an unspecified order.since 3.3 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.of_seq_with |
value | add_iter_count | val add_iter_count : int t -> key CCHashtbl.iter -> unit | add_iter_count tbl i increments the count of each element of i by calling incr. This is useful for counting how many times each element of i occurs.since 2.8 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.add_iter_count |
value | add_seq_count | val add_seq_count : int t -> key Seq.t -> unit | add_seq_count tbl seq increments the count of each element of seq by calling incr. This is useful for counting how many times each element of seq occurs. Renamed from of_std_seq_count since 3.0.since 3.0 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.add_seq_count |
value | of_iter_count | val of_iter_count : key CCHashtbl.iter -> int t | Like add_seq_count, but allocates a new table and returns it.since 2.8 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.of_iter_count |
value | of_seq_count | val of_seq_count : key Seq.t -> int t | Like add_seq_count, but allocates a new table and returns it. Renamed from of_std_seq_count since 3.0.since 3.0 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.of_seq_count |
value | to_list | val to_list : 'a t -> (key * 'a) list | to_list tbl returns the list of (key,value) bindings (order unspecified). | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.to_list |
value | of_list | val of_list : (key * 'a) list -> 'a t | of_list l builds a table from the given list l of bindings k_i -> v_i, added in order using add. If a key occurs several times, it will be added several times, and the visible binding will be the last one. | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.of_list |
value | of_list_with | val of_list_with : f:(key -> 'a -> 'a -> 'a) -> (key * 'a) list -> 'a t | of_list l builds a table from the given list l of bindings k_i -> v_i. If a key occurs multiple times in the input, the values are combined using f in an unspecified order.since 3.3 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.of_list_with |
value | update | val update : 'a t -> f:(key -> 'a option -> 'a option) -> k:key -> unit | update tbl ~f ~k updates key k by calling f k (Some v) if k was mapped to v, or f k None otherwise; if the call returns None then k is removed/stays removed, if the call returns Some v' then the binding k -> v' is inserted using Hashtbl.replace.since 0.14 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.update |
value | get_or_add | val get_or_add : 'a t -> f:(key -> 'a) -> k:key -> 'a | get_or_add tbl ~k ~f finds and returns the binding of k in tbl, if it exists. If it does not exist, then f k is called to obtain a new binding v; k -> v is added to tbl and v is returned.since 1.0 | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.get_or_add |
value | pp | val pp : ?pp_start:unit CCHashtbl.printer -> ?pp_stop:unit CCHashtbl.printer -> ?pp_sep:unit CCHashtbl.printer -> ?pp_arrow:unit CCHashtbl.printer -> key CCHashtbl.printer -> 'a CCHashtbl.printer -> 'a t CCHashtbl.printer | pp ~pp_start ~pp_stop ~pp_sep ~pp arrow pp_k pp_v returns a table printer given a pp_k printer for individual key and a pp_v printer for individual value. pp_start and pp_stop control the opening and closing delimiters, by default print nothing. pp_sep control the separator between binding. pp_arrow control the arrow b... | earley-ocaml | unknown | Mc2_core.Value.Tbl | Mc2_core.Value.Tbl.pp |
type | null | type t | null | earley-ocaml | unknown | Mc2_core.Lemma | Mc2_core.Lemma |
type | null | type view | null | earley-ocaml | unknown | Mc2_core.Lemma | Mc2_core.Lemma |
value | pp | val pp : t CCFormat.printer | null | earley-ocaml | unknown | Mc2_core.Lemma | Mc2_core.Lemma.pp |
value | tauto | val tauto : t | null | earley-ocaml | unknown | Mc2_core.Lemma | Mc2_core.Lemma.tauto |
value | make | val make : view -> Mc2_core__.Solver_types.tc_lemma -> t | null | earley-ocaml | unknown | Mc2_core.Lemma | Mc2_core.Lemma.make |
module | null | module TC : sig ... end | null | earley-ocaml | unknown | Mc2_core.Lemma | Mc2_core.Lemma |
type | null | type t | null | earley-ocaml | unknown | Mc2_core.Lemma.TC | Mc2_core.Lemma.TC |
value | make | val make : pp:view CCFormat.printer -> unit -> t | null | earley-ocaml | unknown | Mc2_core.Lemma.TC | Mc2_core.Lemma.TC.make |
type | null | type t | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID |
value | make | val make : string -> t | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID.make |
value | makef | val makef : ('a, Format.formatter, unit, t) format4 -> 'a | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID.makef |
value | copy | val copy : t -> t | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID.copy |
value | id | val id : t -> int | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID.id |
value | to_string | val to_string : t -> string | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID.to_string |
value | to_string_full | val to_string_full : t -> string | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID.to_string_full |
value | equal | val equal : t -> t -> bool | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID.equal |
value | compare | val compare : t -> t -> int | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID.compare |
value | hash | val hash : t -> int | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID.hash |
value | pp | val pp : t CCFormat.printer | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID.pp |
value | pp_name | val pp_name : t CCFormat.printer | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID.pp_name |
module | null | module Map : CCMap.S with type key = t | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID |
module | null | module Set : CCSet.S with type elt = t | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID |
module | null | module Tbl : CCHashtbl.S with type key = t | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID |
module | null | module Smtlib : sig ... end | null | earley-ocaml | unknown | Mc2_core.ID | Mc2_core.ID |
type | null | type key = t | The type of the map keys. | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map |
type | null | type !+'a t | The type of maps from type key to type 'a. | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map |
value | empty | val empty : 'a t | The empty map. | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.empty |
value | add | val 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... | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.add |
value | add_to_list | val 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 | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.add_to_list |
value | singleton | val singleton : key -> 'a -> 'a t | singleton x y returns the one-element map that contains a binding y for x.since 3.12 | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.singleton |
value | remove | val 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. | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.remove |
value | merge | 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... | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.merge |
value | union | val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t | union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, wheref' _key None None = Nonef' _key (Some v) None = Some vf' _key... | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.union |
value | cardinal | val cardinal : 'a t -> int | Return the number of bindings of a map.since 3.12 | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.cardinal |
value | bindings | val 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 | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.bindings |
value | min_binding | val 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 | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.min_binding |
value | max_binding | val 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 | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.max_binding |
value | choose | val 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 | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.choose |
value | find | val 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. | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.Map.find |
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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.Map.split |
value | is_empty | val is_empty : 'a t -> bool | Test whether a map is empty or not. | earley-ocaml | unknown | Mc2_core.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.Map.of_iter |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.