AbstractDomain.Map
Map domain ordered by union over the set of bindings, so the bottom element is the empty map. Every element implicitly maps to bottom unless it is explicitly bound to something else
module ValueDomain : S
include IStdlib.PrettyPrintable.PPMonoMap
with type key = Key.t
with type value = ValueDomain.t
include IStdlib.PrettyPrintable.MonoMap
with type key = Key.t
with type value = ValueDomain.t
type key = Key.t
type value = ValueDomain.t
val empty : t
val is_empty : t -> bool
val cardinal : t -> int
val is_singleton_or_more :
t ->
(key * value) IStdlib.IContainer.singleton_or_more
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp_key : IStdlib.PrettyPrintable.F.formatter -> key -> unit
include WithBottom with type t := t
include S with type t := t
include Comparable with type t := t
include IStdlib.PrettyPrintable.PrintableType with type t := t
val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit
val bottom : t
The bottom value of the domain.
val is_bottom : t -> bool
Return true if this is the bottom value