ProbabilisticWeighted

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. def apply[N, S](n1: N, n2: N, f: (N) ⇒ A, g: (N, N) ⇒ S): S

   

   Perform a reordering.

   Perform a reordering.

   This method takes two nodes (n1 and n2), as well as two functions:

   • f: function from node to identifying annotation
   • g: function from two nodes to a combined result

   The f function is used in cases where sorting or weighting is necessary (in those cases A will be a weight or similar). The g function is used to recurse on the result -- i.e. the possibly reordered nodes n1 and n2 will be passed to g after the reordering occurs.

   Definition Classes

   ProbabilisticWeighted → Reorder

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   AnyRef

8. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

9. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

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

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

    

    Definition Classes

    AnyRef → Any

11. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

12. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

14. final def notify(): Unit

    

    Definition Classes

    AnyRef

15. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

16. def setSeed(seed: Option[String]): Reorder[A]

    

    Seed a reorder instance with a stable identifier.

    Seed a reorder instance with a stable identifier.

    This ensures that reorders which are non-deterministic in general (e.g. shuffled) will produce the same reordering for the same seed across many traversals.

    On deterministic reorders this method is a noop.

    Definition Classes

    ProbabilisticWeighted → Reorder

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

    

    Definition Classes

    AnyRef

18. def toString(): String

    

    Definition Classes

    AnyRef → Any

19. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )