HyperLogLog

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

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

12. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

13. def fromByteBuffer(bb: ByteBuffer): HLL

14. def fromBytes(bytes: Array[Byte]): HLL

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

    Definition Classes

    AnyRef → Any

16. def hash(input: Array[Byte]): Array[Byte]

17. def hashCode(): Int

    Definition Classes

    AnyRef → Any

18. val hashSize: Int

19. implicit def int2Bytes(i: Int): Array[Byte]

20. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

21. def j(bsl: BitSetLite, bits: Int): Int

    the value 'j' is equal to <w_0, w_1 .

    the value 'j' is equal to <w_0, w_1 ... w_(bits-1)> TODO: We could read in a byte at a time.

22. def jRhoW(in: Array[Byte], bits: Int): (Int, Byte)

    We are computing j and \rho(w) from the paper, sorry for the name, but it allows someone to compare to the paper extremely low probability rhow (position of the leftmost one bit) is > 127, so we use a Byte to store it Given a hash <w_0, w_1, w_2 .

    We are computing j and \rho(w) from the paper, sorry for the name, but it allows someone to compare to the paper extremely low probability rhow (position of the leftmost one bit) is > 127, so we use a Byte to store it Given a hash <w_0, w_1, w_2 ... w_n> the value 'j' is equal to <w_0, w_1 ... w_(bits-1)> and the value 'w' is equal to <w_bits ... w_n>. The function rho counts the number of leading zeroes in 'w'. We can calculate rho(w) at once with the method rhoW.

23. implicit def long2Bytes(i: Long): Array[Byte]

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

    Definition Classes

    AnyRef

25. final def notify(): Unit

    Definition Classes

    AnyRef

26. final def notifyAll(): Unit

    Definition Classes

    AnyRef

27. def rhoW(bsl: BitSetLite, bits: Int): Byte

    The value 'w' is equal to <w_bits .

    The value 'w' is equal to <w_bits ... w_n>. The function rho counts the number of leading zeroes in 'w'. We can calculate rho(w) at once with the method rhoW.

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

    Definition Classes

    AnyRef

29. def toBytes(h: HLL): Array[Byte]

30. def toString(): String

    Definition Classes

    AnyRef → Any

31. def twopow(i: Int): Double

32. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )