structure Aesop.UnionFind (α : Type u_1) [BEq α] [Hashable α] : Type u_1

• parents : Array USize
• sizes : Array USize
• toRep : Std.HashMap α USize

instance Aesop.instInhabitedUnionFind {a✝ : Type u_1} {a✝¹ : BEq a✝} {a✝² : Hashable a✝} : Inhabited (UnionFind a✝)

instance Aesop.UnionFind.instEmptyCollection {α : Type u_1} [BEq α] [Hashable α] : EmptyCollection (UnionFind α)

def Aesop.UnionFind.size {α : Type u_1} [BEq α] [Hashable α] (u : UnionFind α) : Nat

def Aesop.UnionFind.add {α : Type u_1} [BEq α] [Hashable α] (x : α) (u : UnionFind α) : UnionFind α

def Aesop.UnionFind.addArray {α : Type u_1} [BEq α] [Hashable α] (xs : Array α) (u : UnionFind α) : UnionFind α

def Aesop.UnionFind.ofArray {α : Type u_1} [BEq α] [Hashable α] (xs : Array α) : UnionFind α

def Aesop.UnionFind.find? {α : Type u_1} [BEq α] [Hashable α] (x : α) (u : UnionFind α) : Option USize × UnionFind α

@[implemented_by _private.Aesop.Util.UnionFind.0.Aesop.UnionFind.mergeUnsafe]

opaque Aesop.UnionFind.merge {α : Type u_1} [BEq α] [Hashable α] (x y : α) : UnionFind α → UnionFind α

def Aesop.UnionFind.sets {α : Type v} [BEq α] [Hashable α] (u : UnionFind α) : Array (Array α) × UnionFind α

def Aesop.cluster {α : Type (max u_1 u_2)} {β : Type u_2} [BEq α] [Hashable α] [BEq β] [Hashable β] (f : α → Array β) (as : Array α) : Array (Array α)

Cluster the as according to which bs are associated to them by f. Two members a₁, a₂ of as are put in the same cluster iff f a₁ ∩ f a₂ ≠ ∅.