functor
(S : sig type t end) (GMap : sig
type key = S.t
type 'a t
val empty : 'a t
val is_empty : 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val cardinal : 'a t -> int
val modify :
key -> ('a option -> 'a) -> 'a t -> 'a t
val find : key -> 'a t -> 'a
val remove : key -> 'a t -> 'a t
val mem : key -> 'a t -> bool
val iter :
(key -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val fold :
(key -> 'a -> 'b -> 'b) ->
'a t -> 'b -> 'b
val compare :
('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal :
('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val merge :
('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val choose_and_remove :
'a t -> key * 'a * 'a t
val filter : ('a -> bool) -> 'a t -> 'a t
val filteri :
(key -> 'a -> bool) -> 'a t -> 'a t
val key_elements : 'a t -> key list
val value_elements : 'a t -> 'a list
val elements : 'a t -> (key * 'a) list
val subset :
('a -> 'a -> bool) -> 'a t -> 'a t -> bool
end) (GSet : sig
type t
type elt = S.t
val empty : t
val is_empty : t -> bool
val singleton : elt -> t
val mem : elt -> t -> bool
val add : elt -> t -> t
val remove : elt -> t -> t
val union : t -> t -> t
val diff : t -> t -> t
val equal : t -> t -> bool
val elements : t -> elt list
val cardinal : t -> int
val iter :
(elt -> unit) -> t -> unit
val fold :
(elt -> 'b -> 'b) ->
t -> 'b -> 'b
val exists :
(elt -> bool) -> t -> bool
val filter :
(elt -> bool) -> t -> t
val inter : t -> t -> t
val of_list : elt list -> t
val of_array : elt array -> t
val subset : t -> t -> bool
end) ->
sig val to_set : 'a GMap.t -> GSet.t end