Tree

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object Leaf

Leaf represents a tree node with no children.

object Node

Node represents a tree node that may have children.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

implicit def treeEqual[A](implicit A0: Equal[A]): Equal[Tree[A]]

implicit val treeInstance: Traverse1[Tree] with Monad[Tree] with Comonad[Tree] with Align[Tree] with Zip[Tree]

implicit def treeOrder[A](implicit A0: Order[A]): Order[Tree[A]]

def unfoldForest[A, B](s: Stream[A])(f: (A) ⇒ (B, () ⇒ Stream[A])): Stream[Tree[B]]

def unfoldTree[A, B](v: A)(f: (A) ⇒ (B, () ⇒ Stream[A])): Tree[B]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def apply[A](root: ⇒ A): Tree[A]

Construct a tree node with no children.

def leaf[A](root: ⇒ A): Tree[A]

Construct a tree node with no children.

def node[A](root: ⇒ A, forest: ⇒ Stream[Tree[A]]): Tree[A]

Construct a new Tree node.