Module InferModules.ArrayBlk

module ArrInfo : sig ... end
include sig ... end
val mem : key ‑> 'a t ‑> bool
val add : key ‑> 'a ‑> 'a t ‑> 'a t
val update : key ‑> ('a option ‑> 'a option) ‑> 'a t ‑> 'a t
val singleton : key ‑> 'a ‑> 'a t
val remove : key ‑> 'a t ‑> 'a t
val merge : (key ‑> 'a option ‑> 'b option ‑> 'c option) ‑> 'a t ‑> 'b t ‑> 'c t
val union : (key ‑> 'a ‑> 'a ‑> 'a option) ‑> 'a t ‑> 'a t ‑> 'a t
val compare : ('a ‑> 'a ‑> int) ‑> 'a t ‑> 'a t ‑> int
val equal : ('a ‑> 'a ‑> bool) ‑> 'a t ‑> 'a t ‑> bool
val iter : (key ‑> 'a ‑> unit) ‑> 'a t ‑> unit
val fold : (key ‑> 'a ‑> 'b ‑> 'b) ‑> 'a t ‑> 'b ‑> 'b
val for_all : (key ‑> 'a ‑> bool) ‑> 'a t ‑> bool
val exists : (key ‑> 'a ‑> bool) ‑> 'a t ‑> bool
val filter : (key ‑> 'a ‑> bool) ‑> 'a t ‑> 'a t
val partition : (key ‑> 'a ‑> bool) ‑> 'a t ‑> 'a t * 'a t
val cardinal : 'a t ‑> int
val bindings : 'a t ‑> (key * 'a) list
val min_binding : 'a t ‑> key * 'a
val min_binding_opt : 'a t ‑> (key * 'a) option
val max_binding : 'a t ‑> key * 'a
val max_binding_opt : 'a t ‑> (key * 'a) option
val choose : 'a t ‑> key * 'a
val choose_opt : 'a t ‑> (key * 'a) option
val split : key ‑> 'a t ‑> 'a t * 'a option * 'a t
val find : key ‑> 'a t ‑> 'a
val find_opt : key ‑> 'a t ‑> 'a option
val find_first : (key ‑> bool) ‑> 'a t ‑> key * 'a
val find_first_opt : (key ‑> bool) ‑> 'a t ‑> (key * 'a) option
val find_last : (key ‑> bool) ‑> 'a t ‑> key * 'a
val find_last_opt : (key ‑> bool) ‑> 'a t ‑> (key * 'a) option
val map : ('a ‑> 'b) ‑> 'a t ‑> 'b t
val mapi : (key ‑> 'a ‑> 'b) ‑> 'a t ‑> 'b t
val pp_key : InferStdlib__PrettyPrintable.F.formatter ‑> key ‑> unit
type astate = ArrInfo.astate t
val (<=) : lhs:astate ‑> rhs:astate ‑> bool
val join : astate ‑> astate ‑> astate
val widen : prev:astate ‑> next:astate ‑> num_iters:int ‑> astate
val pp : InferModules__AbstractDomain.F.formatter ‑> astate ‑> unit
val empty : astate
val is_empty : astate ‑> bool
val bot : astate
val unknown : astate
val is_bot : astate ‑> bool
val make : InferModules.AbsLoc.Allocsite.t ‑> offset:Itv.t ‑> size:Itv.t ‑> stride:Itv.t ‑> astate
val offsetof : astate ‑> Itv.t
val sizeof : astate ‑> Itv.t
val plus_offset : astate ‑> Itv.t ‑> astate
val minus_offset : astate ‑> Itv.t ‑> astate
val diff : astate ‑> astate ‑> Itv.t
val get_pow_loc : astate ‑> AbsLoc.PowLoc.t
val subst : astate ‑> Itv.Bound.t AbstractDomain.Types.bottom_lifted InferModules.Itv.SymbolMap.t ‑> astate
val get_symbols : astate ‑> Itv.Symbol.t list
val normalize : astate ‑> astate
val do_prune : (ArrInfo.t ‑> ArrInfo.t ‑> ArrInfo.t) ‑> astate ‑> astate ‑> astate
val prune_comp : InferIR.Binop.t ‑> astate ‑> astate ‑> astate
val prune_eq : astate ‑> astate ‑> astate
val prune_ne : astate ‑> astate ‑> astate
val set_size : Itv.t ‑> astate ‑> astate