StrictTree

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: (StrictTree[A]) ⇒ B): StrictTree[B]

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

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

   A 2D String representation of this StrictTree.

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

    Definition Classes

    AnyRef

11. def equals(obj: Any): Boolean

    Definition Classes

    StrictTree → Equals → AnyRef → Any

12. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. def flatMap[B](f: (A) ⇒ StrictTree[B]): StrictTree[B]

14. def flatten: Vector[A]

    Pre-order traversal.

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

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

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

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

    Definition Classes

    AnyRef → Any

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

    returns

    Definition Classes

    StrictTree → AnyRef → Any

20. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

21. def levels: Vector[Vector[A]]

    Breadth-first traversal.

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

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

    Definition Classes

    AnyRef

24. final def notify(): Unit

    Definition Classes

    AnyRef

25. final def notifyAll(): Unit

    Definition Classes

    AnyRef

26. val rootLabel: A

    The label at the root of this tree.

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

28. def size: Int

29. val subForest: Vector[StrictTree[A]]

    The child nodes of this tree.

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

    Definition Classes

    AnyRef

31. def toTree: Tree[A]

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

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( ... )

36. def zip[B](b: StrictTree[B]): StrictTree[(A, B)]