Documentation

Batteries.Lean.HashSet

@[specialize #[]]
def Std.HashSet.anyM {α : Type u_1} [BEq α] [Hashable α] {m : TypeType} [Monad m] (s : HashSet α) (f : αm Bool) :

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

Equations
  • One or more equations did not get rendered due to their size.
@[specialize #[]]
def Std.HashSet.allM {α : Type u_1} [BEq α] [Hashable α] {m : TypeType} [Monad m] (s : HashSet α) (f : αm Bool) :

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

Equations
  • One or more equations did not get rendered due to their size.
instance Std.HashSet.instBEq_batteries {α : Type u_1} [BEq α] [Hashable α] :
Equations
@[inline, deprecated Std.HashSet.containsThenInsert (since := "2024-09-17")]
def Std.HashSet.insert' {α : Type u_1} [BEq α] [Hashable α] (s : HashSet α) (a : α) :

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

Equations