sig
type elt = Ldap_schema.Oid.t
type t = Set.Make(Oid).t
val empty : Ldap_schema.Oidset.t
val is_empty : Ldap_schema.Oidset.t -> bool
val mem : Ldap_schema.Oidset.elt -> Ldap_schema.Oidset.t -> bool
val add :
Ldap_schema.Oidset.elt -> Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t
val singleton : Ldap_schema.Oidset.elt -> Ldap_schema.Oidset.t
val remove :
Ldap_schema.Oidset.elt -> Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t
val union :
Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t
val inter :
Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t
val diff :
Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t
val compare : Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t -> int
val equal : Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t -> bool
val subset : Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t -> bool
val iter : (Ldap_schema.Oidset.elt -> unit) -> Ldap_schema.Oidset.t -> unit
val fold :
(Ldap_schema.Oidset.elt -> 'a -> 'a) -> Ldap_schema.Oidset.t -> 'a -> 'a
val for_all :
(Ldap_schema.Oidset.elt -> bool) -> Ldap_schema.Oidset.t -> bool
val exists :
(Ldap_schema.Oidset.elt -> bool) -> Ldap_schema.Oidset.t -> bool
val filter :
(Ldap_schema.Oidset.elt -> bool) ->
Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t
val partition :
(Ldap_schema.Oidset.elt -> bool) ->
Ldap_schema.Oidset.t -> Ldap_schema.Oidset.t * Ldap_schema.Oidset.t
val cardinal : Ldap_schema.Oidset.t -> int
val elements : Ldap_schema.Oidset.t -> Ldap_schema.Oidset.elt list
val min_elt : Ldap_schema.Oidset.t -> Ldap_schema.Oidset.elt
val max_elt : Ldap_schema.Oidset.t -> Ldap_schema.Oidset.elt
val choose : Ldap_schema.Oidset.t -> Ldap_schema.Oidset.elt
val split :
Ldap_schema.Oidset.elt ->
Ldap_schema.Oidset.t ->
Ldap_schema.Oidset.t * bool * Ldap_schema.Oidset.t
end