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 | 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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.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.ID.Map | Mc2_core.ID.Map.pp |
type | null | type key = t | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl |
type | null | type !'a t | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl |
value | create | val create : int -> 'a t | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.create |
value | clear | val clear : 'a t -> unit | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.clear |
value | reset | val reset : 'a t -> unit | since 4.00 | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.reset |
value | copy | val copy : 'a t -> 'a t | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.copy |
value | add | val add : 'a t -> key -> 'a -> unit | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.add |
value | remove | val remove : 'a t -> key -> unit | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.remove |
value | find | val find : 'a t -> key -> 'a | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.find |
value | find_opt | val find_opt : 'a t -> key -> 'a option | since 4.05 | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.find_opt |
value | find_all | val find_all : 'a t -> key -> 'a list | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.find_all |
value | replace | val replace : 'a t -> key -> 'a -> unit | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.replace |
value | mem | val mem : 'a t -> key -> bool | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.mem |
value | iter | val iter : (key -> 'a -> unit) -> 'a t -> unit | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.iter |
value | filter_map_inplace | val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit | since 4.03 | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.filter_map_inplace |
value | fold | val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.fold |
value | length | val length : 'a t -> int | null | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.length |
value | stats | val stats : 'a t -> Hashtbl.statistics | since 4.00 | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.stats |
value | to_seq | val to_seq : 'a t -> (key * 'a) Seq.t | since 4.07 | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.to_seq |
value | to_seq_keys | val to_seq_keys : _ t -> key Seq.t | since 4.07 | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.to_seq_keys |
value | to_seq_values | val to_seq_values : 'a t -> 'a Seq.t | since 4.07 | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.to_seq_values |
value | replace_seq | val replace_seq : 'a t -> (key * 'a) Seq.t -> unit | since 4.07 | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.replace_seq |
value | get | val get : 'a t -> key -> 'a option | get tbl k finds a binding for the key k if present, or returns None if no value is found. Safe version of Hashtbl.find. | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.get |
value | get_or | val get_or : 'a t -> key -> default:'a -> 'a | get_or tbl k ~default returns the value associated to k if present, and returns default otherwise (if k doesn't belong in tbl).since 0.16 | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.get_or |
value | add_list | val add_list : 'a list t -> key -> 'a -> unit | add_list tbl x y adds y to the list x is bound to. If x is not bound, it becomes bound to y.since 0.16 | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.add_list |
value | incr | val incr : ?by:int -> int t -> key -> unit | incr ?by tbl x increments or initializes the counter associated with x. If get tbl x = None, then after update, get tbl x = Some 1; otherwise, if get tbl x = Some n, now get tbl x = Some (n+1).parameter by if specified, the int value is incremented by by rather than 1.since 0.16 | earley-ocaml | unknown | Mc2_core.ID.Tbl | Mc2_core.ID.Tbl.incr |
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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.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.ID.Tbl | Mc2_core.ID.Tbl.pp |
type | null | type elt = t | The type of the set elements. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set |
type | null | type t | The type of sets. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set |
value | empty | val empty : t | The empty set. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.empty |
value | add | val add : elt -> t -> t | add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).before 4.03 Physical equality was not ensured. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.add |
value | singleton | val singleton : elt -> t | singleton x returns the one-element set containing only x. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.singleton |
value | remove | val remove : elt -> t -> t | remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).before 4.03 Physical equality was not ensured. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.remove |
value | union | val union : t -> t -> t | Set union. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.union |
value | inter | val inter : t -> t -> t | Set intersection. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.inter |
value | disjoint | val disjoint : t -> t -> bool | Test if two sets are disjoint.since 4.08 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.disjoint |
value | diff | val diff : t -> t -> t | Set difference: diff s1 s2 contains the elements of s1 that are not in s2. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.diff |
value | cardinal | val cardinal : t -> int | Return the number of elements of a set. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.cardinal |
value | elements | val elements : t -> elt list | Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.elements |
value | min_elt | val min_elt : t -> elt | Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.min_elt |
value | max_elt | val max_elt : t -> elt | Same as min_elt, but returns the largest element of the given set. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.max_elt |
value | choose | val choose : t -> elt | Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.choose |
value | find | val find : elt -> t -> elt | find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.since 4.01 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.find |
value | iter | val iter : (elt -> unit) -> t -> unit | iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.iter |
value | fold | val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc | fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.fold |
value | map | val map : (elt -> elt) -> t -> t | map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.The elements are passed to f in increasing order with respect to the ordering over the type of the elements.If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, ... | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.map |
value | filter | val filter : (elt -> bool) -> t -> t | filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).before 4.03 Physical equality was not ensured. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.filter |
value | filter_map | val filter_map : (elt -> elt option) -> t -> t | filter_map f s returns the set of all v such that f x = Some v for some element x of s.For example,filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) sis the set of halves of the even elements of s.If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned uncha... | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.filter_map |
value | partition | val partition : (elt -> bool) -> t -> t * t | partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.partition |
value | split | val split : elt -> t -> t * bool * t | split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.split |
value | is_empty | val is_empty : t -> bool | Test whether a set is empty or not. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.is_empty |
value | mem | val mem : elt -> t -> bool | mem x s tests whether x belongs to the set s. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.mem |
value | equal | val equal : t -> t -> bool | equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.equal |
value | compare | val compare : t -> t -> int | Total ordering between sets. Can be used as the ordering function for doing sets of sets. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.compare |
value | subset | val subset : t -> t -> bool | subset s1 s2 tests whether the set s1 is a subset of the set s2. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.subset |
value | for_all | val for_all : (elt -> bool) -> t -> bool | for_all f s checks if all elements of the set satisfy the predicate f. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.for_all |
value | exists | val exists : (elt -> bool) -> t -> bool | exists f s checks if at least one element of the set satisfies the predicate f. | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.exists |
value | of_list | val of_list : elt list -> t | of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.since 4.02 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.of_list |
value | to_seq_from | val to_seq_from : elt -> t -> elt Seq.t | to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.since 4.07 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.to_seq_from |
value | to_seq | val to_seq : t -> elt Seq.t | Iterate on the whole set, in ascending ordersince 4.07 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.to_seq |
value | to_rev_seq | val to_rev_seq : t -> elt Seq.t | Iterate on the whole set, in descending ordersince 4.12 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.to_rev_seq |
value | min_elt_opt | val min_elt_opt : t -> elt option | Safe version of min_elt.since 1.5 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.min_elt_opt |
value | max_elt_opt | val max_elt_opt : t -> elt option | Safe version of max_elt.since 1.5 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.max_elt_opt |
value | choose_opt | val choose_opt : t -> elt option | Safe version of choose.since 1.5 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.choose_opt |
value | find_opt | val find_opt : elt -> t -> elt option | Safe version of find.since 1.5 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.find_opt |
value | find_first | val find_first : (elt -> bool) -> t -> elt | Find minimum element satisfying predicate.since 1.5 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.find_first |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.