Packages

object MTree

Source
tree.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MTree
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. final case class Leaf[+A](value: A) extends AnyVal with MTree[A] with Product with Serializable
  2. case class Node[+A](value: A, forest: Forest[MTree[A]]) extends MTree[A] with Product with Serializable
  3. case class Zipper[A](family: MTree[A], index: Int = 0, parents: List[Zipper[A]] = Nil) extends Product with Serializable

    TODO try to generalize this Zipper to the different kinds of trees instead of just the MTree

    TODO try to generalize this Zipper to the different kinds of trees instead of just the MTree

    • a alternate type indexer
    • use a Either based Index-er TODO try to add some variance to this zipper type

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](value: A, trees: Forest[MTree[A]]): Node[A]

    make a node (MTree)

  5. def apply[A](value: A): Leaf[A]

    make a leaf (MTree)

  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  11. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. def link[A](values: Iterable[A], links: (A) => Iterable[A]): Forest[MTree[A]]
  15. def link[A](pairs: Iterable[(A, A)]): Forest[MTree[A]]

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

    Form a linked forest, given a function for determining child links. largely followed from https://github.com/lightbend/paradox/blob/master/core/src/main/scala/com/lightbend/paradox/tree/Tree.scala

  16. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. def nest[A](elems: Iterable[A])(isChild: (A, A) => Boolean): Forest[MTree[A]]

    group elements into levels, assuming elems are sorted by depth first order

  18. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  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(classOf[java.lang.InterruptedException])
  23. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped