Module Qed.IntsetSource

Set of integers using Patricia Trees.

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

Sourcetype t
Sourceval compare : t -> t -> int
Sourceval equal : t -> t -> bool
Sourceval empty : t
Sourceval singleton : int -> t
Sourceval is_empty : t -> bool
Sourceval cardinal : t -> int
Sourceval elements : t -> int list
Sourceval mem : int -> t -> bool
Sourceval add : int -> t -> t
Sourceval remove : int -> t -> t
Sourceval union : t -> t -> t
Sourceval inter : t -> t -> t
Sourceval diff : t -> t -> t
Sourceval subset : t -> t -> bool
Sourceval iter : (int -> unit) -> t -> unit
Sourceval fold : (int -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval for_all : (int -> bool) -> t -> bool
Sourceval exists : (int -> bool) -> t -> bool
Sourceval filter : (int -> bool) -> t -> t
Sourceval partition : (int -> bool) -> t -> t * t
Sourceval intersect : t -> t -> bool