Memory (infer.Pulselib.PulseCanonValue.Make.Memory)

module Access : Pulselib.PulseBasicInterface.Access.S with type key := t

module Edges : sig ... end

include IStdlib.PrettyPrintable.PPMonoMap
  with type key := t
   and type value = Edges.t
  with type t = PulseBaseMemory.t

include IStdlib.PrettyPrintable.MonoMap
  with type key := t
  with type value = Edges.t
  with type t = PulseBaseMemory.t

type value = Edges.t

type t = PulseBaseMemory.t

val empty : t

val is_empty : t -> bool

val mem : t -> t -> bool

val add : t -> value -> t -> t

val update : t -> (value option -> value option) -> t -> t

val singleton : t -> value -> t

val remove : t -> t -> t

val merge : (t -> value option -> value option -> value option) -> t -> t -> t

val union : (t -> value -> value -> value option) -> t -> t -> t

val iter : (t -> value -> unit) -> t -> unit

val fold : (t -> value -> 'a -> 'a) -> t -> 'a -> 'a

val for_all : (t -> value -> bool) -> t -> bool

val exists : (t -> value -> bool) -> t -> bool

val filter : (t -> value -> bool) -> t -> t

val filter_map : (t -> value -> value option) -> t -> t

val partition : (t -> value -> bool) -> t -> t * t

val cardinal : t -> int

val bindings : t -> (t * value) list

val min_binding : t -> t * value

val min_binding_opt : t -> (t * value) option

val max_binding : t -> t * value

val max_binding_opt : t -> (t * value) option

val choose : t -> t * value

val choose_opt : t -> (t * value) option

val split : t -> t -> t * value option * t

val find : t -> t -> value

val find_opt : t -> t -> value option

val find_first : (t -> bool) -> t -> t * value

val find_first_opt : (t -> bool) -> t -> (t * value) option

val find_last : (t -> bool) -> t -> t * value

val find_last_opt : (t -> bool) -> t -> (t * value) option

val map : (value -> value) -> t -> t

val mapi : (t -> value -> value) -> t -> t

val is_singleton_or_more : 
  t ->
  (t * value) IStdlib.IContainer.singleton_or_more

val fold_map : t -> init:'a -> f:('a -> value -> 'a * value) -> 'a * t

val fold_mapi : t -> init:'a -> f:(t -> 'a -> value -> 'a * value) -> 'a * t

val of_seq : (t * value) Stdlib.Seq.t -> t

val to_seq : t -> (t * value) Stdlib.Seq.t

include IStdlib.PrettyPrintable.PrintableType with type t := t

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

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

val compare : t -> t -> int

val equal : t -> t -> bool

val register_address : t -> t -> t

val add_edge : 
  t ->
  Access.t ->
  (Pulselib.PulseBasicInterface.AbstractValue.t
   * Pulselib.PulseBasicInterface.ValueHistory.t) ->
  t ->
  t

val find_edge_opt : 
  ?get_var_repr:
    (Pulselib.PulseBasicInterface.AbstractValue.t ->
      Pulselib.PulseBasicInterface.AbstractValue.t) ->
  t ->
  Access.t ->
  t ->
  (needs_canon * Pulselib.PulseBasicInterface.ValueHistory.t) option

val has_edge : t -> Access.t -> t -> bool

val is_allocated : t -> t -> bool

whether the address has a non-empty set of edges