Class

com.twitter.algebird.mutable

PriorityQueueMonoid

Related Doc: package mutable

Permalink

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

Instance Constructors

  1. new PriorityQueueMonoid(max: Int)(implicit ord: Ordering[K])

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. val MINQUEUESIZE: Int

    Permalink
    Attributes
    protected

  5. def additive: algebra.Monoid[PriorityQueue[K]]

    Permalink

    These are from algebra.Monoid

    These are from algebra.Monoid

    Definition Classes
    Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  7. def assertNotZero(v: PriorityQueue[K]): Unit

    Permalink
    Definition Classes
    Monoid

  8. def build(items: Iterable[K]): PriorityQueue[K]

    Permalink

  9. def build(k: K): PriorityQueue[K]

    Permalink

  10. def clone(): AnyRef

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

  11. def combine(l: PriorityQueue[K], r: PriorityQueue[K]): PriorityQueue[K]

    Permalink
    Definition Classes
    Semigroup → Semigroup

  12. def combineAll(t: TraversableOnce[PriorityQueue[K]]): PriorityQueue[K]

    Permalink
    Definition Classes
    Monoid → Monoid

  13. def combineAllOption(as: IterableOnce[PriorityQueue[K]]): Option[PriorityQueue[K]]

    Permalink
    Definition Classes
    Monoid → Semigroup

  14. def combineN(a: PriorityQueue[K], n: Int): PriorityQueue[K]

    Permalink
    Definition Classes
    Monoid → Semigroup

  15. def empty: PriorityQueue[K]

    Permalink
    Definition Classes
    Monoid → Monoid

  16. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  17. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  18. def finalize(): Unit

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

  19. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  20. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  21. def isEmpty(a: PriorityQueue[K])(implicit ev: Eq[PriorityQueue[K]]): Boolean

    Permalink
    Definition Classes
    Monoid

  22. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  23. def isNonZero(q: PriorityQueue[K]): Boolean

    Permalink
    Definition Classes
    PriorityQueueMonoid → Monoid

  24. def isZero(a: PriorityQueue[K])(implicit ev: Eq[PriorityQueue[K]]): Boolean

    Permalink
    Definition Classes
    AdditiveMonoid

  25. def limit(q: PriorityQueue[K]): Unit

    Permalink
    Attributes
    protected

  26. def maximumItems: Int

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  28. def nonZeroOption(v: PriorityQueue[K]): Option[PriorityQueue[K]]

    Permalink
    Definition Classes
    Monoid

  29. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  30. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  31. def ordering: Ordering[K]

    Permalink

  32. def plus(left: PriorityQueue[K], right: PriorityQueue[K]): PriorityQueue[K]

    Permalink
    Definition Classes
    PriorityQueueMonoid → AdditiveSemigroup

  33. def positiveSumN(a: PriorityQueue[K], n: Int): PriorityQueue[K]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    AdditiveSemigroup

  34. def repeatedCombineN(a: PriorityQueue[K], n: Int): PriorityQueue[K]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Semigroup

  35. def sum(vs: TraversableOnce[PriorityQueue[K]]): PriorityQueue[K]

    Permalink
    Definition Classes
    Monoid → AdditiveMonoid

  36. def sumN(a: PriorityQueue[K], n: Int): PriorityQueue[K]

    Permalink
    Definition Classes
    AdditiveMonoid → AdditiveSemigroup

  37. def sumOption(iter: TraversableOnce[PriorityQueue[K]]): Option[PriorityQueue[K]]

    Permalink

    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

    Permalink
    Definition Classes
    AnyRef

  39. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  40. def trySum(as: TraversableOnce[PriorityQueue[K]]): Option[PriorityQueue[K]]

    Permalink
    Definition Classes
    AdditiveMonoid → AdditiveSemigroup

  41. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  44. def zero: PriorityQueue[K]

    Permalink
    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 Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped