trait Tree[+L] extends Serializable

Annotations
@SerialVersionUID()
Linear Supertypes
Serializable, Serializable, AnyRef, Any
Known Subclasses
BinarizedTree, BinaryTree, NaryTree, NullaryTree, UnaryTree
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Tree
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

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

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]]
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def begin: Int
  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)

  9. def end: Int
  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): Tree[B]
  13. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. def isLeaf: Boolean
  18. def isValid: Boolean

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped