package msat

You can search for identifiers within the package.

in-package search v0.2.0

Library containing a SAT solver that can be parametrized by a theory

Install

dune-project

Dependency

github.com Readme Changelog Edit opam file Versions (16)

Authors

Maintainers

Sources

v0.9.tar.gz

md5=8ee967a889188d8d937e3c1ca2c50deb

sha512=5185e02f2f41a3672afaf64b47ddf6efd787811a73f0286a670a64783a86a9c422c4a874c48884622961354105283b60223562025f1fa21edba67f0eb8cb172b

doc/msat.backend/Msat_backend/Coq/Simple/argument-1-S/Proof/Tbl/index.html

Module `Proof.Tbl`

type key = t

type !'a t

val create : int -> 'a t

val clear : 'a t -> unit

val reset : 'a t -> unit

since 4.00

val copy : 'a t -> 'a t

val add : 'a t -> key -> 'a -> unit

val remove : 'a t -> key -> unit

val find : 'a t -> key -> 'a

val find_opt : 'a t -> key -> 'a option

since 4.05

val find_all : 'a t -> key -> 'a list

val replace : 'a t -> key -> 'a -> unit

val mem : 'a t -> key -> bool

val iter : (key -> 'a -> unit) -> 'a t -> unit

val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit

since 4.03

val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

val length : 'a t -> int

val stats : 'a t -> Hashtbl.statistics

since 4.00

val to_seq : 'a t -> (key * 'a) Seq.t

since 4.07

val to_seq_keys : _ t -> key Seq.t

since 4.07

val to_seq_values : 'a t -> 'a Seq.t

since 4.07

val add_seq : 'a t -> (key * 'a) Seq.t -> unit

since 4.07

val replace_seq : 'a t -> (key * 'a) Seq.t -> unit

since 4.07

val of_seq : (key * 'a) Seq.t -> 'a t

since 4.07