Module `Absint__AbstractDomain.FiniteMultiMap`

Parameters

Signature

include WithBottom

include S

include NoJoin

include IStdlib.PrettyPrintable.PrintableType

type t

val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit

val leq : lhs:t -> rhs:t -> bool: the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t

val bottom : t: The bottom value of the domain.

val is_bottom : t -> bool: Return true if this is the bottom value

val add : Key.t -> Value.t -> t -> t
val mem : Key.t -> t -> bool
val remove : Key.t -> Value.t -> t -> t
val fold : (Key.t -> Value.t -> 'a -> 'a) -> t -> 'a -> 'a
val filter : (Key.t -> Value.t -> bool) -> t -> t