class SketchMapMonoid[K, V] extends Monoid[SketchMap[K, V]] with CommutativeMonoid[SketchMap[K, V]]
Responsible for creating instances of SketchMap.
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- SketchMapMonoid
- CommutativeMonoid
- CommutativeSemigroup
- Monoid
- AdditiveMonoid
- Monoid
- Semigroup
- AdditiveSemigroup
- Semigroup
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new SketchMapMonoid(params: SketchMapParams[K])(implicit valueOrdering: Ordering[V], monoid: Monoid[V])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
additive: algebra.Monoid[SketchMap[K, V]]
These are from algebra.Monoid
-
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
combine(l: SketchMap[K, V], r: SketchMap[K, V]): SketchMap[K, V]
- Definition Classes
- Semigroup → Semigroup
-
def
combineAll(t: TraversableOnce[SketchMap[K, V]]): SketchMap[K, V]
- Definition Classes
- Monoid → Monoid
-
def
combineAllOption(as: TraversableOnce[SketchMap[K, V]]): Option[SketchMap[K, V]]
- Definition Classes
- Monoid → Semigroup
-
def
combineN(a: SketchMap[K, V], n: Int): SketchMap[K, V]
- Definition Classes
- Monoid → Semigroup
-
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.
-
def
empty: SketchMap[K, V]
- Definition Classes
- Monoid → Monoid
-
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] )
-
def
frequency(sm: SketchMap[K, V], key: K): V
Calculates the approximate frequency for any key.
- def frequencyWithHHCache(sm: SketchMap[K, V]): (K) ⇒ V
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
def
heavyHitters(sm: SketchMap[K, V]): List[(K, V)]
Returns a sorted list of heavy hitter key/value tuples.
-
def
isEmpty(a: SketchMap[K, V])(implicit ev: Eq[SketchMap[K, V]]): Boolean
- Definition Classes
- Monoid
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isNonZero(v: SketchMap[K, V]): Boolean
- Definition Classes
- Monoid
-
def
isZero(a: SketchMap[K, V])(implicit ev: Eq[SketchMap[K, V]]): Boolean
- Definition Classes
- AdditiveMonoid
-
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]
-
def
plus(left: SketchMap[K, V], right: SketchMap[K, V]): SketchMap[K, V]
- Definition Classes
- SketchMapMonoid → AdditiveSemigroup
-
def
positiveSumN(a: SketchMap[K, V], n: Int): SketchMap[K, V]
- Attributes
- protected[this]
- Definition Classes
- AdditiveSemigroup
-
def
repeatedCombineN(a: SketchMap[K, V], n: Int): SketchMap[K, V]
- Attributes
- protected[this]
- Definition Classes
- Semigroup
-
def
sum(vs: TraversableOnce[SketchMap[K, V]]): SketchMap[K, V]
- Definition Classes
- Monoid → AdditiveMonoid
-
def
sumN(a: SketchMap[K, V], n: Int): SketchMap[K, V]
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
-
def
sumOption(items: TraversableOnce[SketchMap[K, V]]): Option[SketchMap[K, V]]
Returns an instance of
Tcalculated by summing all instances initerin one pass.Returns an instance of
Tcalculated by summing all instances initerin one pass. ReturnsNoneifiteris empty, elseSome[T].- returns
Noneifiteris empty, else an option value containing the summedT
- Definition Classes
- SketchMapMonoid → Semigroup
- Note
Override if there is a faster way to compute this sum than
iter.reduceLeftOptionusing plus.
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
trySum(as: TraversableOnce[SketchMap[K, V]]): Option[SketchMap[K, V]]
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
-
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 → AdditiveMonoid