qed
Qed.Intmap
Maps with integers keys using Patricia Trees.
From the paper of Chris Okasaki and Andrew Gill: 'Fast Mergeable Integer Maps'.
Pdg_types
frama-c-aorai.core
frama-c-api-generator.core
frama-c-callgraph.core
frama-c-constant_propagation.core
frama-c-dive.core
frama-c-e-acsl.core
frama-c-eva.core
frama-c-eva.gui
frama-c-from.core
frama-c-from.gui
frama-c-impact.core
frama-c-impact.gui
frama-c-inout.core
frama-c-instantiate.core
frama-c-loop-analysis.core
frama-c-markdown-report.core
frama-c-markdown-report.eva-info
frama-c-metrics.core
frama-c-metrics.gui
frama-c-nonterm.core
frama-c-obfuscator.core
frama-c-occurrence.core
frama-c-occurrence.gui
frama-c-pdg.core
frama-c-pdg.types
frama-c-postdominators.core
frama-c-reduc.core
frama-c-report.core
frama-c-rtegen.core
frama-c-rtegen.gui
frama-c-scope.core
frama-c-scope.gui
frama-c-security_slicing.core
frama-c-security_slicing.gui
frama-c-server.core
frama-c-slicing.core
frama-c-slicing.gui
frama-c-sparecode.core
frama-c-studia.core
frama-c-studia.gui
frama-c-users.core
frama-c-variadic.core
frama-c-wp.core
frama-c-wp.gui
frama-c.analysis-scripts
frama-c.boot
frama-c.gui
frama-c.init
frama-c.kernel
frama_c_very_first_cmdline
frama_c_very_first_gui
markdown_report_eva_info
type 'a t
val empty : 'a t
val singleton : int -> 'a -> 'a t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val is_empty : 'a t -> bool
val size : 'a t -> int
val mem : int -> 'a t -> bool
val find : int -> 'a t -> 'a
or raise Not_found
val add : int -> 'a -> 'a t -> 'a t
val remove : int -> 'a t -> 'a t
val insert : (int -> 'a -> 'a -> 'a) -> int -> 'a -> 'a t -> 'a t
insert (fun key v old -> ...) key v map
val change : (int -> 'b -> 'a option -> 'a option) -> int -> 'b -> 'a t -> 'a t
val iter : ('a -> unit) -> 'a t -> unit
val iteri : (int -> 'a -> unit) -> 'a t -> unit
val fold : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val foldi : (int -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val mapl : (int -> 'a -> 'b) -> 'a t -> 'b list
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t
val mapf : (int -> 'a -> 'b option) -> 'a t -> 'b t
val mapq : (int -> 'a -> 'a option) -> 'a t -> 'a t
val filter : (int -> 'a -> bool) -> 'a t -> 'a t
val partition : (int -> 'a -> bool) -> 'a t -> 'a t * 'a t
val partition_split : (int -> 'a -> 'a option * 'a option) -> 'a t -> 'a t * 'a t
val for_all : (int -> 'a -> bool) -> 'a t -> bool
val exists : (int -> 'a -> bool) -> 'a t -> bool
val union : (int -> 'a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val inter : (int -> 'a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
val interf : (int -> 'a -> 'b -> 'c option) -> 'a t -> 'b t -> 'c t
val interq : (int -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val diffq : (int -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val subsetk : 'a t -> 'b t -> bool
val subset : (int -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
val intersect : 'a t -> 'b t -> bool
val intersectf : (int -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
val merge : (int -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
val iter2 : (int -> 'a option -> 'b option -> unit) -> 'a t -> 'b t -> unit
val iterk : (int -> 'a -> 'b -> unit) -> 'a t -> 'b t -> unit
val pp_bits : Format.formatter -> int -> unit
val pp_tree : string -> Format.formatter -> 'a t -> unit