package goblint

  1. Overview
  2. Docs
Static analysis framework for C

Install 

dune-project
 Dependency

goblint.in.tum.de Edit opam file Versions (11)

Authors

  1. S
    Simmo Saan
  2. M
    Michael Schwarz
  3. J
    Julian Erhard
  4. S
    Sarah Tilscher
  5. K
    Karoliine Holter
  6. M
    Michael Petter
  7. A
    Ali Rasim Kocal
  8. R
    Ralf Vogler
  9. K
    Kalmer Apinis
  10. V
    Vesal Vojdani

Maintainers

  1. S
    Simmo Saan <simmo.saan@gmail.com>
  2. M
    Michael Schwarz <michael.schwarz93@gmail.com>
  3. K
    Karoliine Holter <karoliine.holter@ut.ee>

Sources

goblint-2.8.0.tbz
sha256=9175eec0143102243964e34a0786584fd590c60422009259c705a89a27f88de4
sha512=9d760007dd8d003cf596516444ed7acc7370fc3d446e75ac71b0176522c3baae090410762f9035e7aae4f6b0e394bf28bb5b1c08ca0476920b94aa919ef04f42

doc/goblint.lib/Goblint_lib/Control/AnalyzeCFG/Result/H/index.html

Module Result.H

type 'a t
val create : int -> 'a t
val length : 'a t -> int
val is_empty : 'a t -> bool
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> MyCFG.node -> 'a -> unit
val remove : 'a t -> MyCFG.node -> unit
val remove_all : 'a t -> MyCFG.node -> unit
val find : 'a t -> MyCFG.node -> 'a
val find_all : 'a t -> MyCFG.node -> 'a list
val find_default : 'a t -> MyCFG.node -> 'a -> 'a
val find_option : 'a t -> MyCFG.node -> 'a option
val find_opt : 'a t -> MyCFG.node -> 'a option
val find_and_remove : 'a t -> MyCFG.node -> 'a option
val find_and_replace : 'a t -> MyCFG.node -> 'a -> 'a option
val replace : 'a t -> MyCFG.node -> 'a -> unit
val mem : 'a t -> MyCFG.node -> bool
val iter : (MyCFG.node -> 'a -> unit) -> 'a t -> unit
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 : (MyCFG.node -> 'b -> 'c) -> 'b t -> 'c t
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 : (MyCFG.node -> 'a -> bool) -> 'a t -> 'a t
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 : MyCFG.node -> ('a -> 'a) -> '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 : 'a t -> (MyCFG.node * 'a) Seq.t
val to_seq_keys : 'a t -> MyCFG.node Seq.t
val to_seq_values : 'a t -> 'a Seq.t
val add_seq : 'a t -> (MyCFG.node * 'a) Seq.t -> unit
val replace_seq : 'a t -> (MyCFG.node * 'a) Seq.t -> unit
val of_seq : (MyCFG.node * 'a) Seq.t -> 'a t
val keys : 'a t -> MyCFG.node BatEnum.t
val values : 'a t -> 'a BatEnum.t
val enum : 'a t -> (MyCFG.node * 'a) BatEnum.t
val to_list : 'a t -> (MyCFG.node * 'a) list
val of_enum : (MyCFG.node * 'a) BatEnum.t -> 'a t
val of_list : (MyCFG.node * 'a) list -> 'a t
val print : ?first:??? -> ?last:??? -> ?sep:??? -> ('a BatInnerIO.output -> MyCFG.node -> unit) -> ('a BatInnerIO.output -> 'b -> unit) -> 'a BatInnerIO.output -> 'b t -> unit
module Exceptionless : sig ... end
module Infix : sig ... end
module Labels : sig ... end