package frama-c

You can search for identifiers within the package.

in-package search v0.2.0

Platform dedicated to the analysis of source code written in C

Install

Dune Dependency

frama-c.com Readme Edit opam file Versions (23)

Authors

Maintainers

F

frama-ci-bot@frama-c.com

Sources

frama-c-29.0-Copper.tar.gz

sha256=d2fbb3b8d0ff83945872e9e6fa258e934a706360e698dae3b4d5f971addf7493

doc/frama-c.kernel/Frama_c_kernel/Locations/Zone/Hashtbl/index.html

Module `Zone.Hashtbl`

see https://frama-c.com/download/frama-c-plugin-development-guide.pdf

include Datatype.Hashtbl_with_descr with type key = t

include FCHashtbl.S with type key = t

include Hashtbl.S with type key = t

type key = t

type !'a t

val create : int -> 'a t

val clear : 'a t -> unit

val reset : 'a t -> unit

since 4.00

val copy : 'a t -> 'a t

val add : 'a t -> key -> 'a -> unit

val remove : 'a t -> key -> unit

val find : 'a t -> key -> 'a

val find_all : 'a t -> key -> 'a list

val replace : 'a t -> key -> 'a -> unit

val mem : 'a t -> key -> bool

val iter : (key -> 'a -> unit) -> 'a t -> unit

val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit

since 4.03

val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

val length : 'a t -> int

val stats : 'a t -> Hashtbl.statistics

since 4.00

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

since 4.07

val to_seq_keys : _ t -> key Seq.t

since 4.07

val to_seq_values : 'a t -> 'a Seq.t

since 4.07

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

since 4.07

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

since 4.07

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

since 4.07

val iter_sorted : 
  ?cmp:(key -> key -> int) ->
  (key -> 'a -> unit) ->
  'a t ->
  unit

Iter on the hashtbl, but respecting the order on keys induced by cmp. Use Stdlib.compare if cmp not given.

If the table contains several bindings for the same key, they are passed to f in reverse order of introduction, that is, the most recent binding is passed first.

val fold_sorted : 
  ?cmp:(key -> key -> int) ->
  (key -> 'a -> 'b -> 'b) ->
  'a t ->
  'b ->
  'b

Fold on the hashtbl, but respecting the order on keys induced by cmp. Use Stdlib.compare if cmp not given.

If the table contains several bindings for the same key, they are passed to f in reverse order of introduction, that is, the most recent binding is passed first.

val iter_sorted_by_entry : 
  cmp:((key * 'a) -> (key * 'a) -> int) ->
  (key -> 'a -> unit) ->
  'a t ->
  unit

val fold_sorted_by_entry : 
  cmp:((key * 'a) -> (key * 'a) -> int) ->
  (key -> 'a -> 'b -> 'b) ->
  'a t ->
  'b ->
  'b

Iter or fold on the hashtable, respecting the order on entries given by cmp. The table may contains several bindings for the same key.

val iter_sorted_by_value : 
  cmp:('a -> 'a -> int) ->
  (key -> 'a -> unit) ->
  'a t ->
  unit

val fold_sorted_by_value : 
  cmp:('a -> 'a -> int) ->
  (key -> 'a -> 'b -> 'b) ->
  'a t ->
  'b ->
  'b

Iter or fold on the hashtable, respecting the order on entries given by cmp. The relative order for entries whose values is equal according to cmp, is not specified.

val find_opt : 'a t -> key -> 'a option

val find_def : 'a t -> key -> 'a -> 'a

val memo : 'a t -> key -> (key -> 'a) -> 'a

memo tbl k f returns the binding of k in tbl. If there is no binding, add the binding f k associated to k in tbl and return it.

since Chlorine-20180501

val structural_descr : Structural_descr.t -> Structural_descr.t

val make_type : 'a Type.t -> 'a t Type.t

since Fluorine-20130401

module Key : Datatype.S with type t = key

Datatype for the keys of the hashtbl.

module Make (Data : Datatype.S) : Datatype.S with type t = Data.t t

Build a datatype of the hashtbl according to the datatype of values in the hashtbl.