Qed.Intmap
Maps with integers keys using Patricia Trees.
From the paper of Chris Okasaki and Andrew Gill: 'Fast Mergeable Integer Maps'.
val empty : 'a t
val singleton : int -> 'a -> 'a t
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
insert (fun key v old -> ...) key v map
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 for_all : ( int -> 'a -> bool ) -> 'a t -> bool
val exists : ( int -> 'a -> bool ) -> 'a t -> bool
val pp_tree : string -> Stdlib.Format.formatter -> 'a t -> unit