c

epic.trees

NaryTree

case class NaryTree[L](label: L, children: IndexedSeq[Tree[L]], span: Span) extends Tree[L] with Product with Serializable

Linear Supertypes
Product, Equals, Tree[L], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NaryTree
  2. Product
  3. Equals
  4. Tree
  5. Serializable
  6. Serializable
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NaryTree(label: L, children: IndexedSeq[Tree[L]], span: Span)

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. val children: IndexedSeq[Tree[L]]
    Definition Classes
    NaryTreeTree
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. 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
  10. def end: Int
    Definition Classes
    Tree
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def extend[B](f: (Tree[L]) ⇒ B): Tree[B]
    Definition Classes
    Tree
  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. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. def isLeaf: Boolean
    Definition Classes
    Tree
  17. 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
  18. val label: L
    Definition Classes
    NaryTreeTree
  19. def leaves: Iterable[Tree[L]]
    Definition Classes
    Tree
  20. def leftHeight: Int
    Definition Classes
    Tree
  21. def map[M](f: (L) ⇒ M): Tree[M]
    Definition Classes
    Tree
  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]]
    Definition Classes
    Tree
  26. def preorder: Iterator[Tree[L]]
    Definition Classes
    Tree
  27. def relabelRoot[B >: L](f: (L) ⇒ B): Tree[B]
    Definition Classes
    NaryTreeTree
  28. def render[W](words: Seq[W], newline: Boolean = true): String
    Definition Classes
    Tree
  29. val span: Span
    Definition Classes
    NaryTreeTree
  30. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  31. def toString(newline: Boolean): String
    Definition Classes
    Tree
  32. def toString(): String
    Definition Classes
    Tree → AnyRef → Any
  33. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Product

Inherited from Equals

Inherited from Tree[L]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped