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!

Source
PriorityQueueMonoid.scala
Linear Supertypes
Monoid[PriorityQueue[K]], Semigroup[PriorityQueue[K]], Serializable, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PriorityQueueMonoid
  2. Monoid
  3. Semigroup
  4. Serializable
  5. AnyRef
  6. 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. final def asInstanceOf[T0]: T0

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

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

    Permalink
  8. def build(k: K): PriorityQueue[K]

    Permalink
  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. final def eq(arg0: AnyRef): Boolean

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

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  15. final def isInstanceOf[T0]: Boolean

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

    Permalink
    Definition Classes
    PriorityQueueMonoidMonoid
  17. def limit(q: PriorityQueue[K]): Unit

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

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

    Permalink
    Definition Classes
    Monoid
  20. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  22. def plus(left: PriorityQueue[K], right: PriorityQueue[K]): PriorityQueue[K]

    Permalink

    Combines two T instances associatively.

    Combines two T instances associatively.

    returns

    result of combining l and r

    Definition Classes
    PriorityQueueMonoidSemigroup
  23. def sum(vs: TraversableOnce[PriorityQueue[K]]): PriorityQueue[K]

    Permalink
    Definition Classes
    Monoid
  24. 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.

  25. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  26. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  27. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long, arg1: Int): Unit

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. def zero: PriorityQueue[K]

    Permalink

    Returns the identity element of T for plus.

    Returns the identity element of T for plus.

    Definition Classes
    PriorityQueueMonoidMonoid

Inherited from Monoid[PriorityQueue[K]]

Inherited from Semigroup[PriorityQueue[K]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped