Reorder

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. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

7. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

8. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

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

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

   

   Definition Classes

   AnyRef → Any

10. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

11. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

13. final def notify(): Unit

    

    Definition Classes

    AnyRef

14. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

15. def probabilisticWeightedDepthFirst[A](seed: Int, conversion: (A) ⇒ Double): Reorder[A]

    

    Reorder instance that traverses into a random node, but choose the random node based on the ratio between its weight and the total weight of both nodes.

    Reorder instance that traverses into a random node, but choose the random node based on the ratio between its weight and the total weight of both nodes.

    If the left node's weight was 10, and the right node's weight was 5, the left node would be picked 2/3 of the time.

16. def shuffled[A](seed: Int): Reorder[A]

    

    Reorder instance that traverses into a random node first.

    Reorder instance that traverses into a random node first. Each node has equal probability of being selected.

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

    

    Definition Classes

    AnyRef

18. def toString(): String

    

    Definition Classes

    AnyRef → Any

19. def unchanged[A]: Reorder[A]

    

    Reorder instance that traverses into the left node first.

20. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

23. def weightedDepthFirst[A](implicit ev: Ordering[A]): Reorder[A]

    

    Reorder instance that traverses into the node with the higher weight first.