scalaz

Tree

trait Tree [+A] extends AnyRef

A multi-way tree, also known as a rose tree. Also known as Cofree[Stream, A].

Attributes
sealed
Source
Tree.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Tree
  2. AnyRef
  3. Any
Visibility
  1. Public
  2. All

Abstract Value Members

  1. def rootLabel : A

    The label at the root of this tree.

    The label at the root of this tree.

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

    The child nodes of this tree.

    The child nodes of this tree.

    Attributes
    abstract

Concrete Value Members

  1. def != (arg0: AnyRef): Boolean

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

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

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

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

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

    Attributes
    final
    Definition Classes
    Any
  7. def clone (): AnyRef

    Attributes
    protected[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 [B >: A] (implicit sh: Show[B]): Stream[String]

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

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

    A 2D String representation of this Tree.

  11. def eq (arg0: AnyRef): Boolean

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

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

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  14. def flatten : Stream[A]

    Pre-order traversal.

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

  16. def getClass (): java.lang.Class[_]

    Attributes
    final
    Definition Classes
    AnyRef → Any
  17. def hashCode (): Int

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

    Attributes
    final
    Definition Classes
    Any
  19. def levels : Stream[Stream[A]]

    Breadth-first traversal.

  20. def loc : TreeLoc[A]

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

  21. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  22. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
  23. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
  24. 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.

  25. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  26. def toString (): String

    Definition Classes
    AnyRef → Any
  27. def unzip [A1, A2] (implicit p: (A) ⇒ (A1, A2)): (Tree[A1], Tree[A2])

    Turns a tree of pairs into a pair of trees.

  28. def wait (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from AnyRef

Inherited from Any