package goblint

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

Static analysis framework for C

Install

dune-project

Dependency

goblint.in.tum.de Readme Changelog Edit opam file Versions (9)

Authors

Maintainers

Sources

goblint-2.0.0.tbz

sha256=2f4f2e25b765452f0e336941f35f6cb396d7c213a2d347abe5d35febc5159b1f

sha512=e96af4cad91f6985c8db93c194925853e96cad0ec1a0d9f4d32bbe16d3e5fa1e305f54be02839f21ba89ad2af0c2d5d7aa819ade221ce097dc4dbd0fcd8c8500

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

Module `Analyses.Result`

Parameters

module Range : Printable.S

module C : ResultConf

Signature

include sig ... end

type key = ResultNode.t

val create : int -> 'a Hashtbl.Make(ResultNode).t

val length : 'a Hashtbl.Make(ResultNode).t -> int

val is_empty : 'a Hashtbl.Make(ResultNode).t -> bool

val clear : 'a Hashtbl.Make(ResultNode).t -> unit

val reset : 'a Hashtbl.Make(ResultNode).t -> unit

val copy : 'a Hashtbl.Make(ResultNode).t -> 'a Hashtbl.Make(ResultNode).t

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

val remove : 'a Hashtbl.Make(ResultNode).t -> key -> unit

val remove_all : 'a Hashtbl.Make(ResultNode).t -> key -> unit

val find : 'a Hashtbl.Make(ResultNode).t -> key -> 'a

val find_all : 'a Hashtbl.Make(ResultNode).t -> key -> 'a list

val find_default : 'a Hashtbl.Make(ResultNode).t -> key -> 'a -> 'a

val find_option : 'a Hashtbl.Make(ResultNode).t -> key -> 'a option

val find_opt : 'a Hashtbl.Make(ResultNode).t -> key -> 'a option

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

val mem : 'a Hashtbl.Make(ResultNode).t -> key -> bool

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

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

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

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

val map : 
  (key -> 'b -> 'c) ->
  'b Hashtbl.Make(ResultNode).t ->
  'c Hashtbl.Make(ResultNode).t

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

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

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

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

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

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

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

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

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

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

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

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

val stats : 'a Hashtbl.Make(ResultNode).t -> BatHashtbl.statistics

val to_seq : 'a Hashtbl.Make(ResultNode).t -> (key * 'a) Seq.t

val to_seq_keys : 'a Hashtbl.Make(ResultNode).t -> key Seq.t

val to_seq_values : 'a Hashtbl.Make(ResultNode).t -> 'a Seq.t

val add_seq : 'a Hashtbl.Make(ResultNode).t -> (key * 'a) Seq.t -> unit

val replace_seq : 'a Hashtbl.Make(ResultNode).t -> (key * 'a) Seq.t -> unit

val of_seq : (key * 'a) Seq.t -> 'a Hashtbl.Make(ResultNode).t

val keys : 'a Hashtbl.Make(ResultNode).t -> key BatEnum.t

val values : 'a Hashtbl.Make(ResultNode).t -> 'a BatEnum.t

val enum : 'a Hashtbl.Make(ResultNode).t -> (key * 'a) BatEnum.t

val to_list : 'a Hashtbl.Make(ResultNode).t -> (key * 'a) list

val of_enum : (key * 'a) BatEnum.t -> 'a Hashtbl.Make(ResultNode).t

val of_list : (key * 'a) list -> 'a Hashtbl.Make(ResultNode).t

val print : 
  ?first:string ->
  ?last:string ->
  ?sep:string ->
  ('a BatInnerIO.output -> key -> unit) ->
  ('a BatInnerIO.output -> 'b -> unit) ->
  'a BatInnerIO.output ->
  'b Hashtbl.Make(ResultNode).t ->
  unit

module Exceptionless : sig ... end

module Infix : sig ... end

module Labels : sig ... end

type nonrec t = Range.t Hashtbl.Make(ResultNode).t

val pretty : 
  unit ->
  Range.t Hashtbl.Make(ResultNode).t ->
  GoblintCil.Pretty.doc

include module type of struct include C end

val result_name : string

val printXml : 
  'a BatInnerIO.output ->
  Range.t Hashtbl.Make(ResultNode).t ->
  unit

val printJson : 
  'a BatInnerIO.output ->
  Range.t Hashtbl.Make(ResultNode).t ->
  unit

val printXmlWarning : 'a BatInnerIO.output -> unit -> unit

val output : 
  Range.t Hashtbl.Make(ResultNode).t Lazy.t ->
  'a ->
  (unit BatIO.output -> 'a -> 'b) ->
  GoblintCil.file ->
  unit