def Lean.SSet (α : Type u) [BEq α] [Hashable α] : Type u

Staged set. It is just a simple wrapper on top of Staged maps.

instance Lean.SSet.instInhabited {α : Type u} [BEq α] [Hashable α] : Inhabited (SSet α)

@[reducible, inline]

abbrev Lean.SSet.empty {α : Type u} [BEq α] [Hashable α] : SSet α

@[reducible, inline]

abbrev Lean.SSet.insert {α : Type u} [BEq α] [Hashable α] (s : SSet α) (a : α) : SSet α

@[reducible, inline]

abbrev Lean.SSet.contains {α : Type u} [BEq α] [Hashable α] (s : SSet α) (a : α) : Bool

@[reducible, inline]

abbrev Lean.SSet.forM {α : Type u} [BEq α] [Hashable α] {m : Type u_1 → Type u_1} [Monad m] (s : SSet α) (f : α → m PUnit) : m PUnit

@[reducible, inline]

abbrev Lean.SSet.switch {α : Type u} [BEq α] [Hashable α] (s : SSet α) : SSet α

Move from stage 1 into stage 2.

@[reducible, inline]

abbrev Lean.SSet.fold {α : Type u} [BEq α] [Hashable α] {σ : Type u_1} (f : σ → α → σ) (init : σ) (s : SSet α) : σ

def Lean.SSet.toList {α : Type u} [BEq α] [Hashable α] (m : SSet α) : List α

def List.toSSet {α : Type u_1} [BEq α] [Hashable α] (es : List α) : Lean.SSet α

instance instReprSSet {α : Type u_1} {x✝ : BEq α} {x✝¹ : Hashable α} [Repr α] : Repr (Lean.SSet α)