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 (Lean.SSet α)

Equations

• Lean.SSet.instInhabited = inferInstanceAs (Inhabited (Lean.SMap α Unit))

@[reducible, inline]

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

Equations

• Lean.SSet.empty = Lean.SMap.empty

@[reducible, inline]

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

@[reducible, inline]

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

@[reducible, inline]

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

Equations

• s.forM f = Lean.SMap.forM s fun (a : α) (x : Unit) => f a

@[reducible, inline]

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

Move from stage 1 into stage 2.

Equations

• s.switch = Lean.SMap.switch s

@[reducible, inline]

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

def Lean.SSet.toList {α : Type u} [BEq α] [Hashable α] (m : Lean.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 α)

Equations

• instReprSSet = { reprPrec := fun (v : Lean.SSet α) (prec : Nat) => Repr.addAppParen (reprArg v.toList ++ Std.Format.text ".toSSet") prec }