Packages

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
Serializable, Serializable, Product, Equals, AnyRef, Any
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]])

    rootLabel

    The label at the root of this tree.

    subForest

    The child nodes of this tree.

Value Members

  1. def cobind[B](f: (StrictTree[A]) ⇒ B): StrictTree[B]

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

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

    A 2D String representation of this StrictTree.

  3. def equals(obj: Any): Boolean
    Definition Classes
    StrictTree → Equals → AnyRef → Any
  4. def flatMap[B](f: (A) ⇒ StrictTree[B]): StrictTree[B]
  5. def flatten: Vector[A]

    Pre-order traversal.

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

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

  7. def foldNode[Z](f: (A) ⇒ (Vector[StrictTree[A]]) ⇒ Z): Z
  8. def foldRight[B](z: B)(f: (A, ⇒ B) ⇒ B): B
  9. def hashCode(): Int

    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
  10. def levels: Vector[Vector[A]]

    Breadth-first traversal.

  11. def map[B](f: (A) ⇒ B): StrictTree[B]
  12. val rootLabel: A
  13. def scanr[B](g: (A, Vector[StrictTree[B]]) ⇒ B): StrictTree[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.

  14. def size: Int
  15. val subForest: Vector[StrictTree[A]]
  16. def toTree: Tree[A]
  17. def traverse1[G[_], B](f: (A) ⇒ G[B])(implicit arg0: Apply[G]): G[StrictTree[B]]
  18. def zip[B](b: StrictTree[B]): StrictTree[(A, B)]