WindowMonoidFromMonoid

Instance Constructors

new WindowMonoidFromMonoid(windowSize: Int)(implicit m: Monoid[T])

Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

Definition Classes
Any
def additive: algebra.Monoid[Window[T]]

These are from algebra.
These are from algebra.Monoid

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

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

Definition Classes
Monoid
def clone(): AnyRef

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

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

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

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

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

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

Definition Classes
AnyRef
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def fromIterable(ts: Iterable[T]): Window[T]

Definition Classes
WindowMonoid
final def getClass(): Class[_]

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

Definition Classes
Monoid
final def isInstanceOf[T0]: Boolean

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

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

Definition Classes
AdditiveMonoid
def monoid: Monoid[T]

Definition Classes
WindowMonoidFromMonoid → WindowMonoid
final def ne(arg0: AnyRef): Boolean

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

Definition Classes
Monoid
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def plus(a: Window[T], b: Window[T]): Window[T]

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

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

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

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

Definition Classes
AdditiveMonoid → AdditiveSemigroup
def sumOption(ws: TraversableOnce[Window[T]]): Option[Window[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].
returns
None if iter is empty, else an option value containing the summed T

Definition Classes
WindowMonoid → 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 trySum(as: TraversableOnce[Window[T]]): Option[Window[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( ... )
val windowSize: Int
val zero: Window[T]

Definition Classes
WindowMonoid → AdditiveMonoid

final case class WindowMonoidFromMonoid[T](windowSize: Int)(implicit m: Monoid[T]) extends WindowMonoid[T] with Product with Serializable

Instance Constructors

new WindowMonoidFromMonoid(windowSize: Int)(implicit m: Monoid[T])

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

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

final def asInstanceOf[T0]: T0

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

def clone(): AnyRef

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

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

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

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

def empty: Window[T]

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

def fromIterable(ts: Iterable[T]): Window[T]

final def getClass(): Class[_]

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

final def isInstanceOf[T0]: Boolean

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

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

def monoid: Monoid[T]

final def ne(arg0: AnyRef): Boolean

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

final def notify(): Unit

final def notifyAll(): Unit

def plus(a: Window[T], b: Window[T]): Window[T]

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

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

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

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

def sumOption(ws: TraversableOnce[Window[T]]): Option[Window[T]]

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

val windowSize: Int

val zero: Window[T]

Inherited from Product

Inherited from Equals

Inherited from WindowMonoid[T]

Inherited from Monoid[Window[T]]

Inherited from AdditiveMonoid[Window[T]]

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

Inherited from Semigroup[Window[T]]

Inherited from AdditiveSemigroup[Window[T]]

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

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped