Up – infer » Checkers » ReachingDefs » DefsModule ReachingDefs.Defs
The node in which the reaching definition x := e is defined.
A definition x :=e, declared at node N, reaches the current node if there is a path from node N to the current node such that x is not modified along the path *
val mem : elt -> t -> bool
val remove : elt -> t -> t
val disjoint : t -> t -> bool
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a ) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option ) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val elements : t -> elt list
val min_elt_opt : t -> elt option
val max_elt_opt : t -> elt option
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Stdlib .Seq.t
val to_seq : t -> elt Stdlib .Seq.t
val to_rev_seq : t -> elt Stdlib .Seq.t
val add_seq : elt Stdlib .Seq.t -> t -> t
val of_seq : elt Stdlib .Seq.t -> t
val pp_element : IStdlib__PrettyPrintable .F.formatter -> elt -> unit
val pp : IStdlib__PrettyPrintable .F.formatter -> t -> unit
val leq : lhs :t -> rhs :t -> bool
val widen : prev :t -> next :t -> num_iters :int -> t
val is_bottom : t -> bool