SimpleWindowedService

abstract def batcher: Batcher

abstract def ordering: Ordering[K]

abstract def read(b: BatchID)(implicit f: FlowDef, m: Mode): TypedPipe[(Timestamp, (K, Option[V]))]

abstract def reducers: Option[Int]

abstract def streamIsAvailable(b: BatchID, m: Mode): Boolean

abstract def windowSize: Milliseconds

A request must come in LESS than this window since the last key written to the service

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def batchedLookup[W](covers: Interval[Timestamp], getKeys: FlowToPipe[(K, W)], last: (BatchID, FlowProducer[TypedPipe[(K, V)]]), streams: Iterable[(BatchID, FlowToPipe[(K, Option[V])])]): FlowToPipe[(K, (W, Option[V]))]

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lookup[W](incoming: TypedPipe[(Timestamp, (K, W))], servStream: TypedPipe[(Timestamp, (K, Option[V]))]): TypedPipe[(Timestamp, (K, (W, Option[V])))]

This executes the join algortihm on the streams.

final def lookup[W](getKeys: PipeFactory[(K, W)]): PipeFactory[(K, (W, Option[V]))]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def readLast(exclusiveUB: BatchID, mode: Mode): Try[(BatchID, FlowProducer[TypedPipe[(K, V)]])]

The batched window never reads an aggregated last.

final def readStream(batchID: BatchID, mode: Mode): Option[FlowToPipe[(K, Option[V])]]

Reads the key log for this batch.

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit