TopKMonoid

Instance Constructors

new TopKMonoid(k: Int)(implicit ord: Ordering[T])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

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

Definition Classes
AnyRef → Any
def additive: algebra.Monoid[TopK[T]]

These are from algebra.Monoid
These are from algebra.Monoid

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

Definition Classes
Any
def assertNotZero(v: TopK[T]): Unit

Definition Classes
Monoid
def build(ts: Iterable[T]): TopK[T]
def build(t: T): TopK[T]
def clone(): AnyRef

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

Definition Classes
Semigroup → Semigroup
def combineAll(t: TraversableOnce[TopK[T]]): TopK[T]

Definition Classes
Monoid → Monoid
def combineAllOption(as: TraversableOnce[TopK[T]]): Option[TopK[T]]

Definition Classes
Monoid → Semigroup
def combineN(a: TopK[T], n: Int): TopK[T]

Definition Classes
Monoid → Semigroup
def empty: TopK[T]

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

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

Definition Classes
AnyRef → Any
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def isEmpty(a: TopK[T])(implicit ev: Eq[TopK[T]]): Boolean

Definition Classes
Monoid
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isNonZero(v: TopK[T]): Boolean

Definition Classes
Monoid
def isZero(a: TopK[T])(implicit ev: Eq[TopK[T]]): Boolean

Definition Classes
AdditiveMonoid
def merge(bigger: TopK[T], smaller: TopK[T]): TopK[T]

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

Definition Classes
AnyRef
def nonZeroOption(v: TopK[T]): Option[TopK[T]]

Definition Classes
Monoid
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def plus(left: TopK[T], right: TopK[T]): TopK[T]

Definition Classes
TopKMonoid → AdditiveSemigroup
def positiveSumN(a: TopK[T], n: Int): TopK[T]

Attributes
protected[this]
Definition Classes
AdditiveSemigroup
def repeatedCombineN(a: TopK[T], n: Int): TopK[T]

Attributes
protected[this]
Definition Classes
Semigroup
def sum(vs: TraversableOnce[TopK[T]]): TopK[T]

Definition Classes
Monoid → AdditiveMonoid
def sumN(a: TopK[T], n: Int): TopK[T]

Definition Classes
AdditiveMonoid → AdditiveSemigroup
def sumOption(iter: TraversableOnce[TopK[T]]): Option[TopK[T]]

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.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def trySum(as: TraversableOnce[TopK[T]]): Option[TopK[T]]

Definition Classes
AdditiveMonoid → AdditiveSemigroup
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )
lazy val zero: TopK[T]

Definition Classes
TopKMonoid → AdditiveMonoid

Related Docs: object TopKMonoid | package algebird

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

Instance Constructors

new TopKMonoid(k: Int)(implicit ord: Ordering[T])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def additive: algebra.Monoid[TopK[T]]

final def asInstanceOf[T0]: T0

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

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

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

def clone(): AnyRef

def combine(l: TopK[T], r: TopK[T]): TopK[T]

def combineAll(t: TraversableOnce[TopK[T]]): TopK[T]

def combineAllOption(as: TraversableOnce[TopK[T]]): Option[TopK[T]]

def combineN(a: TopK[T], n: Int): TopK[T]

def empty: TopK[T]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def isEmpty(a: TopK[T])(implicit ev: Eq[TopK[T]]): Boolean

final def isInstanceOf[T0]: Boolean

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

def isZero(a: TopK[T])(implicit ev: Eq[TopK[T]]): Boolean

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

final def ne(arg0: AnyRef): Boolean

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

final def notify(): Unit

final def notifyAll(): Unit

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

def positiveSumN(a: TopK[T], n: Int): TopK[T]

def repeatedCombineN(a: TopK[T], n: Int): TopK[T]

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

def sumN(a: TopK[T], n: Int): TopK[T]

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

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

def toString(): String

def trySum(as: TraversableOnce[TopK[T]]): Option[TopK[T]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

lazy val zero: TopK[T]

Inherited from Monoid[TopK[T]]

Inherited from AdditiveMonoid[TopK[T]]

Inherited from cats.kernel.Monoid[TopK[T]]

Inherited from Semigroup[TopK[T]]

Inherited from AdditiveSemigroup[TopK[T]]

Inherited from cats.kernel.Semigroup[TopK[T]]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped