def Lean.RBTree (α : Type u) (cmp : α → α → Ordering) : Type u

Equations

• Lean.RBTree α cmp = Lean.RBMap α Unit cmp

instance Lean.instInhabitedRBTree {α : Type u_1} {p : α → α → Ordering} : Inhabited (Lean.RBTree α p)

@[inline]

def Lean.mkRBTree (α : Type u) (cmp : α → α → Ordering) : Lean.RBTree α cmp

instance Lean.instEmptyCollectionRBTree (α : Type u) (cmp : α → α → Ordering) : EmptyCollection (Lean.RBTree α cmp)

Equations

• Lean.instEmptyCollectionRBTree α cmp = { emptyCollection := Lean.mkRBTree α cmp }

@[inline]

def Lean.RBTree.empty {α : Type u} {cmp : α → α → Ordering} : Lean.RBTree α cmp

Equations

• Lean.RBTree.empty = Lean.RBMap.empty

@[inline]

def Lean.RBTree.depth {α : Type u} {cmp : α → α → Ordering} (f : Nat → Nat → Nat) (t : Lean.RBTree α cmp) : Nat

@[inline]

def Lean.RBTree.fold {α : Type u} {β : Type v} {cmp : α → α → Ordering} (f : β → α → β) (init : β) (t : Lean.RBTree α cmp) : β

Equations

• Lean.RBTree.fold f init t = Lean.RBMap.fold (fun (r : β) (a : α) (x : Unit) => f r a) init t

@[inline]

def Lean.RBTree.revFold {α : Type u} {β : Type v} {cmp : α → α → Ordering} (f : β → α → β) (init : β) (t : Lean.RBTree α cmp) : β

@[inline]

def Lean.RBTree.foldM {α : Type u} {β : Type v} {cmp : α → α → Ordering} {m : Type v → Type w} [Monad m] (f : β → α → m β) (init : β) (t : Lean.RBTree α cmp) : m β

Equations

• Lean.RBTree.foldM f init t = Lean.RBMap.foldM (fun (r : β) (a : α) (x : Unit) => f r a) init t

@[inline]

def Lean.RBTree.forM {α : Type u} {cmp : α → α → Ordering} {m : Type v → Type w} [Monad m] (f : α → m PUnit) (t : Lean.RBTree α cmp) : m PUnit

@[inline]

def Lean.RBTree.forIn {α : Type u} {cmp : α → α → Ordering} {m : Type u_1 → Type u_2} {σ : Type u_1} [Monad m] (t : Lean.RBTree α cmp) (init : σ) (f : α → σ → m (ForInStep σ)) : m σ

instance Lean.RBTree.instForIn {α : Type u} {cmp : α → α → Ordering} {m : Type u_1 → Type u_2} : ForIn m (Lean.RBTree α cmp) α

Equations

• Lean.RBTree.instForIn = { forIn := fun {β : Type ?u.29} [Monad m] => Lean.RBTree.forIn }

@[inline]

def Lean.RBTree.isEmpty {α : Type u} {cmp : α → α → Ordering} (t : Lean.RBTree α cmp) : Bool

Equations

• t.isEmpty = Lean.RBMap.isEmpty t

@[specialize #[]]

def Lean.RBTree.toList {α : Type u} {cmp : α → α → Ordering} (t : Lean.RBTree α cmp) : List α

Equations

• t.toList = Lean.RBTree.revFold (fun (as : List α) (a : α) => a :: as) [] t

@[specialize #[]]

def Lean.RBTree.toArray {α : Type u} {cmp : α → α → Ordering} (t : Lean.RBTree α cmp) : Array α

@[inline]

def Lean.RBTree.min {α : Type u} {cmp : α → α → Ordering} (t : Lean.RBTree α cmp) : Option α

Equations

• t.min = match Lean.RBMap.min t with | some (a, snd) => some a | none => none

@[inline]

def Lean.RBTree.max {α : Type u} {cmp : α → α → Ordering} (t : Lean.RBTree α cmp) : Option α

Equations

• t.max = match Lean.RBMap.max t with | some (a, snd) => some a | none => none

instance Lean.RBTree.instRepr {α : Type u} {cmp : α → α → Ordering} [Repr α] : Repr (Lean.RBTree α cmp)

@[inline]

def Lean.RBTree.insert {α : Type u} {cmp : α → α → Ordering} (t : Lean.RBTree α cmp) (a : α) : Lean.RBTree α cmp

Equations

• t.insert a = Lean.RBMap.insert t a ()

@[inline]

def Lean.RBTree.erase {α : Type u} {cmp : α → α → Ordering} (t : Lean.RBTree α cmp) (a : α) : Lean.RBTree α cmp

Equations

• t.erase a = Lean.RBMap.erase t a

@[specialize #[]]

def Lean.RBTree.ofList {α : Type u} {cmp : α → α → Ordering} : List α → Lean.RBTree α cmp

@[inline]

def Lean.RBTree.find? {α : Type u} {cmp : α → α → Ordering} (t : Lean.RBTree α cmp) (a : α) : Option α

@[inline]

def Lean.RBTree.contains {α : Type u} {cmp : α → α → Ordering} (t : Lean.RBTree α cmp) (a : α) : Bool

Equations

• t.contains a = (t.find? a).isSome

def Lean.RBTree.fromList {α : Type u} (l : List α) (cmp : α → α → Ordering) : Lean.RBTree α cmp

def Lean.RBTree.fromArray {α : Type u} (l : Array α) (cmp : α → α → Ordering) : Lean.RBTree α cmp

Equations

• Lean.RBTree.fromArray l cmp = Array.foldl Lean.RBTree.insert (Lean.mkRBTree α cmp) l

@[inline]

def Lean.RBTree.all {α : Type u} {cmp : α → α → Ordering} (t : Lean.RBTree α cmp) (p : α → Bool) : Bool

Equations

• t.all p = Lean.RBMap.all t fun (a : α) (x : Unit) => p a

@[inline]

def Lean.RBTree.any {α : Type u} {cmp : α → α → Ordering} (t : Lean.RBTree α cmp) (p : α → Bool) : Bool

def Lean.RBTree.subset {α : Type u} {cmp : α → α → Ordering} (t₁ t₂ : Lean.RBTree α cmp) : Bool

Equations

• t₁.subset t₂ = t₁.all fun (a : α) => (t₂.find? a).isSome

def Lean.RBTree.seteq {α : Type u} {cmp : α → α → Ordering} (t₁ t₂ : Lean.RBTree α cmp) : Bool

Equations

• t₁.seteq t₂ = (t₁.subset t₂ && t₂.subset t₁)

def Lean.RBTree.union {α : Type u} {cmp : α → α → Ordering} (t₁ t₂ : Lean.RBTree α cmp) : Lean.RBTree α cmp

Equations

• t₁.union t₂ = if t₁.isEmpty = true then t₂ else Lean.RBTree.fold Lean.RBTree.insert t₁ t₂

def Lean.RBTree.diff {α : Type u} {cmp : α → α → Ordering} (t₁ t₂ : Lean.RBTree α cmp) : Lean.RBTree α cmp

Equations

• t₁.diff t₂ = Lean.RBTree.fold Lean.RBTree.erase t₁ t₂

def Lean.RBTree.filter {α : Type u} {cmp : α → α → Ordering} (f : α → Bool) (m : Lean.RBTree α cmp) : Lean.RBTree α cmp

filter f m returns the RBTree consisting of all x in m where f x returns true.

def Lean.rbtreeOf {α : Type u} (l : List α) (cmp : α → α → Ordering) : Lean.RBTree α cmp