Module `Result.Labels`

val add : 'a Stdlib.Hashtbl.Make(ResultNode).t -> key:key -> data:'a -> unit

val replace : 
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  key:key ->
  data:'a ->
  unit

val iter : 
  f:(key:key -> data:'a -> unit) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  unit

val for_all : 
  f:(key:key -> data:'a -> bool) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  bool

val map : 
  f:(key:key -> data:'a -> 'b) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  'b Stdlib.Hashtbl.Make(ResultNode).t

val map_inplace : 
  f:(key:key -> data:'a -> 'a) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  unit

val filter : 
  f:('a -> bool) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  'a Stdlib.Hashtbl.Make(ResultNode).t

val filter_inplace : 
  f:('a -> bool) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  unit

val filteri : 
  f:(key:key -> data:'a -> bool) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  'a Stdlib.Hashtbl.Make(ResultNode).t

val filteri_inplace : 
  f:(key:key -> data:'a -> bool) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  unit

val filter_map : 
  f:(key:key -> data:'a -> 'b option) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  'b Stdlib.Hashtbl.Make(ResultNode).t

val filter_map_inplace : 
  f:(key:key -> data:'a -> 'a option) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  unit

val fold : 
  f:(key:key -> data:'a -> 'b -> 'b) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  init:'b ->
  'b

val exists : 
  f:(key:key -> data:'a -> bool) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  bool

val modify : 
  key:key ->
  f:('a -> 'a) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  unit

val modify_def : 
  default:'a ->
  key:key ->
  f:('a -> 'a) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  unit

val modify_opt : 
  key:key ->
  f:('a option -> 'a option) ->
  'a Stdlib.Hashtbl.Make(ResultNode).t ->
  unit

val merge : 
  f:(key -> 'a option -> 'b option -> 'c option) ->
  left:'a Stdlib.Hashtbl.Make(ResultNode).t ->
  right:'b Stdlib.Hashtbl.Make(ResultNode).t ->
  'c Stdlib.Hashtbl.Make(ResultNode).t

val merge_all : 
  f:(key -> 'a list -> 'b list -> 'c list) ->
  left:'a Stdlib.Hashtbl.Make(ResultNode).t ->
  right:'b Stdlib.Hashtbl.Make(ResultNode).t ->
  'c Stdlib.Hashtbl.Make(ResultNode).t

Install

Dune Dependency

Authors

Maintainers

Sources

doc/goblint.lib/Goblint_lib/Analyses/Result/Labels/index.html

Module `Result.Labels`

package goblint

Install

Dune Dependency

Authors

Maintainers

Sources

doc/goblint.lib/Goblint_lib/Analyses/Result/Labels/index.html

Module Result.Labels

Module `Result.Labels`