StrictTree

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

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

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

   

   A 2D String representation of this StrictTree.

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

   

   Definition Classes

   AnyRef

9. def equals(obj: Any): Boolean

   

   Definition Classes

   StrictTree → Equals → AnyRef → Any

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

12. def flatten: Vector[A]

    

    Pre-order traversal.

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

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

    

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

    

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

    

    Definition Classes

    AnyRef → Any

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

18. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Breadth-first traversal.

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

    

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

    

    Definition Classes

    AnyRef

22. final def notify(): Unit

    

    Definition Classes

    AnyRef

23. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

24. val rootLabel: A

    

    The label at the root of this tree.

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

26. def size: Int

    

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

    

    The child nodes of this tree.

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

    

    Definition Classes

    AnyRef

29. def toTree: Tree[A]

    

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

    

31. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

32. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

33. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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