CommunicationStack

A Stack used for bottom-top communication. Children push their messages (maps) to the parent node to the stack. After the parent node is finished with them, they are popped, merged with the parent's message and the resulting single message is pushed to the stack as the parent's message to grandparent. Every node must push exactly one message; empty map is pushed if nothing is to push.

Linear Supertypes

AnyRef, Any

Known Subclasses

CommunicationStackImpl

Abstract Value Members

abstract def last(n: Int): Map[String, List[Any]]

Retrieves and merges the given number of messages.
Retrieves and merges the given number of messages. back to the stack and returns the resulting CommunicationStack. The values of the resulting map are List[Any]: the values of different maps with same keys are collected to the list.
abstract def push(m: Map[String, Any]): Unit

Push a new message to the stack.
abstract def reduce(n: Int): Unit

Pops given number of messages, merges them, pushes the resulting message to the stack.
abstract def stack: Seq[Map[String, Any]]

Underlying stack.

Concrete 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
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 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
def last: Map[String, List[Any]]
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

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

trait CommunicationStack extends AnyRef

Abstract Value Members

abstract def last(n: Int): Map[String, List[Any]]

abstract def push(m: Map[String, Any]): Unit

abstract def reduce(n: Int): Unit

abstract def stack: Seq[Map[String, Any]]

Concrete 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

final def asInstanceOf[T0]: T0

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 last: Map[String, List[Any]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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