SketchMapMonoid

Instance Constructors

new SketchMapMonoid(width: Int, depth: Int, seed: Int, heavyHittersCount: Int)(implicit serialization: (K) ⇒ Array[Byte], valueOrdering: Ordering[V], monoid: Monoid[V])

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def assertNotZero(v: SketchMap[K, V]): Unit

Definition Classes
Monoid
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def create(data: Seq[(K, V)]): SketchMap[K, V]

Create a Sketch Map sketch from a sequence of pairs.
def create(pair: (K, V)): SketchMap[K, V]

Create a Sketch Map sketch out of a single key/value pair.
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
val hashes: Seq[(K) ⇒ Int]
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isNonZero(v: SketchMap[K, V]): Boolean

Definition Classes
Monoid
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nonZeroOption(v: SketchMap[K, V]): Option[SketchMap[K, V]]

Definition Classes
Monoid
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val params: SketchMapParams[K]

All Sketch Maps created with this monoid will have the same parameter configuration.
def plus(left: SketchMap[K, V], right: SketchMap[K, V]): SketchMap[K, V]

We assume the Sketch Map on the left and right use the same hash functions.
We assume the Sketch Map on the left and right use the same hash functions.

Definition Classes
SketchMapMonoid → Semigroup
def sum(vs: TraversableOnce[SketchMap[K, V]]): SketchMap[K, V]

Definition Classes
Monoid
def sumOption(items: TraversableOnce[SketchMap[K, V]]): Option[SketchMap[K, V]]

override this if there is a faster way to do this sum than reduceLeftOption on plus
override this if there is a faster way to do this sum than reduceLeftOption on plus

Definition Classes
SketchMapMonoid → Semigroup
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )
val zero: SketchMap[K, V]

A zero Sketch Map is one with zero elements.
A zero Sketch Map is one with zero elements.

Definition Classes
SketchMapMonoid → Monoid

class SketchMapMonoid[K, V] extends Monoid[SketchMap[K, V]]

Instance Constructors

new SketchMapMonoid(width: Int, depth: Int, seed: Int, heavyHittersCount: Int)(implicit serialization: (K) ⇒ Array[Byte], valueOrdering: Ordering[V], monoid: Monoid[V])

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def assertNotZero(v: SketchMap[K, V]): Unit

def clone(): AnyRef

def create(data: Seq[(K, V)]): SketchMap[K, V]

def create(pair: (K, V)): SketchMap[K, V]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

val hashes: Seq[(K) ⇒ Int]

final def isInstanceOf[T0]: Boolean

def isNonZero(v: SketchMap[K, V]): Boolean

final def ne(arg0: AnyRef): Boolean

def nonZeroOption(v: SketchMap[K, V]): Option[SketchMap[K, V]]

final def notify(): Unit

final def notifyAll(): Unit

val params: SketchMapParams[K]

def plus(left: SketchMap[K, V], right: SketchMap[K, V]): SketchMap[K, V]

def sum(vs: TraversableOnce[SketchMap[K, V]]): SketchMap[K, V]

def sumOption(items: TraversableOnce[SketchMap[K, V]]): Option[SketchMap[K, V]]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

val zero: SketchMap[K, V]

Inherited from Monoid[SketchMap[K, V]]

Inherited from Semigroup[SketchMap[K, V]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped