com.twitter.algebird

TopKMonoid

class TopKMonoid[T] extends Monoid[TopK[T]]

A top-k monoid that is much faster than SortedListTake equivalent to: (left ++ right).sorted.take(k) but doesn't do a total sort If you can handle the mutability, mutable.PriorityQueueMonoid is even faster.

NOTE!!!! This assumes the inputs are already sorted! resorting each time kills speed

Linear Supertypes
Monoid[TopK[T]], AdditiveMonoid[TopK[T]], cats.kernel.Monoid[TopK[T]], Semigroup[TopK[T]], AdditiveSemigroup[TopK[T]], cats.kernel.Semigroup[TopK[T]], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. TopKMonoid
  2. Monoid
  3. AdditiveMonoid
  4. Monoid
  5. Semigroup
  6. AdditiveSemigroup
  7. Semigroup
  8. Serializable
  9. Serializable
  10. AnyRef
  11. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TopKMonoid(k: Int)(implicit ord: Ordering[T])

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[TopK[T]]

    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: TopK[T]): Unit

    Definition Classes
    Monoid

  9. def build(ts: Iterable[T]): TopK[T]

  10. def build(t: T): TopK[T]

  11. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  12. def combine(l: TopK[T], r: TopK[T]): TopK[T]

    Definition Classes
    Semigroup → Semigroup

  13. def combineAll(t: TraversableOnce[TopK[T]]): TopK[T]

    Definition Classes
    Monoid → Monoid

  14. def combineAllOption(as: TraversableOnce[TopK[T]]): Option[TopK[T]]

    Definition Classes
    Monoid → Semigroup

  15. def combineN(a: TopK[T], n: Int): TopK[T]

    Definition Classes
    Monoid → Semigroup

  16. def empty: TopK[T]

    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. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  21. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  22. def isEmpty(a: TopK[T])(implicit ev: Eq[TopK[T]]): Boolean

    Definition Classes
    Monoid

  23. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  24. def isNonZero(v: TopK[T]): Boolean

    Definition Classes
    Monoid

  25. def isZero(a: TopK[T])(implicit ev: Eq[TopK[T]]): Boolean

    Definition Classes
    AdditiveMonoid

  26. def merge(bigger: TopK[T], smaller: TopK[T]): TopK[T]

    Attributes
    protected

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

    Definition Classes
    AnyRef

  28. def nonZeroOption(v: TopK[T]): Option[TopK[T]]

    Definition Classes
    Monoid

  29. final def notify(): Unit

    Definition Classes
    AnyRef

  30. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  31. def plus(left: TopK[T], right: TopK[T]): TopK[T]

    Definition Classes
    TopKMonoid → AdditiveSemigroup

  32. def positiveSumN(a: TopK[T], n: Int): TopK[T]

    Attributes
    protected[this]
    Definition Classes
    AdditiveSemigroup

  33. def repeatedCombineN(a: TopK[T], n: Int): TopK[T]

    Attributes
    protected[this]
    Definition Classes
    Semigroup

  34. def sum(vs: TraversableOnce[TopK[T]]): TopK[T]

    Definition Classes
    Monoid → AdditiveMonoid

  35. def sumN(a: TopK[T], n: Int): TopK[T]

    Definition Classes
    AdditiveMonoid → AdditiveSemigroup

  36. def sumOption(iter: TraversableOnce[TopK[T]]): Option[TopK[T]]

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

    iter

    instances of T to be combined

    returns

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

    Definition Classes
    Semigroup
    Note

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

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

    Definition Classes
    AnyRef

  38. def toString(): String

    Definition Classes
    AnyRef → Any

  39. def trySum(as: TraversableOnce[TopK[T]]): Option[TopK[T]]

    Definition Classes
    AdditiveMonoid → AdditiveSemigroup

  40. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  43. lazy val zero: TopK[T]

    Definition Classes
    TopKMonoid → AdditiveMonoid

Inherited from Monoid[TopK[T]]

Inherited from AdditiveMonoid[TopK[T]]

Inherited from cats.kernel.Monoid[TopK[T]]

Inherited from Semigroup[TopK[T]]

Inherited from AdditiveSemigroup[TopK[T]]

Inherited from cats.kernel.Semigroup[TopK[T]]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped