HyperLogLogAggregator

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(bits: Int): HyperLogLogAggregator

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 sizeAggregator(bits: Int): MonoidAggregator[Array[Byte], HLL, Double]

    Create an Aggregator that returns the estimate size, not the HLL approximate data structure itself.

    Create an Aggregator that returns the estimate size, not the HLL approximate data structure itself. This is convenient, but cannot be combined later with another unique count like an HLL could.

    bits

    is the log of the size the HLL.

19. def sizeWithError(err: Double): MonoidAggregator[Array[Byte], HLL, Double]

    Give an approximate set size (not the HLL) based on inputs of Array[Byte] see HyperLogLog.

    Give an approximate set size (not the HLL) based on inputs of Array[Byte] see HyperLogLog.bitsForError for a size table based on the error see SetSizeHashAggregator for a version that uses exact sets up to a given size

20. def sizeWithErrorGeneric[K](err: Double)(implicit hash128: Hash128[K]): MonoidAggregator[K, HLL, Long]

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

    Definition Classes

    AnyRef

22. def toString(): String

    Definition Classes

    AnyRef → Any

23. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26. def withBits[K](bits: Int)(implicit hash128: Hash128[K]): GenHLLAggregator[K]

    This creates an HLL for type K, that uses (2^bits) bytes to store

27. def withError(err: Double): HyperLogLogAggregator

    Give a HyperLogLog Aggregator that have the given error.

    Give a HyperLogLog Aggregator that have the given error. It is up to you, using bitsForError, to see if the size is still practical for your application.

    0.016 (1.6%), 4 KB 0.006 (0.6%), 32 KB 0.002 (0.2%), 256 KB 0.001 (0.1%), 1024 KB

    Cutting the error in half takes 4x the size.

28. def withErrorGeneric[K](err: Double)(implicit arg0: Hash128[K]): GenHLLAggregator[K]