Up – Index » goblint » Goblint_lib » Control » AnalyzeCFG » Result » Hval is_empty : 'a t -> bool
val for_all : (MyCFG.node -> 'a -> bool) -> 'a t -> bool
val fold : (MyCFG.node -> 'a -> 'b -> 'b ) -> 'a t -> 'b -> 'b
val exists : (MyCFG.node -> 'a -> bool) -> 'a t -> bool
val map_inplace : (MyCFG.node -> 'a -> 'a ) -> 'a t -> unit
val filter : ('a -> bool) -> 'a t -> 'a t
val filter_inplace : ('a -> bool) -> 'a t -> unit
val filteri_inplace : (MyCFG.node -> 'a -> bool) -> 'a t -> unit
val filter_map : (MyCFG.node -> 'a -> 'b option ) -> 'a t -> 'b t
val filter_map_inplace : (MyCFG.node -> 'a -> 'a option ) -> 'a t -> unit
val modify_def : 'a -> MyCFG.node -> ('a -> 'a ) -> 'a t -> unit
val modify_opt : MyCFG.node -> ('a option -> 'a option ) -> 'a t -> unit
val merge :
(MyCFG.node -> 'a option -> 'b option -> 'c option ) ->
'a t ->
'b t ->
'c t
val merge_all :
(MyCFG.node -> 'a list -> 'b list -> 'c list ) ->
'a t ->
'b t ->
'c t
val stats : 'a t -> BatHashtbl .statistics
val to_seq_values : 'a t -> 'a Stdlib .Seq.t
val add_seq : 'a t -> (MyCFG.node * 'a ) Stdlib .Seq.t -> unit
val replace_seq : 'a t -> (MyCFG.node * 'a ) Stdlib .Seq.t -> unit
val values : 'a t -> 'a BatEnum .t
val print :
?first :string ->
?last :string ->
?sep :string ->
('a BatInnerIO .output -> MyCFG.node -> unit) ->
('a BatInnerIO .output -> 'b -> unit) ->
'a BatInnerIO .output ->
'b t ->
unit
module Infix : sig ... end