Module `InferModules.LithoDomain`

module F = Stdlib.Format

module LocalAccessPath : sig ... end: Access path + its parent procedure

module MethodCall : sig ... end: Called procedure + its receiver

module CallSet : module type of sig ... end

include module type of sig ... end

type key = LocalAccessPath.t
type value = CallSet.t
type t = InferModules__AbstractDomain.Map(LocalAccessPath)(CallSet).t

val empty : t
val is_empty : t -> bool
val mem : key -> t -> bool
val add : key -> value -> t -> t
val update : key -> (value option -> value option) -> t -> t
val singleton : key -> value -> t
val remove : key -> t -> t
val merge : (key -> value option -> value option -> value option) -> t -> t -> t
val union : (key -> value -> value -> value option) -> t -> t -> t
val compare : (value -> value -> int) -> t -> t -> int
val equal : (value -> value -> bool) -> t -> t -> bool
val iter : (key -> value -> unit) -> t -> unit
val fold : (key -> value -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (key -> value -> bool) -> t -> bool
val exists : (key -> value -> bool) -> t -> bool
val filter : (key -> value -> bool) -> t -> t
val partition : (key -> value -> bool) -> t -> t * t
val cardinal : t -> int
val bindings : t -> (key * value) list
val min_binding : t -> key * value
val min_binding_opt : t -> (key * value) option
val max_binding : t -> key * value
val max_binding_opt : t -> (key * value) option
val choose : t -> key * value
val choose_opt : t -> (key * value) option
val split : key -> t -> t * value option * t
val find : key -> t -> value
val find_opt : key -> t -> value option
val find_first : (key -> bool) -> t -> key * value
val find_first_opt : (key -> bool) -> t -> (key * value) option
val find_last : (key -> bool) -> t -> key * value
val find_last_opt : (key -> bool) -> t -> (key * value) option
val map : (value -> value) -> t -> t
val mapi : (key -> value -> value) -> t -> t
val is_singleton_or_more : t -> (key * value) InferStdlib.IContainer.singleton_or_more
val pp_key : InferStdlib.PrettyPrintable.F.formatter -> key -> unit
val pp : InferStdlib.PrettyPrintable.F.formatter -> t -> unit
val (<=) : lhs:t -> rhs:t -> bool
val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t
val bottom : t
val is_bottom : t -> bool

val substitute : f_sub:(LocalAccessPath.t -> LocalAccessPath.t option) -> t -> t: Substitute each access path in the domain using f_sub. If f_sub returns None, the original access path is retained; otherwise, the new one is used

val iter_call_chains : f:(InferIR.AccessPath.t -> InferIR.Typ.Procname.t list -> unit) -> t -> unit: Apply f to each maximal call chain encoded in t