QueueChannel

Channel endpoints for local use, based on Java LinkedTransferQueues.

Queue-based channels are (almost) a drop-in replacement for LocalChannels. They are optimized for bypassing Out.promise and In.future whenever possible, e.g. when a program mostly calls Out.send and In.receive; as a consequence, if QueueOut.promise or QueueIn.future are used, the performance will be impacted.

NOTE: due to limitations of Java LinkedTransferQueues, invoking QueueIn.receive on a QueueIn[Null] instance with a finite wait time will cause a spurious timeout error. If you really need channel endpoints that carry Null values, you should use LocalChannels.

Linear Supertypes

AnyRef, Any

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
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def factory[T]()(implicit ec: ExecutionContext): (QueueIn[T], QueueOut[T])

Create a pair of queue-based I/O channel endpoints.
Create a pair of queue-based I/O channel endpoints.
ec
Execution context for internal Promise/Future handling
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
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def parallel[T, R1, R2](p1: (QueueIn[T]) ⇒ R1, p2: (QueueOut[T]) ⇒ R2)(implicit ec: ExecutionContext): (Future[R1], Future[R2])

Spawn two functions as threads communicating via a pair of queue-based channel endpoints.
Spawn two functions as threads communicating via a pair of queue-based channel endpoints.
This method invokes factory to create a pair of channel endpoints (in,out), and then spawns p1(in) and p2(out).
p1
Function using the input channel endpoint
p2
Function using the output channel endpoint
ec
Execution context where the p1 and p2 will run
returns
A pair of Futures (f1, f2), completed respectively when p1(in) and p2(out) terminate.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
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( ... )

Related Doc: package lchannels

object QueueChannel

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def factory[T]()(implicit ec: ExecutionContext): (QueueIn[T], QueueOut[T])

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def parallel[T, R1, R2](p1: (QueueIn[T]) ⇒ R1, p2: (QueueOut[T]) ⇒ R2)(implicit ec: ExecutionContext): (Future[R1], Future[R2])

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

Inherited from AnyRef

Inherited from Any

Ungrouped