Packages

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, 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. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

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

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

    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: TopK[T]): Unit
    Definition Classes
    Monoid
  7. def build(ts: Iterable[T]): TopK[T]
  8. def build(t: T): TopK[T]
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  10. def combine(l: TopK[T], r: TopK[T]): TopK[T]
    Definition Classes
    Semigroup → Semigroup
  11. def combineAll(t: TraversableOnce[TopK[T]]): TopK[T]
    Definition Classes
    Monoid → Monoid
  12. def combineAllOption(as: IterableOnce[TopK[T]]): Option[TopK[T]]
    Definition Classes
    Monoid → Semigroup
  13. def combineN(a: TopK[T], n: Int): TopK[T]
    Definition Classes
    Monoid → Semigroup
  14. def empty: TopK[T]
    Definition Classes
    Monoid → Monoid
  15. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  17. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  18. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  19. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  20. def isEmpty(a: TopK[T])(implicit ev: Eq[TopK[T]]): Boolean
    Definition Classes
    Monoid
  21. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  22. def isNonZero(v: TopK[T]): Boolean
    Definition Classes
    Monoid
  23. def isZero(a: TopK[T])(implicit ev: Eq[TopK[T]]): Boolean
    Definition Classes
    AdditiveMonoid
  24. def merge(bigger: TopK[T], smaller: TopK[T]): TopK[T]
    Attributes
    protected
  25. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. def nonZeroOption(v: TopK[T]): Option[TopK[T]]
    Definition Classes
    Monoid
  27. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  28. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  29. def plus(left: TopK[T], right: TopK[T]): TopK[T]
    Definition Classes
    TopKMonoid → AdditiveSemigroup
  30. def positiveSumN(a: TopK[T], n: Int): TopK[T]
    Attributes
    protected[this]
    Definition Classes
    AdditiveSemigroup
  31. def repeatedCombineN(a: TopK[T], n: Int): TopK[T]
    Attributes
    protected[this]
    Definition Classes
    Semigroup
  32. def sum(vs: TraversableOnce[TopK[T]]): TopK[T]
    Definition Classes
    Monoid → AdditiveMonoid
  33. def sumN(a: TopK[T], n: Int): TopK[T]
    Definition Classes
    AdditiveMonoid → AdditiveSemigroup
  34. 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.

  35. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  36. def toString(): String
    Definition Classes
    AnyRef → Any
  37. def trySum(as: TraversableOnce[TopK[T]]): Option[TopK[T]]
    Definition Classes
    AdditiveMonoid → AdditiveSemigroup
  38. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  39. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  40. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  41. 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 AnyRef

Inherited from Any

Ungrouped