scalaz

Tree

sealed trait 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
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Tree
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
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: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def cobind[B](f: (Tree[A]) ⇒ B): Tree[B]

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

  9. def draw(implicit sh: Show[A]): Stream[String]

    A 2D String representation of this Tree, separated into lines.

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

    A 2D String representation of this Tree.

  11. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. def flatMap[B](f: (A) ⇒ Tree[B]): Tree[B]

  15. def flatten: Stream[A]

    Pre-order traversal.

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

  17. def foldNode[Z](f: (A) ⇒ (Stream[Tree[A]]) ⇒ Z): Z

  18. def foldRight[B](z: ⇒ B)(f: (A, ⇒ B) ⇒ B): B

  19. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  20. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  21. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  22. def levels: Stream[Stream[A]]

    Breadth-first traversal.

  23. def loc: TreeLoc[A]

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

  24. def map[B](f: (A) ⇒ B): Tree[B]

  25. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  26. final def notify(): Unit

    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  28. 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.

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

    Definition Classes
    AnyRef
  30. def toString(): String

    Definition Classes
    AnyRef → Any
  31. def traverse1[G[_], B](f: (A) ⇒ G[B])(implicit arg0: Apply[G]): G[Tree[B]]

  32. def unzip[A1, A2](implicit p: (A) ⇒ (A1, A2)): (Tree[A1], Tree[A2])

    Turns a tree of pairs into a pair of trees.

  33. final def wait(): Unit

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped