Module Make.Set
include Flambda2_algorithms.Container_types.Set
with type elt = int
and type t = Flambda2_algorithms.Patricia_tree.set
val empty : Set.tval is_empty : Set.t -> boolunion_sharing s1 s2 is union s1 s2, with maximal sharing of the result with s1.
union_shared s1 s2 is union_sharing s1 s2, with a fast path for shared subsets of s1 and s2.
diff_sharing s1 s2 is diff s1 s2, with maximal sharing of the result with s1.
diff_shared s1 s2 is diff_sharing s1 s2, with a fast path for shared subsets of s1 and s2.
val cardinal : Set.t -> intval to_seq : Set.t -> Set.elt Stdlib.Seq.tval print : Stdlib.Format.formatter -> Set.t -> unitval to_string : Set.t -> stringval valid : Set.t -> boolFor testing; should always return true