com.stripe.brushfire.Reorder

WeightedReorder

class WeightedReorder[A] extends Reorder[A]

Linear Supertypes
Reorder[A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. WeightedReorder
  2. Reorder
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new WeightedReorder()(implicit ev: Ordering[A])

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. 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
    WeightedReorder → Reorder

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

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

    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  16. final def notify(): Unit

    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  18. 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
    WeightedReorder → Reorder

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

    Definition Classes
    AnyRef

  20. def toString(): String

    Definition Classes
    AnyRef → Any

  21. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Reorder[A]

Inherited from AnyRef

Inherited from Any

Ungrouped