instance Lean.PersistentHashSet.instForIn_batteries {α : Type u_1} [BEq α] [Hashable α] {m : Type u_2 → Type u_3} : ForIn m (PersistentHashSet α) α

@[specialize #[]]

def Lean.PersistentHashSet.anyM {α : Type u_1} [BEq α] [Hashable α] {m : Type → Type u_2} [Monad m] (s : PersistentHashSet α) (f : α → m Bool) : m Bool

Returns true if f returns true for any element of the set.

@[inline]

def Lean.PersistentHashSet.any {α : Type u_1} [BEq α] [Hashable α] (s : PersistentHashSet α) (f : α → Bool) : Bool

Returns true if f returns true for any element of the set.

@[specialize #[]]

def Lean.PersistentHashSet.allM {α : Type u_1} [BEq α] [Hashable α] {m : Type → Type u_2} [Monad m] (s : PersistentHashSet α) (f : α → m Bool) : m Bool

Returns true if f returns true for all elements of the set.

@[inline]

def Lean.PersistentHashSet.all {α : Type u_1} [BEq α] [Hashable α] (s : PersistentHashSet α) (f : α → Bool) : Bool

Returns true if f returns true for all elements of the set.

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

def Lean.PersistentHashSet.insertMany {α : Type u_1} [BEq α] [Hashable α] {ρ : Type u_2} [ForIn Id ρ α] (s : PersistentHashSet α) (as : ρ) : PersistentHashSet α

Insert all elements from a collection into a PersistentHashSet.

@[inline]

def Lean.PersistentHashSet.ofArray {α : Type u_1} [BEq α] [Hashable α] (as : Array α) : PersistentHashSet α

Obtain a PersistentHashSet from an array.

@[inline]

def Lean.PersistentHashSet.ofList {α : Type u_1} [BEq α] [Hashable α] (as : List α) : PersistentHashSet α

Obtain a PersistentHashSet from a list.

@[inline]

def Lean.PersistentHashSet.merge {α : Type u_1} [BEq α] [Hashable α] (s t : PersistentHashSet α) : PersistentHashSet α

Merge two PersistentHashSets.