sealed abstract class Tree[A] extends AnyRef
A multi-way tree, also known as a rose tree. Also known as Cofree[Stream, A].
- Source
- Tree.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Tree
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Abstract Value Members
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def cobind[B](f: (Tree[A]) => B): Tree[B]
Binds the given function across all the subtrees of this tree.
- def drawTree(implicit sh: Show[A]): String
A 2D String representation of this Tree.
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def flatMap[B](f: (A) => Tree[B]): Tree[B]
- def flatten: EStream[A]
Pre-order traversal.
- def foldMap[B](f: (A) => B)(implicit arg0: Monoid[B]): B
Maps the elements of the Tree into a Monoid and folds the resulting Tree.
- def foldMapTrampoline[B](f: (A) => B)(implicit arg0: Monoid[B]): Free.Trampoline[B]
- def foldNode[Z](f: (A) => (EStream[Tree[A]]) => Z): Z
- def foldRight[B](z: => B)(f: (A, => B) => B): B
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def levels: EStream[EStream[A]]
Breadth-first traversal.
- def loc: TreeLoc[A]
A TreeLoc zipper of this tree, focused on the root node.
- def map[B](f: (A) => B): Tree[B]
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def scanr[B](g: (A, EStream[Tree[B]]) => B): Tree[B]
A histomorphic transform.
A histomorphic transform. Each element in the resulting tree is a function of the corresponding element in this tree and the histomorphic transform of its children.
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toStrictTree: StrictTree[A]
- def toString(): String
- Definition Classes
- AnyRef → Any
- def traverse1[G[_], B](f: (A) => G[B])(implicit arg0: Apply[G]): G[Tree[B]]
- def unzip[A1, A2](p: (A) => (A1, A2)): (Tree[A1], Tree[A2])
Turns a tree of pairs into a pair of trees.
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()