c

scalaz

# Tree 

### Companion object Tree

#### 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
1. Alphabetic
2. By Inheritance
Inherited
1. Tree
2. AnyRef
3. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### Abstract Value Members

1. abstract def rootLabel: A

The label at the root of this tree.

2. abstract def subForest: Stream[Tree[A]]

The child nodes of this tree.

### Concrete Value Members

1. final def !=(arg0: Any)
Definition Classes
AnyRef → Any
2. final def ##(): Int
Definition Classes
AnyRef → Any
3. final def ==(arg0: Any)
Definition Classes
AnyRef → Any
4. final def asInstanceOf[T0]: T0
Definition Classes
Any
5. def clone()
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws( ... ) @native()
6. def cobind[B](f: (Tree[A]) ⇒ B): Tree[B]

Binds the given function across all the subtrees of this tree.

7. def drawTree(implicit sh: Show[A]): String

A 2D String representation of this Tree.

8. final def eq(arg0: AnyRef)
Definition Classes
AnyRef
9. def equals(arg0: Any)
Definition Classes
AnyRef → Any
10. def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
11. def flatMap[B](f: (A) ⇒ Tree[B]): Tree[B]
12. def flatten: Stream[A]

Pre-order traversal.

13. 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.

14. def foldMapTrampoline[B](f: (A) ⇒ B)(implicit arg0: Monoid[B]): Trampoline[B]
15. def foldNode[Z](f: (A) ⇒ (Stream[Tree[A]]) ⇒ Z): Z
16. def foldRight[B](z: ⇒ B)(f: (A, ⇒ B) ⇒ B): B
17. final def getClass(): Class[_]
Definition Classes
AnyRef → Any
Annotations
@native()
18. def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native()
19. final def isInstanceOf[T0]
Definition Classes
Any
20. def levels: Stream[Stream[A]]

21. def loc: TreeLoc[A]

A TreeLoc zipper of this tree, focused on the root node.

22. def map[B](f: (A) ⇒ B): Tree[B]
23. final def ne(arg0: AnyRef)
Definition Classes
AnyRef
24. final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
25. final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
26. def scanr[B](g: (A, Stream[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.

27. final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
28. def toStrictTree: StrictTree[A]
29. def toString()
Definition Classes
AnyRef → Any
30. def traverse1[G[_], B](f: (A) ⇒ G[B])(implicit arg0: Apply[G]): G[Tree[B]]
31. def unzip[A1, A2](implicit p: (A) ⇒ (A1, A2)): (Tree[A1], Tree[A2])

Turns a tree of pairs into a pair of trees.

32. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
33. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
34. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws( ... ) @native()