Class/Object

com.twitter.algebird

TopKMonoid

Related Docs: object TopKMonoid | package algebird

Permalink

class TopKMonoid[T] extends Monoid[TopK[T]]

A top-k monoid that is much faster than SortedListTake equivalent to: (left ++ right).sorted.take(k) but doesn't do a total sort If you can handle the mutability, mutable.PriorityQueueMonoid is even faster.

NOTE!!!! This assumes the inputs are already sorted! resorting each time kills speed

Linear Supertypes
Monoid[TopK[T]], Semigroup[TopK[T]], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. TopKMonoid
  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 TopKMonoid(k: Int)(implicit ord: Ordering[T])

    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. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def assertNotZero(v: TopK[T]): Unit

    Permalink
    Definition Classes
    Monoid

  6. def build(ts: Iterable[T]): TopK[T]

    Permalink

  7. def build(t: T): TopK[T]

    Permalink

  8. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  15. def isNonZero(v: TopK[T]): Boolean

    Permalink
    Definition Classes
    Monoid

  16. def merge(bigger: TopK[T], smaller: TopK[T]): TopK[T]

    Permalink
    Attributes
    protected

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

    Permalink
    Definition Classes
    AnyRef

  18. def nonZeroOption(v: TopK[T]): Option[TopK[T]]

    Permalink
    Definition Classes
    Monoid

  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  21. def plus(left: TopK[T], right: TopK[T]): TopK[T]

    Permalink
    Definition Classes
    TopKMonoid → Semigroup

  22. def sum(vs: TraversableOnce[TopK[T]]): TopK[T]

    Permalink
    Definition Classes
    Monoid

  23. def sumOption(iter: TraversableOnce[TopK[T]]): Option[TopK[T]]

    Permalink

    override this if there is a faster way to do this sum than reduceLeftOption on plus

    override this if there is a faster way to do this sum than reduceLeftOption on plus

    Definition Classes
    Semigroup

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

    Permalink
    Definition Classes
    AnyRef

  25. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  26. final def wait(): Unit

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

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

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

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

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

  29. lazy val zero: TopK[T]

    Permalink
    Definition Classes
    TopKMonoid → Monoid

Inherited from Monoid[TopK[T]]

Inherited from Semigroup[TopK[T]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped