com.twitter.algebird

HyperLogLogAggregator

case class HyperLogLogAggregator(hllMonoid: HyperLogLogMonoid) extends MonoidAggregator[Array[Byte], HLL, HLL] with Product with Serializable

Linear Supertypes
Serializable, Product, Equals, MonoidAggregator[Array[Byte], HLL, HLL], Aggregator[Array[Byte], HLL, HLL], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. HyperLogLogAggregator
  2. Serializable
  3. Product
  4. Equals
  5. MonoidAggregator
  6. Aggregator
  7. Serializable
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new HyperLogLogAggregator(hllMonoid: HyperLogLogMonoid)

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 andThenPresent[D](present2: (HLL) ⇒ D): MonoidAggregator[Array[Byte], HLL, D]

    Like calling andThen on the present function

    Like calling andThen on the present function

    Definition Classes
    MonoidAggregatorAggregator
  7. def append(l: HLL, r: Array[Byte]): HLL

    Definition Classes
    Aggregator
  8. def appendAll(items: TraversableOnce[Array[Byte]]): HLL

    Definition Classes
    MonoidAggregator
  9. def appendAll(old: HLL, items: TraversableOnce[Array[Byte]]): HLL

    Definition Classes
    Aggregator
  10. def apply(inputs: TraversableOnce[Array[Byte]]): HLL

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

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

    Definition Classes
    Aggregator
  11. def applyCumulatively[In <: TraversableOnce[Array[Byte]], Out](inputs: In)(implicit bf: CanBuildFrom[In, HLL, 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
  12. def applyOption(inputs: TraversableOnce[Array[Byte]]): Option[HLL]

    This returns None if the inputs are empty

    This returns None if the inputs are empty

    Definition Classes
    Aggregator
  13. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  14. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  15. def composePrepare[A2](prepare2: (A2) ⇒ Array[Byte]): MonoidAggregator[A2, HLL, HLL]

    Like calling compose on the prepare function

    Like calling compose on the prepare function

    Definition Classes
    MonoidAggregatorAggregator
  16. def cumulativeIterator(inputs: Iterator[Array[Byte]]): Iterator[HLL]

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

    Definition Classes
    AnyRef
  18. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  19. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  20. val hllMonoid: HyperLogLogMonoid

  21. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  22. def join[A2 <: Array[Byte], B2, C2](that: Aggregator[A2, B2, C2]): Aggregator[A2, (HLL, B2), (HLL, 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
  23. def lift: MonoidAggregator[Array[Byte], Option[HLL], Option[HLL]]

    Definition Classes
    Aggregator
  24. val monoid: HyperLogLogMonoid

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

    Definition Classes
    AnyRef
  26. final def notify(): Unit

    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  28. def prepare(value: Array[Byte]): HLL

    Definition Classes
    HyperLogLogAggregatorAggregator
  29. def present(hll: HLL): HLL

    Definition Classes
    HyperLogLogAggregatorAggregator
  30. final def reduce(items: TraversableOnce[HLL]): HLL

    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
    MonoidAggregatorAggregator
  31. def reduce(l: HLL, r: HLL): HLL

    combine two inner values

    combine two inner values

    Definition Classes
    Aggregator
  32. def reduceOption(items: TraversableOnce[HLL]): Option[HLL]

    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
  33. def semigroup: Monoid[HLL]

    Definition Classes
    MonoidAggregatorAggregator
  34. def sumBefore: MonoidAggregator[TraversableOnce[Array[Byte]], HLL, HLL]

    Definition Classes
    MonoidAggregator
  35. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  36. def toFold: Fold[Array[Byte], Option[HLL]]

    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
  37. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. def zip[A2, B2, C2](ag2: Aggregator[A2, B2, C2]): Aggregator[(Array[Byte], A2), (HLL, B2), (HLL, C2)]

    This allows you to join two aggregators into one that takes a tuple input, which in turn allows you to chain .

    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 Serializable

Inherited from Product

Inherited from Equals

Inherited from MonoidAggregator[Array[Byte], HLL, HLL]

Inherited from Aggregator[Array[Byte], HLL, HLL]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped