SketchMapMonoid

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def additive: algebra.Monoid[SketchMap[K, V]]

   

   These are from algebra.Monoid

   These are from algebra.Monoid

   Definition Classes

   Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

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

   

   Definition Classes

   Monoid

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   Semigroup → Semigroup

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

   

   Definition Classes

   Monoid → Monoid

10. def combineAllOption(as: IterableOnce[SketchMap[K, V]]): Option[SketchMap[K, V]]

    

    Definition Classes

    Monoid → Semigroup

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

    

    Definition Classes

    Monoid → Semigroup

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

    

    Create a Sketch Map sketch from a sequence of pairs.

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

    

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

14. def empty: SketchMap[K, V]

    

    Definition Classes

    Monoid → Monoid

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

    

    Definition Classes

    AnyRef

16. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

17. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Calculates the approximate frequency for any key.

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

    

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

    

    Definition Classes

    AnyRef → Any

21. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

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

    

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

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

    

    Definition Classes

    Monoid

24. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    Monoid

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

    

    Definition Classes

    AdditiveMonoid

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

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    Monoid

29. final def notify(): Unit

    

    Definition Classes

    AnyRef

30. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

31. val params: SketchMapParams[K]

    

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

    

    Definition Classes

    SketchMapMonoid → AdditiveSemigroup

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

    

    Attributes

    protected[this]

    Definition Classes

    AdditiveSemigroup

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

    

    Attributes

    protected[this]

    Definition Classes

    Semigroup

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

    

    Definition Classes

    Monoid → AdditiveMonoid

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

    

    Definition Classes

    AdditiveMonoid → AdditiveSemigroup

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

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

    

    Definition Classes

    AnyRef

39. def toString(): String

    

    Definition Classes

    AnyRef → Any

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

    

    Definition Classes

    AdditiveMonoid → AdditiveSemigroup

41. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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