@[specialize #[]]
def
Std.HashSet.anyM
{α : Type u_1}
[BEq α]
[Hashable α]
{m : Type → Type}
[Monad m]
(s : Std.HashSet α)
(f : α → m Bool)
:
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.
Instances For
@[specialize #[]]
def
Std.HashSet.allM
{α : Type u_1}
[BEq α]
[Hashable α]
{m : Type → Type}
[Monad m]
(s : Std.HashSet α)
(f : α → m Bool)
:
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.
Instances For
Equations
- Std.HashSet.instBEq_batteries = { beq := fun (s t : Std.HashSet α) => (s.all fun (x : α) => t.contains x) && t.all fun (x : α) => s.contains x }
@[inline, deprecated Std.HashSet.containsThenInsert (since := "2024-09-17")]
def
Std.HashSet.insert'
{α : Type u_1}
[BEq α]
[Hashable α]
(s : Std.HashSet α)
(a : α)
:
Std.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.