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]], Semigroup[PriorityQueue[K]], Serializable, AnyRef, Any
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
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. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

    Definition Classes
    Monoid

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

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

  11. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  13. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  14. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  16. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  17. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    PriorityQueueMonoid → Monoid

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

    Attributes
    protected

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Monoid

  22. final def notify(): Unit

    Definition Classes
    AnyRef

  23. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Combines two T instances associatively.

    Combines two T instances associatively.

    returns

    result of combining l and r

    Definition Classes
    PriorityQueueMonoid → Semigroup

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

    Definition Classes
    Monoid

  26. 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.

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

    Definition Classes
    AnyRef

  28. def toString(): String

    Definition Classes
    AnyRef → Any

  29. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  32. def zero: PriorityQueue[K]

    Returns the identity element of T for plus.

    Returns the identity element of T for plus.

    Definition Classes
    PriorityQueueMonoid → Monoid

Inherited from Monoid[PriorityQueue[K]]

Inherited from Semigroup[PriorityQueue[K]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped