BinaryTree

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[BinaryTree[L]]

   Definition Classes

   BinaryTree → Tree

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8. def begin: Int

   Definition Classes

   Tree

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

   Definition Classes

   BinaryTree → Tree

10. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

12. def end: Int

    Definition Classes

    Tree

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

    Definition Classes

    AnyRef

14. def extend[B](f: (Tree[L]) ⇒ B): BinaryTree[B]

    Definition Classes

    BinaryTree → BinarizedTree → Tree

15. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    BinarizedTree

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

    Definition Classes

    AnyRef → Any

18. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

19. def isLeaf: Boolean

    Definition Classes

    Tree

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

21. val label: L

    Definition Classes

    BinaryTree → Tree

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

    Definition Classes

    Tree

23. val leftChild: BinarizedTree[L]

24. def leftHeight: Int

    Definition Classes

    Tree

25. def map[M](f: (L) ⇒ M): BinaryTree[M]

    Definition Classes

    BinaryTree → BinarizedTree → Tree

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

    Definition Classes

    AnyRef

27. final def notify(): Unit

    Definition Classes

    AnyRef

28. final def notifyAll(): Unit

    Definition Classes

    AnyRef

29. def postorder: Iterator[BinaryTree[L]]

    Definition Classes

    BinaryTree → Tree

30. def preorder: Iterator[BinaryTree[L]]

    Definition Classes

    BinaryTree → Tree

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

    Definition Classes

    BinaryTree → BinarizedTree → Tree

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

    Definition Classes

    Tree

33. val rightChild: BinarizedTree[L]

34. val span: Span

    Definition Classes

    BinaryTree → Tree

35. def splitPoint: Int

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

    Definition Classes

    AnyRef

37. def toString(newline: Boolean): String

    Definition Classes

    Tree

38. def toString(): String

    Definition Classes

    Tree → AnyRef → Any

39. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )