Module Cduce_types__Ident.IdSet
Sets of identifiers, implemented as sorted lists. This representation is used when structural equality of equal sets is needed.
val singleton : Elem.t -> tval iter : (Elem.t -> unit) -> t -> unitval filter : (Elem.t -> bool) -> t -> tval exists : (Elem.t -> bool) -> t -> boolval fold : ('a -> Elem.t -> 'a) -> 'a -> t -> 'aval pick : t -> Elem.t optionval choose : t -> Elem.tval length : t -> intval empty : tval is_empty : t -> boolval from_list : Elem.t list -> tval add : Elem.t -> t -> tval remove : Elem.t -> t -> tval disjoint : t -> t -> boolval cup : t -> t -> tval split : t -> t -> t * t * tval cap : t -> t -> tval diff : t -> t -> tval subset : t -> t -> boolval map : (Elem.t -> Elem.t) -> t -> tval mem : t -> Elem.t -> bool
module Map : sig ... end