package goblint

You can search for identifiers within the package.

in-package search v0.2.0

Static analysis framework for C

Install

Dune Dependency

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

Authors

Maintainers

Sources

goblint-2.3.0.tbz

sha256=b729c94adb383a39aea32eb005c988dfd44b92af22ee6a4eedf4239542ac6c26

sha512=643b98770e5fe5644324c95c9ae3a9f698f25c8b11b298f0751d524e0b20af368b2a465fc8200b75a73d48fc9a053fd90f5e8920d4db070927f93188bb8687e0

doc/goblint.lib/Goblint_lib/DisjointDomain/CombinedSet/index.html

Module `DisjointDomain.CombinedSet`

Set of elements E.t grouped into buckets by RC, where each bucket is described by the set B.

Parameters

module E : Printable.S

module B : SetDomain.S with type elt = E.t

module RC : RepresentativeCongruence with type elt = E.t

Signature

type t = ProjectiveSet(E)(PairwiseSet(E)(B)(RC))(RC).t

val equal : t -> t -> bool

val hash : t -> int

val compare : t -> t -> int

val show : t -> string

val pretty : unit -> t -> Printable.Pretty.doc

val printXml : 'a BatInnerIO.output -> t -> unit

val name : unit -> string

val to_yojson : t -> Yojson.Safe.t

val tag : t -> int

val arbitrary : unit -> t QCheck.arbitrary

val relift : t -> t

val leq : t -> t -> bool

val join : t -> t -> t

val meet : t -> t -> t

val widen : t -> t -> t

val narrow : t -> t -> t

val pretty_diff : unit -> (t * t) -> Lattice.Pretty.doc

val bot : unit -> t

val is_bot : t -> bool

val top : unit -> t

val is_top : t -> bool

type elt = E.t

val empty : unit -> t

val is_empty : t -> bool

val mem : elt -> t -> bool

val add : elt -> t -> t

val singleton : elt -> t

val remove : elt -> t -> t

val union : t -> t -> t

val inter : t -> t -> t

val diff : t -> t -> t

val subset : t -> t -> bool

val disjoint : t -> t -> bool

val iter : (elt -> unit) -> t -> unit

val map : (elt -> elt) -> t -> t

val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a

val for_all : (elt -> bool) -> t -> bool

val exists : (elt -> bool) -> t -> bool

val filter : (elt -> bool) -> t -> t

val partition : (elt -> bool) -> t -> t * t

val cardinal : t -> int

val elements : t -> elt list

val of_list : elt list -> t

val min_elt : t -> elt

val max_elt : t -> elt

val choose : t -> elt

val fold_buckets : 
  (RC.t -> PairwiseSet(E)(B)(RC).t -> 'a -> 'a) ->
  t ->
  'a ->
  'a

On This Page

Parameters
Signature