Packages

c

com.twitter.algebird.mutable

PriorityQueueMonoid

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
Monoid[PriorityQueue[K]], AdditiveMonoid[PriorityQueue[K]], cats.kernel.Monoid[PriorityQueue[K]], Semigroup[PriorityQueue[K]], AdditiveSemigroup[PriorityQueue[K]], cats.kernel.Semigroup[PriorityQueue[K]], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PriorityQueueMonoid
  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 PriorityQueueMonoid(max: Int)(implicit ord: Ordering[K])

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. val MINQUEUESIZE: Int
    Attributes
    protected
  5. def additive: algebra.Monoid[PriorityQueue[K]]

    These are from algebra.Monoid

    These are from algebra.Monoid

    Definition Classes
    Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def assertNotZero(v: PriorityQueue[K]): Unit
    Definition Classes
    Monoid
  8. def build(items: Iterable[K]): PriorityQueue[K]
  9. def build(k: K): PriorityQueue[K]
  10. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  11. def combine(l: PriorityQueue[K], r: PriorityQueue[K]): PriorityQueue[K]
    Definition Classes
    Semigroup → Semigroup
  12. def combineAll(t: TraversableOnce[PriorityQueue[K]]): PriorityQueue[K]
    Definition Classes
    Monoid → Monoid
  13. def combineAllOption(as: IterableOnce[PriorityQueue[K]]): Option[PriorityQueue[K]]
    Definition Classes
    Monoid → Semigroup
  14. def combineN(a: PriorityQueue[K], n: Int): PriorityQueue[K]
    Definition Classes
    Monoid → Semigroup
  15. def empty: PriorityQueue[K]
    Definition Classes
    Monoid → Monoid
  16. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  18. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  19. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  20. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  21. def isEmpty(a: PriorityQueue[K])(implicit ev: Eq[PriorityQueue[K]]): Boolean
    Definition Classes
    Monoid
  22. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  23. def isNonZero(q: PriorityQueue[K]): Boolean
    Definition Classes
    PriorityQueueMonoid → Monoid
  24. def isZero(a: PriorityQueue[K])(implicit ev: Eq[PriorityQueue[K]]): Boolean
    Definition Classes
    AdditiveMonoid
  25. def limit(q: PriorityQueue[K]): Unit
    Attributes
    protected
  26. def maximumItems: Int
  27. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  28. def nonZeroOption(v: PriorityQueue[K]): Option[PriorityQueue[K]]
    Definition Classes
    Monoid
  29. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  31. def ordering: Ordering[K]
  32. def plus(left: PriorityQueue[K], right: PriorityQueue[K]): PriorityQueue[K]
    Definition Classes
    PriorityQueueMonoid → AdditiveSemigroup
  33. def positiveSumN(a: PriorityQueue[K], n: Int): PriorityQueue[K]
    Attributes
    protected[this]
    Definition Classes
    AdditiveSemigroup
  34. def repeatedCombineN(a: PriorityQueue[K], n: Int): PriorityQueue[K]
    Attributes
    protected[this]
    Definition Classes
    Semigroup
  35. def sum(vs: TraversableOnce[PriorityQueue[K]]): PriorityQueue[K]
    Definition Classes
    Monoid → AdditiveMonoid
  36. def sumN(a: PriorityQueue[K], n: Int): PriorityQueue[K]
    Definition Classes
    AdditiveMonoid → AdditiveSemigroup
  37. def sumOption(iter: TraversableOnce[PriorityQueue[K]]): Option[PriorityQueue[K]]

    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.

  38. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  39. def toString(): String
    Definition Classes
    AnyRef → Any
  40. def trySum(as: TraversableOnce[PriorityQueue[K]]): Option[PriorityQueue[K]]
    Definition Classes
    AdditiveMonoid → AdditiveSemigroup
  41. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  42. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  43. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  44. def zero: PriorityQueue[K]
    Definition Classes
    PriorityQueueMonoid → AdditiveMonoid

Inherited from Monoid[PriorityQueue[K]]

Inherited from AdditiveMonoid[PriorityQueue[K]]

Inherited from cats.kernel.Monoid[PriorityQueue[K]]

Inherited from Semigroup[PriorityQueue[K]]

Inherited from AdditiveSemigroup[PriorityQueue[K]]

Inherited from cats.kernel.Semigroup[PriorityQueue[K]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped