source
@[specialize #[]]
def Std.HashSet.anyM {α : Type u_1} [BEq α] [Hashable α] {m : Type → Type u_2} [Monad m] (s : 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

source
@[specialize #[]]
def Std.HashSet.allM {α : Type u_1} [BEq α] [Hashable α] {m : Type → Type u_2} [Monad m] (s : 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

source
instance Std.HashSet.instBEq_batteries {α : Type u_1} [BEq α] [Hashable α] :
BEq (HashSet α)
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 }