@[specialize #[]]

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

O(n). Returns true if f returns true for any element of the set.

@[inline]

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

O(n). Returns true if f returns true for any element of the set.

@[specialize #[]]

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

O(n). Returns true if f returns true for all elements of the set.

@[inline]

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

O(n). Returns true if f returns true for all elements of the set.

instance Lean.HashSet.instBEqHashSet {α : Type u_1} [BEq α] [Hashable α] : BEq (Lean.HashSet α)

@[inline]

def Lean.HashSet.insert' {α : Type u_1} [BEq α] [Hashable α] (s : Lean.HashSet α) (a : α) : Lean.HashSet α × Bool

O(1) amortized. Similar to insert, but also returns a Boolean flag indicating whether an existing entry has been replaced with a => b.

@[inline]

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

O(n). Obtain a HashSet from an array.

@[inline]

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

O(n). Obtain a HashSet from a list.

@[inline]

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

O(|t|) amortized. Merge two HashSets.