WindowMonoid

abstract def monoid: Monoid[T]

abstract def plus(x: Window[T], y: Window[T]): Window[T]

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]]

These are from algebra.

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 equals(arg0: Any): Boolean

def finalize(): Unit

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

final def getClass(): Class[_]

def hashCode(): Int

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

final def ne(arg0: AnyRef): Boolean

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

final def notify(): Unit

final def notifyAll(): Unit

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]]

Returns an instance of T calculated by summing all instances in iter in one pass.

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

def toString(): String

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 zero: Window[T]