SketchMapMonoid

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 additive: algebra.Monoid[SketchMap[K, V]]

   These are from algebra.

   These are from algebra.Monoid

   Definition Classes

   Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

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

   Definition Classes

   Monoid

9. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. def combine(l: SketchMap[K, V], r: SketchMap[K, V]): SketchMap[K, V]

    Definition Classes

    Semigroup → Semigroup

11. def combineAll(t: TraversableOnce[SketchMap[K, V]]): SketchMap[K, V]

    Definition Classes

    Monoid → Monoid

12. def combineAllOption(as: TraversableOnce[SketchMap[K, V]]): Option[SketchMap[K, V]]

    Definition Classes

    Monoid → Semigroup

13. def combineN(a: SketchMap[K, V], n: Int): SketchMap[K, V]

    Definition Classes

    Monoid → Semigroup

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

    Create a Sketch Map sketch from a sequence of pairs.

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

    Create a Sketch Map sketch out of a single key/value pair.

16. def empty: SketchMap[K, V]

    Definition Classes

    Monoid → Monoid

17. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

18. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

19. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

20. def frequency(sm: SketchMap[K, V], key: K): V

    Calculates the approximate frequency for any key.

21. def frequencyWithHHCache(sm: SketchMap[K, V]): (K) ⇒ V

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

    Definition Classes

    AnyRef → Any

23. def hashCode(): Int

    Definition Classes

    AnyRef → Any

24. def heavyHitters(sm: SketchMap[K, V]): List[(K, V)]

    Returns a sorted list of heavy hitter key/value tuples.

25. def isEmpty(a: SketchMap[K, V])(implicit ev: Eq[SketchMap[K, V]]): Boolean

    Definition Classes

    Monoid

26. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    Monoid

28. def isZero(a: SketchMap[K, V])(implicit ev: Eq[SketchMap[K, V]]): Boolean

    Definition Classes

    AdditiveMonoid

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

    Definition Classes

    AnyRef

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

    Definition Classes

    Monoid

31. final def notify(): Unit

    Definition Classes

    AnyRef

32. final def notifyAll(): Unit

    Definition Classes

    AnyRef

33. val params: SketchMapParams[K]

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

    Definition Classes

    SketchMapMonoid → AdditiveSemigroup

35. def positiveSumN(a: SketchMap[K, V], n: Int): SketchMap[K, V]

    Attributes

    protected[this]

    Definition Classes

    AdditiveSemigroup

36. def repeatedCombineN(a: SketchMap[K, V], n: Int): SketchMap[K, V]

    Attributes

    protected[this]

    Definition Classes

    Semigroup

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

    Definition Classes

    Monoid → AdditiveMonoid

38. def sumN(a: SketchMap[K, V], n: Int): SketchMap[K, V]

    Definition Classes

    AdditiveMonoid → AdditiveSemigroup

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

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

    Returns an instance of T calculated by summing all instances in iter in one pass. Returns None if iter is empty, else Some[T].

    returns

    None if iter is empty, else an option value containing the summed T

    Definition Classes

    SketchMapMonoid → Semigroup

    Note

    Override if there is a faster way to compute this sum than iter.reduceLeftOption using plus.

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

    Definition Classes

    AnyRef

41. def toString(): String

    Definition Classes

    AnyRef → Any

42. def trySum(as: TraversableOnce[SketchMap[K, V]]): Option[SketchMap[K, V]]

    Definition Classes

    AdditiveMonoid → AdditiveSemigroup

43. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

46. 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