Up – Index » goblint » Goblint_lib » Control » AnalyzeCFG » Result » Hval is_empty : 'a t -> boolval for_all : (MyCFG.node -> 'a -> bool) -> 'a t -> boolval fold : (MyCFG.node -> 'a -> 'b -> 'b ) -> 'a t -> 'b -> 'b val exists : (MyCFG.node -> 'a -> bool) -> 'a t -> boolval map_inplace : (MyCFG.node -> 'a -> 'a ) -> 'a t -> unitval filter : ('a -> bool) -> 'a t -> 'a t val filter_inplace : ('a -> bool) -> 'a t -> unitval filteri_inplace : (MyCFG.node -> 'a -> bool) -> 'a t -> unitval filter_map : (MyCFG.node -> 'a -> 'b option ) -> 'a t -> 'b t val filter_map_inplace : (MyCFG.node -> 'a -> 'a option ) -> 'a t -> unitval modify_def : 'a -> MyCFG.node -> ('a -> 'a ) -> 'a t -> unitval modify_opt : MyCFG.node -> ('a option -> 'a option ) -> 'a t -> unitval 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 .statisticsval to_seq_values : 'a t -> 'a Stdlib .Seq.tval add_seq : 'a t -> (MyCFG.node * 'a ) Stdlib .Seq.t -> unitval replace_seq : 'a t -> (MyCFG.node * 'a ) Stdlib .Seq.t -> unitval values : 'a t -> 'a BatEnum .tval print :
?first :string ->
?last :string ->
?sep :string ->
('a BatInnerIO .output -> MyCFG.node -> unit) ->
('a BatInnerIO .output -> 'b -> unit) ->
'a BatInnerIO .output ->
'b t ->
unitmodule Infix : sig ... end