t

epic.trees

BinarizedTree

sealed trait BinarizedTree[+L] extends Tree[L]

Linear Supertypes
Tree[L], Serializable, Serializable, AnyRef, Any
Known Subclasses
BinaryTree, NullaryTree, UnaryTree
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BinarizedTree
  2. Tree
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def children: IndexedSeq[Tree[L]]
    Definition Classes
    Tree
  2. abstract def label: L
    Definition Classes
    Tree
  3. abstract def relabelRoot[B >: L](f: (L) ⇒ B): BinarizedTree[B]
    Definition Classes
    BinarizedTree → Tree
  4. abstract def span: Span
    Definition Classes
    Tree

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def allChildren: Iterator[Tree[L]]
    Definition Classes
    Tree
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def begin: Int
    Definition Classes
    Tree
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def cutLeaves: (Tree[L], IndexedSeq[L])

    Useful for stripping the words out of a tree Returns (tree without leaves, leaves)

    Useful for stripping the words out of a tree Returns (tree without leaves, leaves)

    Definition Classes
    Tree
  9. def end: Int
    Definition Classes
    Tree
  10. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  12. def extend[B](f: (Tree[L]) ⇒ B): BinarizedTree[B]
    Definition Classes
    BinarizedTree → Tree
  13. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. def findSpan(begin: Int, end: Int): Option[Tree[L]]
  15. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  17. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  18. def isLeaf: Boolean
    Definition Classes
    Tree
  19. def isValid: Boolean

    A tree is valid if this' span contains all children's spans and each child abuts the next one.

    A tree is valid if this' span contains all children's spans and each child abuts the next one.

    Definition Classes
    Tree
  20. def leaves: Iterable[Tree[L]]
    Definition Classes
    Tree
  21. def leftHeight: Int
    Definition Classes
    Tree
  22. def map[M](f: (L) ⇒ M): BinarizedTree[M]
    Definition Classes
    BinarizedTree → Tree
  23. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  24. final def notify(): Unit
    Definition Classes
    AnyRef
  25. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  26. def postorder: Iterator[Tree[L]]
    Definition Classes
    Tree
  27. def preorder: Iterator[Tree[L]]
    Definition Classes
    Tree
  28. def render[W](words: Seq[W], newline: Boolean = true): String
    Definition Classes
    Tree
  29. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  30. def toString(newline: Boolean): String
    Definition Classes
    Tree
  31. def toString(): String
    Definition Classes
    Tree → AnyRef → Any
  32. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Tree[L]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped