Packages

o

com.twitter.algebird

CorrelationAggregator

object CorrelationAggregator extends MonoidAggregator[(Double, Double), Correlation, Correlation]

Linear Supertypes
MonoidAggregator[(Double, Double), Correlation, Correlation], Aggregator[(Double, Double), Correlation, Correlation], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CorrelationAggregator
  2. MonoidAggregator
  3. Aggregator
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

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 andThenPresent[D](present2: (Correlation) => D): MonoidAggregator[(Double, Double), Correlation, D]

    Like calling andThen on the present function

    Like calling andThen on the present function

    Definition Classes
    MonoidAggregator → Aggregator
  5. def append(l: Correlation, r: (Double, Double)): Correlation
    Definition Classes
    Aggregator
  6. def appendAll(items: TraversableOnce[(Double, Double)]): Correlation
    Definition Classes
    MonoidAggregator
  7. def appendAll(old: Correlation, items: TraversableOnce[(Double, Double)]): Correlation
    Definition Classes
    Aggregator
  8. def apply(inputs: TraversableOnce[(Double, Double)]): Correlation

    This may error if inputs are empty (for Monoid Aggregators it never will, instead you see present(Monoid.zero[B])

    This may error if inputs are empty (for Monoid Aggregators it never will, instead you see present(Monoid.zero[B])

    Definition Classes
    Aggregator
  9. def applyCumulatively[In <: TraversableOnce[(Double, Double)], Out](inputs: In)(implicit bf: CanBuildFrom[In, Correlation, Out]): Out

    This returns the cumulative sum of its inputs, in the same order.

    This returns the cumulative sum of its inputs, in the same order. If the inputs are empty, the result will be empty too.

    Definition Classes
    Aggregator
  10. def applyOption(inputs: TraversableOnce[(Double, Double)]): Option[Correlation]

    This returns None if the inputs are empty

    This returns None if the inputs are empty

    Definition Classes
    Aggregator
  11. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  12. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  13. def collectBefore[A2](fn: PartialFunction[A2, (Double, Double)]): MonoidAggregator[A2, Correlation, Correlation]

    Only transform values where the function is defined, else discard

    Only transform values where the function is defined, else discard

    Definition Classes
    MonoidAggregator
  14. def composePrepare[A2](prepare2: (A2) => (Double, Double)): MonoidAggregator[A2, Correlation, Correlation]

    Like calling compose on the prepare function

    Like calling compose on the prepare function

    Definition Classes
    MonoidAggregator → Aggregator
  15. def correlation: MonoidAggregator[(Double, Double), Correlation, Double]
  16. def covariance: MonoidAggregator[(Double, Double), Correlation, Double]
  17. def cumulativeIterator(inputs: Iterator[(Double, Double)]): Iterator[Correlation]

    This returns the cumulative sum of its inputs, in the same order.

    This returns the cumulative sum of its inputs, in the same order. If the inputs are empty, the result will be empty too.

    Definition Classes
    Aggregator
  18. def either[A2, B2, C2](that: MonoidAggregator[A2, B2, C2]): MonoidAggregator[Either[(Double, Double), A2], (Correlation, B2), (Correlation, C2)]

    Build a MonoidAggregator that either takes left or right input and outputs the pair from both

    Build a MonoidAggregator that either takes left or right input and outputs the pair from both

    Definition Classes
    MonoidAggregator
  19. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  21. def filterBefore[A1 <: (Double, Double)](pred: (A1) => Boolean): MonoidAggregator[A1, Correlation, Correlation]

    Only aggregate items that match a predicate

    Only aggregate items that match a predicate

    Definition Classes
    MonoidAggregator
  22. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  23. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  24. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. def join[A2 <: (Double, Double), B2, C2](that: Aggregator[A2, B2, C2]): Aggregator[A2, (Correlation, B2), (Correlation, C2)]

    This allows you to run two aggregators on the same data with a single pass

    This allows you to run two aggregators on the same data with a single pass

    Definition Classes
    Aggregator
  27. def lift: MonoidAggregator[(Double, Double), Option[Correlation], Option[Correlation]]
    Definition Classes
    Aggregator
  28. def monoid: Monoid[Correlation]
    Definition Classes
    CorrelationAggregator → MonoidAggregator
  29. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  30. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  31. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  32. def prepare(a: (Double, Double)): Correlation
    Definition Classes
    CorrelationAggregator → Aggregator
  33. def present(c: Correlation): Correlation
    Definition Classes
    CorrelationAggregator → Aggregator
  34. final def reduce(items: TraversableOnce[Correlation]): Correlation

    This may error if items is empty.

    This may error if items is empty. To be safe you might use reduceOption if you don't know that items is non-empty

    Definition Classes
    MonoidAggregator → Aggregator
  35. def reduce(l: Correlation, r: Correlation): Correlation

    combine two inner values

    combine two inner values

    Definition Classes
    Aggregator
  36. def reduceOption(items: TraversableOnce[Correlation]): Option[Correlation]

    This is the safe version of the above.

    This is the safe version of the above. If the input in empty, return None, else reduce the items

    Definition Classes
    Aggregator
  37. def semigroup: Monoid[Correlation]
    Definition Classes
    MonoidAggregator → Aggregator
  38. def sumBefore: MonoidAggregator[TraversableOnce[(Double, Double)], Correlation, Correlation]

    This maps the inputs to Bs, then sums them, effectively flattening the inputs to the MonoidAggregator

    This maps the inputs to Bs, then sums them, effectively flattening the inputs to the MonoidAggregator

    Definition Classes
    MonoidAggregator
  39. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  40. def toFold: Fold[(Double, Double), Option[Correlation]]

    An Aggregator can be converted to a Fold, but not vice-versa Note, a Fold is more constrained so only do this if you require joining a Fold with an Aggregator to produce a Fold

    An Aggregator can be converted to a Fold, but not vice-versa Note, a Fold is more constrained so only do this if you require joining a Fold with an Aggregator to produce a Fold

    Definition Classes
    Aggregator
  41. def toString(): String
    Definition Classes
    AnyRef → Any
  42. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  43. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  44. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  45. def zip[A2, B2, C2](ag2: MonoidAggregator[A2, B2, C2]): MonoidAggregator[((Double, Double), A2), (Correlation, B2), (Correlation, C2)]

    This allows you to join two aggregators into one that takes a tuple input, which in turn allows you to chain .composePrepare onto the result if you have an initial input that has to be prepared differently for each of the joined aggregators.

    This allows you to join two aggregators into one that takes a tuple input, which in turn allows you to chain .composePrepare onto the result if you have an initial input that has to be prepared differently for each of the joined aggregators.

    The law here is: ag1.zip(ag2).apply(as.zip(bs)) == (ag1(as), ag2(bs))

    Definition Classes
    MonoidAggregator
  46. def zip[A2, B2, C2](ag2: Aggregator[A2, B2, C2]): Aggregator[((Double, Double), A2), (Correlation, B2), (Correlation, C2)]

    This allows you to join two aggregators into one that takes a tuple input, which in turn allows you to chain .composePrepare onto the result if you have an initial input that has to be prepared differently for each of the joined aggregators.

    This allows you to join two aggregators into one that takes a tuple input, which in turn allows you to chain .composePrepare onto the result if you have an initial input that has to be prepared differently for each of the joined aggregators.

    The law here is: ag1.zip(ag2).apply(as.zip(bs)) == (ag1(as), ag2(bs))

    Definition Classes
    Aggregator

Inherited from MonoidAggregator[(Double, Double), Correlation, Correlation]

Inherited from Aggregator[(Double, Double), Correlation, Correlation]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped