Loogle!

Result

Found 54 declarations mentioning BinaryTree.

• BinaryTree 📋 Mathlib.Data.Tree.Basic
  (α : Type u) : Type u
• BinaryTree.nil 📋 Mathlib.Data.Tree.Basic
  {α : Type u} : BinaryTree α
• BinaryTree.height 📋 Mathlib.Data.Tree.Basic
  {α : Type u} : BinaryTree α → ℕ
• BinaryTree.instInhabited 📋 Mathlib.Data.Tree.Basic
  {α : Type u} : Inhabited (BinaryTree α)
• BinaryTree.numLeaves 📋 Mathlib.Data.Tree.Basic
  {α : Type u} : BinaryTree α → ℕ
• BinaryTree.numNodes 📋 Mathlib.Data.Tree.Basic
  {α : Type u} : BinaryTree α → ℕ
• BinaryTree.left 📋 Mathlib.Data.Tree.Basic
  {α : Type u} : BinaryTree α → BinaryTree α
• BinaryTree.right 📋 Mathlib.Data.Tree.Basic
  {α : Type u} : BinaryTree α → BinaryTree α
• instDecidableEqBinaryTree 📋 Mathlib.Data.Tree.Basic
  {α✝ : Type u_1} [DecidableEq α✝] : DecidableEq (BinaryTree α✝)
• instReprBinaryTree 📋 Mathlib.Data.Tree.Basic
  {α✝ : Type u_1} [Repr α✝] : Repr (BinaryTree α✝)
• instReprBinaryTree.repr 📋 Mathlib.Data.Tree.Basic
  {α✝ : Type u_1} [Repr α✝] : BinaryTree α✝ → ℕ → Std.Format
• BinaryTree.map 📋 Mathlib.Data.Tree.Basic
  {α : Type u} {β : Type u_1} (f : α → β) : BinaryTree α → BinaryTree β
• BinaryTree.node 📋 Mathlib.Data.Tree.Basic
  {α : Type u} (value : α) (left right : BinaryTree α) : BinaryTree α
• BinaryTree.height_le_numNodes 📋 Mathlib.Data.Tree.Basic
  {α : Type u} (x : BinaryTree α) : x.height ≤ x.numNodes
• BinaryTree.id_map 📋 Mathlib.Data.Tree.Basic
  {α : Type u} (t : BinaryTree α) : BinaryTree.map id t = t
• instDecidableEqBinaryTree.decEq 📋 Mathlib.Data.Tree.Basic
  {α✝ : Type u_1} [DecidableEq α✝] (x✝ x✝¹ : BinaryTree α✝) : Decidable (x✝ = x✝¹)
• BinaryTree.numLeaves_pos 📋 Mathlib.Data.Tree.Basic
  {α : Type u} (x : BinaryTree α) : 0 < x.numLeaves
• BinaryTree.traverse 📋 Mathlib.Data.Tree.Basic
  {m : Type u_1 → Type u_2} [Applicative m] {α : Type u_3} {β : Type u_1} (f : α → m β) : BinaryTree α → m (BinaryTree β)
• BinaryTree.left_node_right_eq_self 📋 Mathlib.Data.Tree.Basic
  {x : BinaryTree Unit} (_hx : x ≠ BinaryTree.nil) : BinaryTree.node () x.left x.right = x
• BinaryTree.numLeaves_eq_numNodes_succ 📋 Mathlib.Data.Tree.Basic
  {α : Type u} (x : BinaryTree α) : x.numLeaves = x.numNodes + 1
• BinaryTree.unitRecOn 📋 Mathlib.Data.Tree.Basic
  {motive : BinaryTree Unit → Sort u_1} (t : BinaryTree Unit) (base : motive BinaryTree.nil) (ind : (x y : BinaryTree Unit) → motive x → motive y → motive (BinaryTree.node () x y)) : motive t
• BinaryTree.comp_map 📋 Mathlib.Data.Tree.Basic
  {α : Type u} {β : Type u_1} {γ : Type u_2} (f : α → β) (g : β → γ) (t : BinaryTree α) : BinaryTree.map (g ∘ f) t = BinaryTree.map g (BinaryTree.map f t)
• BinaryTree.traverse_pure 📋 Mathlib.Data.Tree.Basic
  {α : Type u} (t : BinaryTree α) {m : Type u → Type u_1} [Applicative m] [LawfulApplicative m] : BinaryTree.traverse pure t = pure t
• Mathlib.Tactic.CancelDenoms.findCancelFactor 📋 Mathlib.Tactic.CancelDenoms.Core
  (e : Lean.Expr) : ℕ × BinaryTree ℕ
• Mathlib.Tactic.CancelDenoms.mkProdPrf 📋 Mathlib.Tactic.CancelDenoms.Core
  {u : Lean.Level} (α : Q(Type u)) (sα : Q(Field «$α»)) (v : ℕ) (v' : Q(«$α»)) (t : BinaryTree ℕ) (e : Q(«$α»)) : Lean.MetaM (Mathlib.Tactic.CancelDenoms.CancelResult q(inferInstance) e v')
• BinaryTree.treesOfNumNodesEq 📋 Mathlib.Combinatorics.Enumerative.Catalan.Tree
  : ℕ → Finset (BinaryTree Unit)
• BinaryTree.pairwiseNode 📋 Mathlib.Combinatorics.Enumerative.Catalan.Tree
  (a b : Finset (BinaryTree Unit)) : Finset (BinaryTree Unit)
• BinaryTree.treesOfNumNodesEq_card_eq_catalan 📋 Mathlib.Combinatorics.Enumerative.Catalan.Tree
  (n : ℕ) : (BinaryTree.treesOfNumNodesEq n).card = catalan n
• BinaryTree.treesOfNumNodesEq_zero 📋 Mathlib.Combinatorics.Enumerative.Catalan.Tree
  : BinaryTree.treesOfNumNodesEq 0 = {BinaryTree.nil}
• BinaryTree.mem_treesOfNumNodesEq_numNodes 📋 Mathlib.Combinatorics.Enumerative.Catalan.Tree
  (x : BinaryTree Unit) : x ∈ BinaryTree.treesOfNumNodesEq x.numNodes
• BinaryTree.coe_treesOfNumNodesEq 📋 Mathlib.Combinatorics.Enumerative.Catalan.Tree
  (n : ℕ) : ↑(BinaryTree.treesOfNumNodesEq n) = {x | x.numNodes = n}
• BinaryTree.mem_treesOfNumNodesEq 📋 Mathlib.Combinatorics.Enumerative.Catalan.Tree
  {x : BinaryTree Unit} {n : ℕ} : x ∈ BinaryTree.treesOfNumNodesEq n ↔ x.numNodes = n
• BinaryTree.treesOfNumNodesEq_succ 📋 Mathlib.Combinatorics.Enumerative.Catalan.Tree
  (n : ℕ) : BinaryTree.treesOfNumNodesEq (n + 1) = (Finset.HasAntidiagonal.antidiagonal n).biUnion fun ij => BinaryTree.pairwiseNode (BinaryTree.treesOfNumNodesEq ij.1) (BinaryTree.treesOfNumNodesEq ij.2)
• DyckWord.ofTree 📋 Mathlib.Combinatorics.Enumerative.DyckWord
  : BinaryTree Unit → DyckWord
• DyckWord.toTree 📋 Mathlib.Combinatorics.Enumerative.DyckWord
  (p : DyckWord) : BinaryTree Unit
• DyckWord.equivTree 📋 Mathlib.Combinatorics.Enumerative.DyckWord
  : DyckWord ≃ BinaryTree Unit
• DyckWord.toTree_ofTree 📋 Mathlib.Combinatorics.Enumerative.DyckWord
  (t : BinaryTree Unit) : (DyckWord.ofTree t).toTree = t
• DyckWord.equivTree_apply 📋 Mathlib.Combinatorics.Enumerative.DyckWord
  (p : DyckWord) : DyckWord.equivTree p = p.toTree
• DyckWord.equivTreesOfNumNodesEq 📋 Mathlib.Combinatorics.Enumerative.DyckWord
  (n : ℕ) : { p // p.semilength = n } ≃ ↥(BinaryTree.treesOfNumNodesEq n)
• DyckWord.equivTree_symm_apply 📋 Mathlib.Combinatorics.Enumerative.DyckWord
  (a✝ : BinaryTree Unit) : DyckWord.equivTree.symm a✝ = DyckWord.ofTree a✝
• DyckWord.equivTreesOfNumNodesEq_apply_coe 📋 Mathlib.Combinatorics.Enumerative.DyckWord
  (n : ℕ) (a : { a // (fun p => p.semilength = n) a }) : ↑((DyckWord.equivTreesOfNumNodesEq n) a) = (↑a).toTree
• DyckWord.equivTreesOfNumNodesEq_symm_apply_coe 📋 Mathlib.Combinatorics.Enumerative.DyckWord
  (n : ℕ) (b : ↥(BinaryTree.treesOfNumNodesEq n)) : ↑((DyckWord.equivTreesOfNumNodesEq n).symm b) = DyckWord.ofTree ↑b
• BinaryTree.toOrdNode 📋 Mathlib.Data.Ordmap.Ordnode
  {α : Type u_1} : BinaryTree α → Ordnode α
• Ordnode.toBinaryTree 📋 Mathlib.Data.Ordmap.Ordnode
  {α : Type u_1} : Ordnode α → BinaryTree α
• Ordnode.toBinaryTree_toOrdNode 📋 Mathlib.Data.Ordmap.Ordnode
  {α : Type u_1} (b : BinaryTree α) : b.toOrdNode.toBinaryTree = b
• Ordnode.size_toOrdNode 📋 Mathlib.Data.Ordmap.Ordnode
  {α : Type u_1} (b : BinaryTree α) : b.toOrdNode.size = b.numNodes
• BinaryTree.get 📋 Mathlib.Data.Tree.Get
  {α : Type u_1} : PosNum → BinaryTree α → Option α
• BinaryTree.getOrElse 📋 Mathlib.Data.Tree.Get
  {α : Type u_1} (n : PosNum) (t : BinaryTree α) (v : α) : α
• BinaryTree.indexOf 📋 Mathlib.Data.Tree.Get
  {α : Type u_1} (lt : α → α → Prop) [DecidableRel lt] (x : α) : BinaryTree α → Option PosNum
• BinaryTree.instTraversable 📋 Mathlib.Data.Tree.Traversable
  : Traversable BinaryTree
• BinaryTree.instLawfulTraversable 📋 Mathlib.Data.Tree.Traversable
  : LawfulTraversable BinaryTree
• BinaryTree.traverse_eq_map_id 📋 Mathlib.Data.Tree.Traversable
  {α : Type u_1} {β : Type u_2} (f : α → β) (t : BinaryTree α) : BinaryTree.traverse (pure ∘ f) t = pure (BinaryTree.map f t)
• BinaryTree.naturality 📋 Mathlib.Data.Tree.Traversable
  {α : Type u_1} {F : Type u → Type u_3} {G : Type u → Type u_4} [Applicative F] [Applicative G] [LawfulApplicative F] [LawfulApplicative G] (η : ApplicativeTransformation F G) {β : Type u} (f : α → F β) (t : BinaryTree α) : (fun {α} => η.app α) (BinaryTree.traverse f t) = BinaryTree.traverse (η.app β ∘ f) t
• BinaryTree.comp_traverse 📋 Mathlib.Data.Tree.Traversable
  {α : Type u_1} {F : Type u → Type v} {G : Type v → Type w} [Applicative F] [Applicative G] [LawfulApplicative G] {β : Type v} {γ : Type u} (f : β → F γ) (g : α → G β) (t : BinaryTree α) : BinaryTree.traverse (Functor.Comp.mk ∘ (fun x => f <$> x) ∘ g) t = Functor.Comp.mk ((fun x => BinaryTree.traverse f x) <$> BinaryTree.traverse g t)

About

Loogle searches Lean and Mathlib definitions and theorems.

You can use Loogle from within the Lean4 VSCode language extension using the Loogle command from the command palette. You can also try the #loogle command from LeanSearchClient, the CLI version, the Loogle VS Code extension, the lean.nvim integration or the Zulip bot.

Usage

Loogle finds definitions and lemmas in various ways:

1. By constant:
   🔍 Real.sin
   finds all lemmas whose statement somehow mentions the sine function.

2. By lemma name substring:
   🔍 "differ"
   finds all lemmas that have "differ" somewhere in their lemma name.

3. By subexpression:
   🔍 _ * (_ ^ _)
   finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.

   The pattern can also be non-linear, as in
   🔍 Real.sqrt ?a * Real.sqrt ?a

   If the pattern has parameters, they are matched in any order. Both of these will find List.map:
   🔍 (?a -> ?b) -> List ?a -> List ?b
   🔍 List ?a -> (?a -> ?b) -> List ?b

4. By main conclusion:
   🔍 |- tsum _ = _ * tsum _
   finds all lemmas where the conclusion (the subexpression to the right of all → and ∀) has the given shape.

   As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
   🔍 |- _ < _ → tsum _ < tsum _
   will find tsum_lt_tsum even though the hypothesis f i < g i is not the last.

5. You can filter for definitions vs theorems: Using ⊢ (_ : Type _) finds all definitions which provide data while ⊢ (_ : Prop) finds all theorems (and definitions of proofs).

If you pass more than one such search filter, separated by commas Loogle will return lemmas which match all of them. The search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin and tsum, have "two" as a substring of the lemma name, include a product and a power somewhere in the type, and have a hypothesis of the form _ < _ (if there were any such lemmas). Metavariables (?a) are assigned independently in each filter.

The #lucky button will directly send you to the documentation of the first hit.

Source code

You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.

This is Loogle revision 9f11169 serving mathlib revision ce5dd8c