structure Lean.PersistentHashSet (α : Type u) [BEq α] [Hashable α] : Type u

• set : Lean.PersistentHashMap α Unit

@[inline, reducible]

abbrev Lean.PHashSet (α : Type u) [BEq α] [Hashable α] : Type u

@[inline]

def Lean.PersistentHashSet.empty {α : Type u_1} [BEq α] [Hashable α] : Lean.PersistentHashSet α

instance Lean.PersistentHashSet.instInhabitedPersistentHashSet {α : Type u_1} [BEq α] [Hashable α] : Inhabited (Lean.PersistentHashSet α)

instance Lean.PersistentHashSet.instEmptyCollectionPersistentHashSet {α : Type u_1} [BEq α] [Hashable α] : EmptyCollection (Lean.PersistentHashSet α)

@[inline]

def Lean.PersistentHashSet.isEmpty {α : Type u_1} : {x : BEq α} → {x_1 : Hashable α} → Lean.PersistentHashSet α → Bool

@[inline]

def Lean.PersistentHashSet.insert {α : Type u_1} : {x : BEq α} → {x_1 : Hashable α} → Lean.PersistentHashSet α → α → Lean.PersistentHashSet α

@[inline]

def Lean.PersistentHashSet.erase {α : Type u_1} : {x : BEq α} → {x_1 : Hashable α} → Lean.PersistentHashSet α → α → Lean.PersistentHashSet α

@[inline]

def Lean.PersistentHashSet.find? {α : Type u_1} : {x : BEq α} → {x_1 : Hashable α} → Lean.PersistentHashSet α → α → Option α

@[inline]

def Lean.PersistentHashSet.contains {α : Type u_1} : {x : BEq α} → {x_1 : Hashable α} → Lean.PersistentHashSet α → α → Bool

@[inline]

def Lean.PersistentHashSet.size {α : Type u_1} : {x : BEq α} → {x_1 : Hashable α} → Lean.PersistentHashSet α → Nat

@[inline]

def Lean.PersistentHashSet.foldM {α : Type u_1} : {x : BEq α} → {x_1 : Hashable α} → {β : Type v} → {m : Type v → Type v} → [inst : Monad m] → (β → α → m β) → β → Lean.PersistentHashSet α → m β

@[inline]

def Lean.PersistentHashSet.fold {α : Type u_1} : {x : BEq α} → {x_1 : Hashable α} → {β : Type v} → (β → α → β) → β → Lean.PersistentHashSet α → β