MergingPartitioningBeam

Instance Constructors

new MergingPartitioningBeam(partitioner: Partitioner[A], beams: IndexedSeq[Beam[A]])

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

Definition Classes
Any
val beams: IndexedSeq[Beam[A]]
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def close(): Future[Unit]

Signal that no more messages will be sent.
Signal that no more messages will be sent. Many implementations need this to do proper cleanup. This operation may happen asynchronously.
returns
future that resolves when closing is complete

Definition Classes
MergingPartitioningBeam → Beam
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
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
lazy val log: Logger

Definition Classes
Logging
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val partitioner: Partitioner[A]
def sendAll(messages: Seq[A]): Seq[Future[SendResult]]

Request propagation of messages.
Request propagation of messages. The returned futures contains the results of sending these messages, in a Seq in the same order as the original messages. Note that for some implementations, it is possible for a message to be sent and for the ack to be lost (e.g. if the send is occurring over a network).
If any of the the returned Futures resolves to a DefunctBeamException, this means the beam should be discarded (after calling close()).
messages
a batch of messages
returns
futures containing send result of each message

Definition Classes
MergingPartitioningBeam → Beam
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
MergingPartitioningBeam → AnyRef → Any
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( ... )

Deprecated Value Members

final def propagate(messages: Seq[A]): Future[Int]

Request propagation of messages.
Request propagation of messages. The return value indicates the number of messages known to be sent successfully. Note that for some implementations, it is possible for a message to be sent and for the ack to be lost (e.g. if the send is occurring over a network).
If the returned Future resolves to a DefunctBeamException, this means the beam should be discarded (after calling close()).
messages
a batch of messages
returns
the number of messages propagated

Definition Classes
Beam
Annotations
@deprecated
Deprecated
(Since version 0.7.0) use sendBatch
final def sendBatch(messages: Seq[A]): Future[BitSet]

Request propagation of messages.
Request propagation of messages. The returned bitset contains the indexes of messages known to be sent successfully. Note that for some implementations, it is possible for a message to be sent and for the ack to be lost (e.g. if the send is occurring over a network).
If the returned Future resolves to a DefunctBeamException, this means the beam should be discarded (after calling close()).
messages
a batch of messages
returns
a bitset containing indexes of messages that were sent successfully

Definition Classes
Beam
Annotations
@deprecated
Deprecated
(Since version 0.8.0) use sendAll

Related Doc: package beam

class MergingPartitioningBeam[A] extends Beam[A] with Logging

Instance Constructors

new MergingPartitioningBeam(partitioner: Partitioner[A], beams: IndexedSeq[Beam[A]])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

val beams: IndexedSeq[Beam[A]]

def clone(): AnyRef

def close(): Future[Unit]

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

lazy val log: Logger

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val partitioner: Partitioner[A]

def sendAll(messages: Seq[A]): Seq[Future[SendResult]]

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

Deprecated Value Members

final def propagate(messages: Seq[A]): Future[Int]

final def sendBatch(messages: Seq[A]): Future[BitSet]

Inherited from Logging

Inherited from Beam[A]

Inherited from AnyRef

Inherited from Any

Ungrouped