containers
Equiv.Make
abstraction
ast
bitfields
c
c_common
c_lang
cfg
combiner
combiners
combiners_common
config
congUtils
core
cpython
domain
engines
framework
heap
hooks
interactive
intervals
itvUtils
lang
lattices
mopsa
mopsa.c_stubs_parser
mopsa.mopsa_analyzer
mopsa.mopsa_analzyer
mopsa.mopsa_build_db
mopsa.mopsa_c_parser
mopsa.mopsa_c_stubs_parser
mopsa.mopsa_py_parser
mopsa.mopsa_universal_parser
mopsa.mopsa_utils
numeric_common
numeric_reductions
numeric_values
output
params
parsing
passes
powersets
python
python_lang
reduction
relational
repl
sig
stubs
toplevel
universal
universal_interproc
universal_iterators
universal_numeric
utils_core
value
module L : OrderedType
module R : OrderedType
exception Already_Paired
module LR : sig ... end
module RL : sig ... end
type t = {
lr : R.t LR.t;
rl : L.t RL.t;
}
val compare : t -> t -> int
val empty : t
val fold : ((L.t * R.t) -> 'a -> 'a) -> t -> 'a -> 'a
val iter : ((L.t * R.t) -> unit) -> t -> unit
val remove_l : L.t -> t -> t
val remove_r : R.t -> t -> t
val add : (L.t * R.t) -> t -> t
val mem : (L.t * R.t) -> t -> bool
val concat : t -> t -> t
val mem_l : L.t -> t -> bool
val mem_r : R.t -> t -> bool
val find_l : LR.key -> t -> R.t
val find_r : RL.key -> t -> L.t
val find_l_opt : L.t -> t -> R.t option
val find_r_opt : R.t -> t -> L.t option
val map : ((L.t * R.t) -> L.t * R.t) -> t -> t
val filter : ((L.t * R.t) -> bool) -> t -> t
val exists : ((L.t * R.t) -> bool) -> t -> bool
val forall : ((L.t * R.t) -> bool) -> t -> bool