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_first_opt | val find_first_opt : (elt -> bool) -> t -> elt option | Safe version of find_first.since 1.5 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.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.ID.Set | Mc2_core.ID.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.ID.Set | Mc2_core.ID.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.ID.Set | Mc2_core.ID.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.ID.Set | Mc2_core.ID.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.ID.Set | Mc2_core.ID.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.ID.Set | Mc2_core.ID.Set.of_seq |
value | add_iter | val add_iter : t -> elt CCSet.iter -> t | since 2.8 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.Set.add_iter |
value | add_seq | val add_seq : elt Seq.t -> t -> t | since 3.0 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.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.ID.Set | Mc2_core.ID.Set.to_iter |
value | add_list | val add_list : t -> elt list -> t | since 0.14 | earley-ocaml | unknown | Mc2_core.ID.Set | Mc2_core.ID.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.ID.Set | Mc2_core.ID.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.ID.Set | Mc2_core.ID.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.ID.Set | Mc2_core.ID.Set.pp |
value | pp | val pp : t CCFormat.printer | null | earley-ocaml | unknown | Mc2_core.ID.Smtlib | Mc2_core.ID.Smtlib.pp |
type | null | type t = | null | earley-ocaml | unknown | Mc2_core.Statement | Mc2_core.Statement |
value | pp | val pp : t CCFormat.printer | null | earley-ocaml | unknown | Mc2_core.Statement | Mc2_core.Statement.pp |
type | null | type proof = Proof.t | null | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver |
type | null | type nonrec atom | The type of atoms given by the module argument for formulas | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver |
type | null | type t | The type of a solver | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver |
value | create | val create : plugins:Plugin.Factory.t list -> unit -> t | Create a new solver with the given plugins | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.create |
value | plugins | val plugins : t -> Plugin.t Iter.t | Obtain the current plugins | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.plugins |
value | services | val services : t -> Service.Registry.t | null | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.services |
value | get_service | val get_service : t -> 'a Service.Key.t -> 'a option | Obtain a service by its key | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.get_service |
value | get_service_exn | val get_service_exn : t -> 'a Service.Key.t -> 'a | Obtain a service by its key, or fail | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.get_service_exn |
value | assume | val assume : t -> ?tag:int -> atom list list -> unit | Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place. | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.assume |
value | add_term | val add_term : t -> Mc2_core__.Solver_types.term -> unit | Add a new literal (i.e term) to the solver. This term will be decided on at some point during solving, whether it appears in clauses or not. | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.add_term |
value | unsat_core | val unsat_core : t -> proof -> Mc2_core__.Solver_types.clause list | Returns the unsat core of a given proof. | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.unsat_core |
value | true_at_level0 | val true_at_level0 : t -> atom -> bool | true_at_level0 a returns true if a was proved at level0, i.e. it must hold in all models | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.true_at_level0 |
type | null | type 'clause clause_sets = { | Current state of the SAT solver | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver |
value | clause_sets | val clause_sets : t -> Mc2_core__.Solver_types.clause clause_sets | Iterate on current sets of clauses | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.clause_sets |
type | null | type 'a state | Opaque view on the solver in a given state, with a phantom parameter to indicate in which state it is | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver |
value | state_solver | val state_solver : _ state -> t | Get the solver back from a solver. | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.state_solver |
exception | null | exception UndecidedLit of Mc2_core__.Solver_types.term | Exception raised by the evaluating functions when a literal has not yet been assigned a value. | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver |
exception | null | exception Out_of_time | null | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver |
exception | null | exception Out_of_space | null | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver |
module | null | module Sat_state : sig ... end | null | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver |
module | null | module Unsat_state : sig ... end | null | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver |
type | null | type res = | Result type for the solver | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver |
value | solve | val solve : ?gc:bool -> ?restarts:bool -> ?time:float -> ?memory:float -> ?progress:bool -> ?assumptions:atom list -> ?switch:Mc2_core__.Util.Switch.t -> t -> res | Try and solves the current set of assumptions. | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.solve |
value | pp_stats | val pp_stats : t CCFormat.printer | Print stats | earley-ocaml | unknown | Mc2_core.Solver | Mc2_core.Solver.pp_stats |
type | null | type t = [ `UNSAT ] state | null | earley-ocaml | unknown | Mc2_core.Solver.Unsat_state | Mc2_core.Solver.Unsat_state |
value | unsat_conflict | val unsat_conflict : t -> Mc2_core__.Solver_types.clause | Returns the unsat clause found at the toplevel | earley-ocaml | unknown | Mc2_core.Solver.Unsat_state | Mc2_core.Solver.Unsat_state.unsat_conflict |
value | get_proof | val get_proof : t -> proof | returns a persistent proof of the empty clause from the Unsat result. | earley-ocaml | unknown | Mc2_core.Solver.Unsat_state | Mc2_core.Solver.Unsat_state.get_proof |
type | null | type t = [ `SAT ] state | null | earley-ocaml | unknown | Mc2_core.Solver.Sat_state | Mc2_core.Solver.Sat_state |
value | eval | val eval : t -> atom -> bool | Returns the valuation of a formula in the current state of the sat solver.raises UndecidedLit if the literal is not decided | earley-ocaml | unknown | Mc2_core.Solver.Sat_state | Mc2_core.Solver.Sat_state.eval |
value | eval_opt | val eval_opt : t -> atom -> bool option | Returns the valuation of a formula in the current state of the sat solver. | earley-ocaml | unknown | Mc2_core.Solver.Sat_state | Mc2_core.Solver.Sat_state.eval_opt |
value | eval_level | val eval_level : t -> atom -> bool * int | Return the current assignment of the literals, as well as its decision level. If the level is 0, then it is necessary for the atom to have this value; otherwise it is due to choices that can potentially be backtracked.raises UndecidedLit if the literal is not decided | earley-ocaml | unknown | Mc2_core.Solver.Sat_state | Mc2_core.Solver.Sat_state.eval_level |
value | iter_trail | val iter_trail : t -> Mc2_core__.Solver_types.term Iter.t | Iterate through the formulas and terms in order of decision/propagation (starting from the first propagation, to the last propagation). | earley-ocaml | unknown | Mc2_core.Solver.Sat_state | Mc2_core.Solver.Sat_state.iter_trail |
value | model | val model : t -> Mc2_core__.Solver_types.assignment_view list | Returns the model found if the formula is satisfiable. | earley-ocaml | unknown | Mc2_core.Solver.Sat_state | Mc2_core.Solver.Sat_state.model |
value | check_model | val check_model : t -> bool | Check model, or fail | earley-ocaml | unknown | Mc2_core.Solver.Sat_state | Mc2_core.Solver.Sat_state.check_model |
type | null | type t | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom |
value | equal | val equal : t -> t -> bool | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.equal |
value | compare | val compare : t -> t -> int | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.compare |
value | hash | val hash : t -> int | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.hash |
value | same_term | val same_term : t -> t -> bool | same term, ignoring sign? | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.same_term |
value | is_pos | val is_pos : t -> bool | Positive atom? | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.is_pos |
value | is_neg | val is_neg : t -> bool | Positive atom?Negative atom? | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.is_neg |
value | neg | val neg : t -> t | Negative atom?Negation | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.neg |
value | abs | val abs : t -> t | NegationPositive version | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.abs |
value | value | val value : t -> Mc2_core__.Solver_types.value option | Positive version | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.value |
value | mark | val mark : t -> unit | Mark the atom as seen, using fields in the variable. | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.mark |
value | marked | val marked : t -> bool | Mark the atom as seen, using fields in the variable.Returns wether the atom has been marked as seen. | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.marked |
value | unmark | val unmark : t -> unit | Returns wether the atom has been marked as seen. | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.unmark |
value | mark_neg | val mark_neg : t -> unit | Mark negation of the atom | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.mark_neg |
value | unmark_neg | val unmark_neg : t -> unit | Mark negation of the atomUnmark negation of the atom | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.unmark_neg |
value | level | val level : t -> int | decision level of the variable | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.level |
value | reason | val reason : t -> Mc2_core__.Solver_types.reason option | decision level of the variable | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.reason |
value | reason_exn | val reason_exn : t -> Mc2_core__.Solver_types.reason | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.reason_exn |
value | is_true | val is_true : t -> bool | True in current model? | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.is_true |
value | is_false | val is_false : t -> bool | True in current model? | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.is_false |
value | is_undef | val is_undef : t -> bool | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.is_undef |
value | has_some_value | val has_some_value : t -> bool | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.has_some_value |
value | eval | val eval : t -> Mc2_core__.Solver_types.eval_res | Semantically evaluate atom | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.eval |
value | is_absurd | val is_absurd : t -> bool | Semantically evaluate atom | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.is_absurd |
value | can_eval_to_false | val can_eval_to_false : t -> bool | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.can_eval_to_false |
value | term | val term : t -> Mc2_core__.Solver_types.term | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.term |
value | watched | val watched : t -> Mc2_core__.Solver_types.clause Mc2_core__.Vec.t | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.watched |
value | pp | val pp : t CCFormat.printer | nice printer | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.pp |
value | debug | val debug : t CCFormat.printer | nice printervery verbose printer | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom.debug |
module | null | module Tbl : CCHashtbl.S with type key = t | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom |
module | null | module Set : CCSet.S with type elt = t | null | earley-ocaml | unknown | Mc2_core.Atom | Mc2_core.Atom |
type | null | type elt = t | The type of the set elements. | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set |
type | null | type t | The type of sets. | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set |
value | empty | val empty : t | The empty set. | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.Set.add |
value | singleton | val singleton : elt -> t | singleton x returns the one-element set containing only x. | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.Set.remove |
value | union | val union : t -> t -> t | Set union. | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.union |
value | inter | val inter : t -> t -> t | Set intersection. | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.Set.inter |
value | disjoint | val disjoint : t -> t -> bool | Test if two sets are disjoint.since 4.08 | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.Set.diff |
value | cardinal | val cardinal : t -> int | Return the number of elements of a set. | earley-ocaml | unknown | Mc2_core.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.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.Atom.Set | Mc2_core.Atom.Set.fold |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.