Class/Object

scalaz

StrictTree

Related Docs: object StrictTree | package scalaz

Permalink

case class StrictTree[A](rootLabel: A, subForest: Vector[StrictTree[A]]) extends Product with Serializable

rootLabel

The label at the root of this tree.

subForest

The child nodes of this tree.

Source
StrictTree.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. StrictTree
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new StrictTree(rootLabel: A, subForest: Vector[StrictTree[A]])

    Permalink

    rootLabel

    The label at the root of this tree.

    subForest

    The child nodes of this tree.

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

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

    Permalink

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

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

    Permalink

    A 2D String representation of this StrictTree.

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

    Permalink
    Definition Classes
    AnyRef
  9. def equals(obj: Any): Boolean

    Permalink
    Definition Classes
    StrictTree → Equals → AnyRef → Any
  10. def finalize(): Unit

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

    Permalink
  12. def flatten: Vector[A]

    Permalink

    Pre-order traversal.

  13. def foldMap[B](f: (A) ⇒ B)(implicit arg0: Monoid[B]): B

    Permalink

    Maps the elements of the StrictTree into a Monoid and folds the resulting StrictTree.

  14. def foldNode[Z](f: (A) ⇒ (Vector[StrictTree[A]]) ⇒ Z): Z

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

    Permalink
  16. final def getClass(): Class[_]

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

    Permalink

    This implementation is 24x faster than the trampolined implementation for StrictTreeTestJVM's hashCode test.

    This implementation is 24x faster than the trampolined implementation for StrictTreeTestJVM's hashCode test.

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

    Permalink
    Definition Classes
    Any
  19. def levels: Vector[Vector[A]]

    Permalink

    Breadth-first traversal.

  20. def map[B](f: (A) ⇒ B): StrictTree[B]

    Permalink
  21. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  24. val rootLabel: A

    Permalink

    The label at the root of this tree.

  25. def scanr[B](g: (A, Vector[StrictTree[B]]) ⇒ B): StrictTree[B]

    Permalink

    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.

  26. def size: Int

    Permalink
  27. val subForest: Vector[StrictTree[A]]

    Permalink

    The child nodes of this tree.

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

    Permalink
    Definition Classes
    AnyRef
  29. def toTree: Tree[A]

    Permalink
  30. def traverse1[G[_], B](f: (A) ⇒ G[B])(implicit arg0: Apply[G]): G[StrictTree[B]]

    Permalink
  31. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. def zip[B](b: StrictTree[B]): StrictTree[(A, B)]

    Permalink

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped