SketchMapAggregator

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def andThenPresent[D](present2: (SketchMap[K, V]) ⇒ D): Aggregator[(K, V), SketchMap[K, V], D]

Like calling andThen on the present function

def append(l: SketchMap[K, V], r: (K, V)): SketchMap[K, V]

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

def appendAll(old: SketchMap[K, V], items: TraversableOnce[(K, V)]): SketchMap[K, V]

def apply(inputs: TraversableOnce[(K, V)]): SketchMap[K, V]

final def asInstanceOf[T0]: T0

def canEqual(arg0: Any): Boolean

def clone(): AnyRef

def composePrepare[A1](prepare2: (A1) ⇒ (K, V)): Aggregator[A1, SketchMap[K, V], SketchMap[K, V]]

Like calling compose on the prepare function

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): java.lang.Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

val monoid: SketchMapMonoid[K, V]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val params: SketchMapParams[K]

def prepare(value: (K, V)): SketchMap[K, V]

def present(skm: SketchMap[K, V]): SketchMap[K, V]

def productArity: Int

def productElement(arg0: Int): Any

def productIterator: Iterator[Any]

def productPrefix: String

final def reduce(items: TraversableOnce[SketchMap[K, V]]): SketchMap[K, V]

final def reduce(l: SketchMap[K, V], r: SketchMap[K, V]): SketchMap[K, V]

val skmMonoid: SketchMapMonoid[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

def productElements: Iterator[Any]