Qed.Intset
Set of integers using Patricia Trees.
From the paper of Chris Okasaki and Andrew Gill: 'Fast Mergeable Integer Maps'.
val empty : t
val singleton : int -> t
val is_empty : t -> bool
val cardinal : t -> int
val elements : t -> int list
val mem : int -> t -> bool
val iter : ( int -> unit ) -> t -> unit
val fold : ( int -> 'a -> 'a ) -> t -> 'a -> 'a
val for_all : ( int -> bool ) -> t -> bool
val exists : ( int -> bool ) -> t -> bool