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

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)

@[inline]

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

@[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) : β

@[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 β

@[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.instForInRBTree {α : Type u} {cmp : α → α → Ordering} {m : Type u_1 → Type u_2} : ForIn m (Lean.RBTree α cmp) α

@[inline]

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

@[specialize #[]]

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

@[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 α

@[inline]

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

instance Lean.RBTree.instReprRBTree {α : 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

@[inline]

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

@[specialize #[]]

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

Equations

• Lean.RBTree.ofList [] = Lean.mkRBTree α cmp
• Lean.RBTree.ofList (x_1 :: xs) = Lean.RBTree.insert (Lean.RBTree.ofList xs) x_1

@[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

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

@[inline]

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

@[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₁ : Lean.RBTree α cmp) (t₂ : Lean.RBTree α cmp) : Bool

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

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

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

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