UnaryTree

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. def allChildren: Iterator[Tree[L]]

   Definition Classes

   Tree

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8. def begin: Int

   Definition Classes

   Tree

9. val chain: IndexedSeq[String]

10. val child: BinarizedTree[L]

11. def children: IndexedSeq[BinarizedTree[L]]

    Definition Classes

    UnaryTree → Tree

12. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

13. 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

14. def end: Int

    Definition Classes

    Tree

15. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

16. def extend[B](f: (Tree[L]) ⇒ B): UnaryTree[B]

    Definition Classes

    UnaryTree → BinarizedTree → Tree

17. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

18. def findSpan(begin: Int, end: Int): Option[Tree[L]]

    Definition Classes

    BinarizedTree

19. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

20. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

21. def isLeaf: Boolean

    Definition Classes

    Tree

22. 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

23. val label: L

    Definition Classes

    UnaryTree → Tree

24. def leaves: Iterable[Tree[L]]

    Definition Classes

    Tree

25. def leftHeight: Int

    Definition Classes

    Tree

26. def map[M](f: (L) ⇒ M): UnaryTree[M]

    Definition Classes

    UnaryTree → BinarizedTree → Tree

27. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

28. final def notify(): Unit

    Definition Classes

    AnyRef

29. final def notifyAll(): Unit

    Definition Classes

    AnyRef

30. def postorder: Iterator[Tree[L]]

    Definition Classes

    Tree

31. def preorder: Iterator[Tree[L]]

    Definition Classes

    Tree

32. def relabelRoot[B >: L](f: (L) ⇒ B): BinarizedTree[B]

    Definition Classes

    UnaryTree → BinarizedTree → Tree

33. def render[W](words: Seq[W], newline: Boolean = true): String

    Definition Classes

    Tree

34. val span: Span

    Definition Classes

    UnaryTree → Tree

35. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

36. def toString(newline: Boolean): String

    Definition Classes

    Tree

37. def toString(): String

    Definition Classes

    Tree → AnyRef → Any

38. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

39. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

40. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )