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, 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
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. val MINQUEUESIZE: Int

    Attributes
    protected
  7. def additive: algebra.Monoid[PriorityQueue[K]]

    These are from algebra.

    These are from algebra.Monoid

    Definition Classes
    Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup
  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def assertNotZero(v: PriorityQueue[K]): Unit

    Definition Classes
    Monoid
  10. def build(items: Iterable[K]): PriorityQueue[K]

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

  12. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. def combine(l: PriorityQueue[K], r: PriorityQueue[K]): PriorityQueue[K]

    Definition Classes
    Semigroup → Semigroup
  14. def combineAll(t: TraversableOnce[PriorityQueue[K]]): PriorityQueue[K]

    Definition Classes
    Monoid → Monoid
  15. def combineAllOption(as: TraversableOnce[PriorityQueue[K]]): Option[PriorityQueue[K]]

    Definition Classes
    Monoid → Semigroup
  16. def combineN(a: PriorityQueue[K], n: Int): PriorityQueue[K]

    Definition Classes
    Monoid → Semigroup
  17. def empty: PriorityQueue[K]

    Definition Classes
    Monoid → Monoid
  18. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  19. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  20. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  21. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  22. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  23. def isEmpty(a: PriorityQueue[K])(implicit ev: Eq[PriorityQueue[K]]): Boolean

    Definition Classes
    Monoid
  24. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  25. def isNonZero(q: PriorityQueue[K]): Boolean

    Definition Classes
    PriorityQueueMonoidMonoid
  26. def isZero(a: PriorityQueue[K])(implicit ev: Eq[PriorityQueue[K]]): Boolean

    Definition Classes
    AdditiveMonoid
  27. def limit(q: PriorityQueue[K]): Unit

    Attributes
    protected
  28. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  29. def nonZeroOption(v: PriorityQueue[K]): Option[PriorityQueue[K]]

    Definition Classes
    Monoid
  30. final def notify(): Unit

    Definition Classes
    AnyRef
  31. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  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( ... )
  42. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  43. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  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 Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped