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 | 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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.Set.split |
value | is_empty | val is_empty : t -> bool | Test whether a set is empty or not. | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.Set.find_first |
value | find_first_opt | val find_first_opt : (elt -> bool) -> t -> elt option | Safe version of find_first.since 1.5 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.find_first_opt |
value | find_first_map | val find_first_map : (elt -> 'a option) -> t -> 'a option | find_first_map f s find the minimum element x of s such that f x = Some y and return Some y. Otherwise returns None.since 3.12 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.find_first_map |
value | find_last | val find_last : (elt -> bool) -> t -> elt | Find maximum element satisfying predicate.since 1.5 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.find_last |
value | find_last_opt | val find_last_opt : (elt -> bool) -> t -> elt option | Safe version of find_last.since 1.5 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.find_last_opt |
value | find_last_map | val find_last_map : (elt -> 'a option) -> t -> 'a option | find_last_map f s find the maximum element x of s such that f x = Some y and return Some y. Otherwise returns None.since 3.12 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.find_last_map |
value | of_iter | val of_iter : elt CCSet.iter -> t | Build a set from the given iter of elements.since 2.8 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.of_iter |
value | of_seq | val of_seq : elt Seq.t -> t | Build a set from the given seq of elements.since 3.0 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.of_seq |
value | add_iter | val add_iter : t -> elt CCSet.iter -> t | since 2.8 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.add_iter |
value | add_seq | val add_seq : elt Seq.t -> t -> t | since 3.0 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.add_seq |
value | to_iter | val to_iter : t -> elt CCSet.iter | to_iter t converts the set t to a iter of the elements.since 2.8 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.to_iter |
value | add_list | val add_list : t -> elt list -> t | since 0.14 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.add_list |
value | to_list | val to_list : t -> elt list | to_list t converts the set t to a list of the elements. | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.to_list |
value | to_string | val to_string : ?start:string -> ?stop:string -> ?sep:string -> (elt -> string) -> t -> string | Print the set in a stringsince 2.7 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.to_string |
value | pp | val pp : ?pp_start:unit CCSet.printer -> ?pp_stop:unit CCSet.printer -> ?pp_sep:unit CCSet.printer -> elt CCSet.printer -> t CCSet.printer | Print the set. | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.pp |
type | null | type key = t | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl |
type | null | type !'a t | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl |
value | create | val create : int -> 'a t | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.create |
value | clear | val clear : 'a t -> unit | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.clear |
value | reset | val reset : 'a t -> unit | since 4.00 | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.reset |
value | copy | val copy : 'a t -> 'a t | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.copy |
value | add | val add : 'a t -> key -> 'a -> unit | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.add |
value | remove | val remove : 'a t -> key -> unit | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.remove |
value | find | val find : 'a t -> key -> 'a | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.find |
value | find_opt | val find_opt : 'a t -> key -> 'a option | since 4.05 | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.find_opt |
value | find_all | val find_all : 'a t -> key -> 'a list | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.find_all |
value | replace | val replace : 'a t -> key -> 'a -> unit | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.replace |
value | mem | val mem : 'a t -> key -> bool | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.mem |
value | iter | val iter : (key -> 'a -> unit) -> 'a t -> unit | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.Tbl.filter_map_inplace |
value | fold | val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.fold |
value | length | val length : 'a t -> int | null | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.length |
value | stats | val stats : 'a t -> Hashtbl.statistics | since 4.00 | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.stats |
value | to_seq | val to_seq : 'a t -> (key * 'a) Seq.t | since 4.07 | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.Tbl.to_seq |
value | to_seq_keys | val to_seq_keys : _ t -> key Seq.t | since 4.07 | earley-ocaml | unknown | Mc2_core.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.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.Atom.Tbl | Mc2_core.Atom.Tbl.pp |
type | null | type _ service_list = | Heterogeneous tuple of services | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin |
type | null | type _ service_key_list = | Heterogeneous tuple of keys | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin |
type | null | type t = (module S) | null | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin |
value | owns_term | val owns_term : t -> Mc2_core__.Solver_types.term -> bool | null | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin.owns_term |
value | name | val name : t -> string | null | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin.name |
module | null | module Factory : sig ... end | null | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin |
value | id | val id : int | null | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin.id |
value | name | val name : string | Descriptive name | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin.name |
value | provided_services | val provided_services : Service.any list | List of provided services, to be registered for other plugins to use | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin.provided_services |
value | check_if_sat | val check_if_sat : Mc2_core__.Solver_types.actions -> Mc2_core__.Solver_types.check_res | Last call before answering "sat". If the current trail is not theory-satisfiable, the plugin MUST give a conflict here. | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin.check_if_sat |
value | iter_terms | val iter_terms : Mc2_core__.Solver_types.term Iter.t | Iterate on all terms known to the plugin. Used for checking all variables to assign, and for garbage collection. | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin.iter_terms |
value | gc_all | val gc_all : unit -> int | Garbage collect all unmarked termsreturns the number of collected (deleted) terms | earley-ocaml | unknown | Mc2_core.Plugin | Mc2_core.Plugin.gc_all |
type | null | type plugin = t | null | earley-ocaml | unknown | Mc2_core.Plugin.Factory | Mc2_core.Plugin.Factory |
type | null | type t = | null | earley-ocaml | unknown | Mc2_core.Plugin.Factory | Mc2_core.Plugin.Factory |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.