com.twitter.algebird

SketchMapMonoid

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

Responsible for creating instances of SketchMap.

Linear Supertypes
Monoid[SketchMap[K, V]], Semigroup[SketchMap[K, V]], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SketchMapMonoid
  2. Monoid
  3. Semigroup
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SketchMapMonoid(params: SketchMapParams[K])(implicit valueOrdering: Ordering[V], monoid: Monoid[V])

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. final def asInstanceOf[T0]: T0

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

    Definition Classes
    Monoid
  8. def clone(): AnyRef

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

    Create a Sketch Map sketch from a sequence of pairs.

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

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

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

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

    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. def frequency(sm: SketchMap[K, V], key: K): V

    Calculates the approximate frequency for any key.

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

    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  17. def heavyHitters(sm: SketchMap[K, V]): List[(K, V)]

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

  18. final def isInstanceOf[T0]: Boolean

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

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

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

    Definition Classes
    Monoid
  22. final def notify(): Unit

    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  24. val params: SketchMapParams[K]

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

    Definition Classes
    SketchMapMonoidSemigroup
  26. def sum(vs: TraversableOnce[SketchMap[K, V]]): SketchMap[K, V]

    Definition Classes
    Monoid
  27. def sumOption(iter: 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
    Semigroup
  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  29. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. 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
    SketchMapMonoidMonoid

Inherited from Monoid[SketchMap[K, V]]

Inherited from Semigroup[SketchMap[K, V]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped