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
Ordering
- Alphabetic
- By Inheritance
Inherited
- TopKMonoid
- Monoid
- AdditiveMonoid
- Monoid
- Semigroup
- AdditiveSemigroup
- Semigroup
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new TopKMonoid(k: Int)(implicit ord: Ordering[T])
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def additive: algebra.Monoid[TopK[T]]
These are from algebra.Monoid
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def assertNotZero(v: TopK[T]): Unit
- Definition Classes
- Monoid
- def build(ts: Iterable[T]): TopK[T]
- def build(t: T): TopK[T]
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def combine(l: TopK[T], r: TopK[T]): TopK[T]
- Definition Classes
- Semigroup → Semigroup
- def combineAll(t: TraversableOnce[TopK[T]]): TopK[T]
- Definition Classes
- Monoid → Monoid
- def combineAllOption(as: IterableOnce[TopK[T]]): Option[TopK[T]]
- Definition Classes
- Monoid → Semigroup
- def combineN(a: TopK[T], n: Int): TopK[T]
- Definition Classes
- Monoid → Semigroup
- def empty: TopK[T]
- Definition Classes
- Monoid → Monoid
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def isEmpty(a: TopK[T])(implicit ev: Eq[TopK[T]]): Boolean
- Definition Classes
- Monoid
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isNonZero(v: TopK[T]): Boolean
- Definition Classes
- Monoid
- def isZero(a: TopK[T])(implicit ev: Eq[TopK[T]]): Boolean
- Definition Classes
- AdditiveMonoid
- def merge(bigger: TopK[T], smaller: TopK[T]): TopK[T]
- Attributes
- protected
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nonZeroOption(v: TopK[T]): Option[TopK[T]]
- Definition Classes
- Monoid
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def plus(left: TopK[T], right: TopK[T]): TopK[T]
- Definition Classes
- TopKMonoid → AdditiveSemigroup
- def positiveSumN(a: TopK[T], n: Int): TopK[T]
- Attributes
- protected[this]
- Definition Classes
- AdditiveSemigroup
- def repeatedCombineN(a: TopK[T], n: Int): TopK[T]
- Attributes
- protected[this]
- Definition Classes
- Semigroup
- def sum(vs: TraversableOnce[TopK[T]]): TopK[T]
- Definition Classes
- Monoid → AdditiveMonoid
- def sumN(a: TopK[T], n: Int): TopK[T]
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
- def sumOption(iter: TraversableOnce[TopK[T]]): Option[TopK[T]]
Returns an instance of
T
calculated by summing all instances initer
in one pass.Returns an instance of
T
calculated by summing all instances initer
in one pass. ReturnsNone
ifiter
is empty, elseSome[T]
.- iter
instances of
T
to be combined- returns
None
ifiter
is empty, else an option value containing the summedT
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def trySum(as: TraversableOnce[TopK[T]]): Option[TopK[T]]
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- lazy val zero: TopK[T]
- Definition Classes
- TopKMonoid → AdditiveMonoid