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

   Definition Classes

   BinaryTree → Tree

5.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

6.  def begin: Int

   Definition Classes

   Tree

7.  def children: IndexedSeq[BinarizedTree[L]]

   Definition Classes

   BinaryTree → Tree

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): BinaryTree[B]

    Definition Classes

    BinaryTree → BinarizedTree → Tree

13.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    BinarizedTree

15.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

16.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

17.  def isLeaf: Boolean

    Definition Classes

    Tree

18.  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

19.  val label: L

    Definition Classes

    BinaryTree → Tree

20.  def leaves: Iterable[Tree[L]]

    Definition Classes

    Tree

21.  val leftChild: BinarizedTree[L]
22.  def leftHeight: Int

    Definition Classes

    Tree

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

    Definition Classes

    BinaryTree → BinarizedTree → Tree

24.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

25.  final def notify(): Unit

    Definition Classes

    AnyRef

26.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

27.  def postorder: Iterator[BinaryTree[L]]

    Definition Classes

    BinaryTree → Tree

28.  def preorder: Iterator[BinaryTree[L]]

    Definition Classes

    BinaryTree → Tree

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

    Definition Classes

    BinaryTree → BinarizedTree → Tree

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

    Definition Classes

    Tree

31.  val rightChild: BinarizedTree[L]
32.  val span: Span

    Definition Classes

    BinaryTree → Tree

33.  def splitPoint: Int
34.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

35.  def toString(newline: Boolean): String

    Definition Classes

    Tree

36.  def toString(): String

    Definition Classes

    Tree → AnyRef → Any

37.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

39.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )