HyperLogLogMonoid

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def assertNotZero(v: HLL): Unit

val bits: Int

def clone(): AnyRef

def create(example: Array[Byte]): HLL

def createFromHashBytes(hashed: Array[Byte]): HLL

def createFromHashLongs(l0: Long, l1: Long): HLL

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def estimateIntersectionSize(his: Seq[HLL]): Double

final def estimateSize(hll: HLL): Double

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def intersectionSize(his: Seq[HLL]): Approximate[Long]

final def isInstanceOf[T0]: Boolean

def isNonZero(v: HLL): Boolean

final def ne(arg0: AnyRef): Boolean

def nonZeroOption(v: HLL): Option[HLL]

final def notify(): Unit

final def notifyAll(): Unit

def plus(left: HLL, right: HLL): HLL

Combines two T instances associatively.

val size: Int

final def sizeOf(hll: HLL): Approximate[Long]

def sum(vs: TraversableOnce[HLL]): HLL

def sumOption(items: TraversableOnce[HLL]): Option[HLL]

Returns an instance of T calculated by summing all instances in iter in one pass.

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

def toHLL[K](k: K)(implicit hash128: Hash128[K]): HLL

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

val zero: HLL

Returns the identity element of T for plus.

def apply[T](t: T)(implicit arg0: (T) ⇒ Array[Byte]): HLL

def batchCreate[T](instances: Iterable[T])(implicit arg0: (T) ⇒ Array[Byte]): HLL