case class NaryTree[L](label: L, children: IndexedSeq[Tree[L]], span: Span) extends Tree[L] with Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- NaryTree
- Product
- Equals
- Tree
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
allChildren: Iterator[Tree[L]]
- Definition Classes
- Tree
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
begin: Int
- Definition Classes
- Tree
- val children: IndexedSeq[Tree[L]]
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
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
-
def
end: Int
- Definition Classes
- Tree
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
extend[B](f: (Tree[L]) ⇒ B): Tree[B]
- Definition Classes
- Tree
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isLeaf: Boolean
- Definition Classes
- Tree
-
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
- val label: L
-
def
leaves: Iterable[Tree[L]]
- Definition Classes
- Tree
-
def
leftHeight: Int
- Definition Classes
- Tree
-
def
map[M](f: (L) ⇒ M): Tree[M]
- Definition Classes
- Tree
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
postorder: Iterator[Tree[L]]
- Definition Classes
- Tree
-
def
preorder: Iterator[Tree[L]]
- Definition Classes
- Tree
- def relabelRoot[B >: L](f: (L) ⇒ B): Tree[B]
-
def
render[W](words: Seq[W], newline: Boolean = true): String
- Definition Classes
- Tree
- val span: Span
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(newline: Boolean): String
- Definition Classes
- Tree
-
def
toString(): String
- Definition Classes
- Tree → AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )