Packages

object Tree

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Tree
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Forest[A] = List[Tree[A]]
  2. final case class Location [A](tree: Tree[A], lefts: Forest[A], rights: Forest[A], parents: List[Parent[A]]) extends Product with Serializable

    Zipper navigation and modification for Tree.

  3. case class Node [A](label: A, children: Forest[A]) extends Tree[A] with Product with Serializable

    Default Tree implementation.

  4. final case class Parent [A](label: A, lefts: Forest[A], rights: Forest[A]) extends Product with Serializable

    Parent node for zipper locations.

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 apply[A](label: A, children: Forest[A]): Tree[A]

    Create a new tree node (default Node).

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  11. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  12. def hierarchy[A](nodes: List[A], stack: Forest[A] = Nil)(implicit ord: Ordering[A]): Forest[A]

    Form a linked forest from a listed hierarchy, given an ordering for levels.

    Form a linked forest from a listed hierarchy, given an ordering for levels.

    Annotations
    @tailrec()
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. def leaf[A](label: A): Tree[A]

    Create a new tree node without children.

  15. def link[A](nodes: List[A], links: (A) ⇒ List[A]): Forest[A]

    Form a linked forest, given a function for determining child links.

  16. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. def node[A](label: A, children: Tree[A]*): Tree[A]

    Create a new tree node (with varargs for children).

  18. final def notify(): Unit
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  20. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  21. def toString(): String
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. object Location extends Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped