package goblint
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
Static analysis framework for C
Install
Dune Dependency
Authors
Maintainers
Sources
goblint-2.4.0.tbz
sha256=99b78e6def71534d195eef9084baa26d8334b36084e120aa6afb300c9bf8afa6
sha512=f3162bd95a03c00358a2991f6152fc6169205bfb4c55e2c483e98cc3935673df9656d025b6f1ea0fa5f1bd0aee037d4f483966b0d2907e3fa9bf11a93a3392af
doc/goblint_cdomain_value/NullByteSet/MustMaySet/index.html
Module NullByteSet.MustMaySet
include sig ... end
val hash : t -> int
module Set : sig ... end
val empty :
unit ->
[ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val full_set :
unit ->
[ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val is_empty :
mode ->
([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t) ->
bool
val min_elem :
mode ->
([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.M.t) ->
MustSet.M.elt
val min_elem_precise :
([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.M.t) ->
bool
val mem :
mode ->
MustSet.elt ->
([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t) ->
bool
val interval_mem :
mode ->
(MustSet.M.elt * Z.t) ->
([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * 'a) ->
bool
val remove :
mode ->
MustSet.M.elt ->
([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.M.t) ->
Z.t ->
[ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.M.t
val add :
mode ->
MustSet.elt ->
([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t) ->
[ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val add_list : mode -> MaySet.elt list -> ('a * MaySet.t) -> 'a * MaySet.t
val remove_interval :
mode ->
(Z.t * Z.t) ->
Z.t ->
([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * 'a) ->
[ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * 'a
val remove_all :
mode ->
('a * MaySet.t) ->
[ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val is_full_set :
mode ->
([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t) ->
bool
val get_set : mode -> ('a * 'a) -> 'a
val elements :
?max_size:Z.t ->
?min_size:'a ->
mode ->
('b * MaySet.M.t) ->
MaySet.M.elt list
val precise_singleton :
MustSet.elt ->
[ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val make_all_must :
unit ->
[ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val may_can_benefit_from_filter : ('a * MaySet.t) -> bool
val exists :
mode ->
(MaySet.elt -> bool) ->
([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t) ->
bool
val filter :
?min_size:Z.t ->
?max_size:Z.t ->
(MaySet.M.elt -> bool) ->
(MustSet.t * MaySet.M.t) ->
t
val filter_musts :
(MustSet.M.elt -> bool) ->
Z.t ->
([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * 'a) ->
[ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * 'a
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>