Trait

at.logic.gapt.proofs.proofs

BinaryTreeProof

Related Doc: package proofs

Permalink

trait BinaryTreeProof[V] extends BinaryTree[V] with BinaryProof[V] with TreeProof[V]

Source
treeProofs.scala
Linear Supertypes
Known Subclasses
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BinaryTreeProof
  2. TreeProof
  3. BinaryProof
  4. Proof
  5. BinaryTree
  6. NonTerminalNodeA
  7. Tree
  8. TreeA
  9. BinaryAGraph
  10. AGraph
  11. EdgeGraph
  12. Graph
  13. AnyRef
  14. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def rule: RuleTypeA

    Permalink
    Definition Classes
    Proof

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from BinaryTreeProof[V] to any2stringadd[BinaryTreeProof[V]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (BinaryTreeProof[V], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from BinaryTreeProof[V] to ArrowAssoc[BinaryTreeProof[V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. val children: List[(Tree[V], Unit)]

    Permalink
    Definition Classes
    BinaryTreeNonTerminalNodeA
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def contains[T >: AGraph[V]](sub: T): Boolean

    Permalink
    Definition Classes
    BinaryAGraphAGraph
  10. def ensuring(cond: (BinaryTreeProof[V]) ⇒ Boolean, msg: ⇒ Any): BinaryTreeProof[V]

    Permalink
    Implicit information
    This member is added by an implicit conversion from BinaryTreeProof[V] to Ensuring[BinaryTreeProof[V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: (BinaryTreeProof[V]) ⇒ Boolean): BinaryTreeProof[V]

    Permalink
    Implicit information
    This member is added by an implicit conversion from BinaryTreeProof[V] to Ensuring[BinaryTreeProof[V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: Boolean, msg: ⇒ Any): BinaryTreeProof[V]

    Permalink
    Implicit information
    This member is added by an implicit conversion from BinaryTreeProof[V] to Ensuring[BinaryTreeProof[V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. def ensuring(cond: Boolean): BinaryTreeProof[V]

    Permalink
    Implicit information
    This member is added by an implicit conversion from BinaryTreeProof[V] to Ensuring[BinaryTreeProof[V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  16. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def fold[T](leafF: (V) ⇒ T)(unaryF: (T, V) ⇒ T)(binaryF: (T, T, V) ⇒ T): T

    Permalink
    Definition Classes
    BinaryTreeTree
  18. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from BinaryTreeProof[V] to StringFormat[BinaryTreeProof[V]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  19. val g: Graph[V]

    Permalink
    Definition Classes
    EdgeGraph
  20. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  21. val hashCode: Int

    Permalink
    Definition Classes
    BinaryAGraph → AnyRef → Any
  22. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  23. def leaves: Set[LeafTree[V]]

    Permalink
    Definition Classes
    BinaryTreeTree
  24. def name: String

    Permalink
    Definition Classes
    BinaryAGraphAGraph
  25. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  26. val node: V

    Permalink
    Definition Classes
    BinaryTreeNonTerminalNodeA
  27. def nodes[_ >: V](visited: HashSet[AGraph[_]]): HashSet[AGraph[_]]

    Permalink
    Definition Classes
    AGraph
  28. def nodes[_ >: V](): HashSet[AGraph[_]]

    Permalink
    Definition Classes
    AGraph
  29. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  30. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  31. def root: V

    Permalink
    Definition Classes
    Proof
  32. def size[_ >: V](visited: Map[AGraph[_], Int]): Map[AGraph[_], Int]

    Permalink
    Definition Classes
    AGraph
  33. def size[_ >: V](): Int

    Permalink
    Definition Classes
    AGraph
  34. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  35. val t1: Tree[V]

    Permalink
    Definition Classes
    BinaryTreeBinaryAGraph
  36. val t2: Tree[V]

    Permalink
    Definition Classes
    BinaryTreeBinaryAGraph
  37. def toString(): String

    Permalink
    Definition Classes
    BinaryProofProofBinaryAGraph → AnyRef → Any
  38. def uProof1: Proof[V]

    Permalink
    Definition Classes
    BinaryProof
  39. def uProof2: Proof[V]

    Permalink
    Definition Classes
    BinaryProof
  40. def unique_size: Int

    Permalink
    Definition Classes
    AGraph
  41. val v1: V

    Permalink
    Definition Classes
    EdgeGraph
  42. val v2: V

    Permalink
    Definition Classes
    EdgeGraph
  43. val vertex: V

    Permalink
    Definition Classes
    BinaryTreeTreeBinaryAGraphAGraph
  44. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  45. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  46. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  47. def [B](y: B): (BinaryTreeProof[V], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from BinaryTreeProof[V] to ArrowAssoc[BinaryTreeProof[V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from TreeProof[V]

Inherited from BinaryProof[V]

Inherited from Proof[V]

Inherited from BinaryTree[V]

Inherited from NonTerminalNodeA[V, Unit]

Inherited from Tree[V]

Inherited from TreeA[V, Unit]

Inherited from BinaryAGraph[V]

Inherited from AGraph[V]

Inherited from EdgeGraph[V]

Inherited from Graph[V]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from BinaryTreeProof[V] to any2stringadd[BinaryTreeProof[V]]

Inherited by implicit conversion StringFormat from BinaryTreeProof[V] to StringFormat[BinaryTreeProof[V]]

Inherited by implicit conversion Ensuring from BinaryTreeProof[V] to Ensuring[BinaryTreeProof[V]]

Inherited by implicit conversion ArrowAssoc from BinaryTreeProof[V] to ArrowAssoc[BinaryTreeProof[V]]

Ungrouped