Tree

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. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def buildOrderedNodeList[A](l: List[A])(implicit o: Ordering[A]): List[Node[A]]

   

   Builds a list of ordered but unconnected nodes from a list of objects.

   Builds a list of ordered but unconnected nodes from a list of objects.

   The nodes that are created from the provided list of numbers are sorted in order of increasing value; the index property of each Node instance is set to its position in the ordered list.

   l

   list of objects to build Tree from

   o

   ordering of objects

6. def buildTree[A](l: List[Node[A]]): Tree[A]

   

   Builds a Tree given an ordered list of Node instances; see buildOrderedNodeList

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

12. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

13. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

14. def lOdd[T](l: List[T]): Boolean

    

    Determines if a list has odd length.

15. def medSplit[T](l: List[T]): (Int, List[T], List[T])

    

    Given a list, finds the index of the middle value.

    Given a list, finds the index of the middle value.

    For even-length lists with two "middle" values, the left of these (with the lower index value) is returned. In addition to the index, also returns the left and right sublists, (neither of which includes the middle value).

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

    

    Definition Classes

    AnyRef

17. final def notify(): Unit

    

    Definition Classes

    AnyRef

18. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    AnyRef

20. def toString(): String

    

    Definition Classes

    AnyRef → Any

21. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )