class PriorityQueueMonoid[K] extends Monoid[PriorityQueue[K]]
for sort-with take and better performance over large values The priority queues should be MAX queues, i.e. the ones we want least should be in the .peek position This is MUCH Faster for Top-K algorithms Note this is MUTABLE. When you put something in plus, it is changed!
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- PriorityQueueMonoid
- Monoid
- AdditiveMonoid
- Monoid
- Semigroup
- AdditiveSemigroup
- Semigroup
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new PriorityQueueMonoid(max: Int)(implicit ord: Ordering[K])
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
- val MINQUEUESIZE: Int
- Attributes
- protected
- def additive: algebra.Monoid[PriorityQueue[K]]
These are from algebra.Monoid
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def assertNotZero(v: PriorityQueue[K]): Unit
- Definition Classes
- Monoid
- def build(items: Iterable[K]): PriorityQueue[K]
- def build(k: K): PriorityQueue[K]
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def combine(l: PriorityQueue[K], r: PriorityQueue[K]): PriorityQueue[K]
- Definition Classes
- Semigroup → Semigroup
- def combineAll(t: TraversableOnce[PriorityQueue[K]]): PriorityQueue[K]
- Definition Classes
- Monoid → Monoid
- def combineAllOption(as: IterableOnce[PriorityQueue[K]]): Option[PriorityQueue[K]]
- Definition Classes
- Monoid → Semigroup
- def combineN(a: PriorityQueue[K], n: Int): PriorityQueue[K]
- Definition Classes
- Monoid → Semigroup
- def empty: PriorityQueue[K]
- 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: PriorityQueue[K])(implicit ev: Eq[PriorityQueue[K]]): Boolean
- Definition Classes
- Monoid
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isNonZero(q: PriorityQueue[K]): Boolean
- Definition Classes
- PriorityQueueMonoid → Monoid
- def isZero(a: PriorityQueue[K])(implicit ev: Eq[PriorityQueue[K]]): Boolean
- Definition Classes
- AdditiveMonoid
- def limit(q: PriorityQueue[K]): Unit
- Attributes
- protected
- def maximumItems: Int
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nonZeroOption(v: PriorityQueue[K]): Option[PriorityQueue[K]]
- Definition Classes
- Monoid
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def ordering: Ordering[K]
- def plus(left: PriorityQueue[K], right: PriorityQueue[K]): PriorityQueue[K]
- Definition Classes
- PriorityQueueMonoid → AdditiveSemigroup
- def positiveSumN(a: PriorityQueue[K], n: Int): PriorityQueue[K]
- Attributes
- protected[this]
- Definition Classes
- AdditiveSemigroup
- def repeatedCombineN(a: PriorityQueue[K], n: Int): PriorityQueue[K]
- Attributes
- protected[this]
- Definition Classes
- Semigroup
- def sum(vs: TraversableOnce[PriorityQueue[K]]): PriorityQueue[K]
- Definition Classes
- Monoid → AdditiveMonoid
- def sumN(a: PriorityQueue[K], n: Int): PriorityQueue[K]
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
- def sumOption(iter: TraversableOnce[PriorityQueue[K]]): Option[PriorityQueue[K]]
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[PriorityQueue[K]]): Option[PriorityQueue[K]]
- 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()
- def zero: PriorityQueue[K]
- Definition Classes
- PriorityQueueMonoid → AdditiveMonoid