package frama-c

  1. Overview
  2. Docs
package frama-c
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module Qed.IntmapSource

Maps with integers keys using Patricia Trees.

From the paper of Chris Okasaki and Andrew Gill: 'Fast Mergeable Integer Maps'.

Sourcetype 'a t
Sourceval empty : 'a t
Sourceval singleton : int -> 'a -> 'a t
Sourceval compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
Sourceval equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
Sourceval is_empty : 'a t -> bool
Sourceval size : 'a t -> int
Sourceval mem : int -> 'a t -> bool
Sourceval find : int -> 'a t -> 'a

or raise Not_found

Sourceval add : int -> 'a -> 'a t -> 'a t
Sourceval remove : int -> 'a t -> 'a t
Sourceval insert : (int -> 'a -> 'a -> 'a) -> int -> 'a -> 'a t -> 'a t

insert (fun key v old -> ...) key v map

Sourceval change : (int -> 'b -> 'a option -> 'a option) -> int -> 'b -> 'a t -> 'a t
Sourceval iter : ('a -> unit) -> 'a t -> unit
Sourceval iteri : (int -> 'a -> unit) -> 'a t -> unit
Sourceval fold : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
Sourceval foldi : (int -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
Sourceval mapl : (int -> 'a -> 'b) -> 'a t -> 'b list
Sourceval map : ('a -> 'b) -> 'a t -> 'b t
Sourceval mapi : (int -> 'a -> 'b) -> 'a t -> 'b t
Sourceval mapf : (int -> 'a -> 'b option) -> 'a t -> 'b t
Sourceval mapq : (int -> 'a -> 'a option) -> 'a t -> 'a t
Sourceval filter : (int -> 'a -> bool) -> 'a t -> 'a t
Sourceval partition : (int -> 'a -> bool) -> 'a t -> 'a t * 'a t
Sourceval partition_split : (int -> 'a -> 'a option * 'a option) -> 'a t -> 'a t * 'a t
Sourceval for_all : (int -> 'a -> bool) -> 'a t -> bool
Sourceval exists : (int -> 'a -> bool) -> 'a t -> bool
Sourceval union : (int -> 'a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
Sourceval inter : (int -> 'a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
Sourceval interf : (int -> 'a -> 'b -> 'c option) -> 'a t -> 'b t -> 'c t
Sourceval interq : (int -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
Sourceval diffq : (int -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
Sourceval subsetk : 'a t -> 'b t -> bool
Sourceval subset : (int -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
Sourceval intersect : 'a t -> 'b t -> bool
Sourceval intersectf : (int -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
Sourceval merge : (int -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
Sourceval iter2 : (int -> 'a option -> 'b option -> unit) -> 'a t -> 'b t -> unit
Sourceval iterk : (int -> 'a -> 'b -> unit) -> 'a t -> 'b t -> unit
Sourceval pp_bits : Format.formatter -> int -> unit
Sourceval pp_tree : string -> Format.formatter -> 'a t -> unit
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct