Packages

c

akka.dispatch

NodeMessageQueue

class NodeMessageQueue extends AbstractNodeQueue[Envelope] with MessageQueue with UnboundedMessageQueueSemantics

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeMessageQueue
  2. UnboundedMessageQueueSemantics
  3. MessageQueue
  4. AbstractNodeQueue
  5. AtomicReference
  6. Serializable
  7. AnyRef
  8. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodeMessageQueue()

Value Members

  1. final def accumulateAndGet(arg0: Node[Envelope], arg1: BinaryOperator[Node[Envelope]]): Node[Envelope]
    Definition Classes
    AtomicReference
  2. final def add(value: Envelope): Unit

    Add an element to the head of the queue.

    Add an element to the head of the queue.

    This method can be used from any thread.

    value

    the element to be added; must not be null

    Definition Classes
    AbstractNodeQueue
  3. final def addNode(n: Node[Envelope]): Unit

    Add an element to the head of the queue, providing the queue node to be used.

    Add an element to the head of the queue, providing the queue node to be used.

    This method can be used from any thread.

    n

    the node containing the element to be added; both must not be null

    Definition Classes
    AbstractNodeQueue
  4. final def cleanUp(owner: ActorRef, deadLetters: MessageQueue): Unit

    Called when the mailbox this queue belongs to is disposed of.

    Called when the mailbox this queue belongs to is disposed of. Normally it is expected to transfer all remaining messages into the dead letter queue which is passed in. The owner of this MessageQueue is passed in if available (e.g. for creating DeadLetters()), “/deadletters” otherwise.

    Definition Classes
    NodeMessageQueue → MessageQueue
    Annotations
    @tailrec()
  5. final def compareAndSet(arg0: Node[Envelope], arg1: Node[Envelope]): Boolean
    Definition Classes
    AtomicReference
  6. final def count(): Int

    This method returns an upper bound on the queue size at the time it starts executing.

    This method returns an upper bound on the queue size at the time it starts executing. It may spuriously return smaller values (including zero) if the consumer pulls items out concurrently.

    This method can be used from any thread.

    returns

    an upper bound on queue length at some time in the past

    Definition Classes
    AbstractNodeQueue
  7. final def dequeue(): Envelope

    Try to dequeue the next message from this queue, return null failing that.

    Try to dequeue the next message from this queue, return null failing that.

    Definition Classes
    NodeMessageQueue → MessageQueue
  8. final def enqueue(receiver: ActorRef, handle: Envelope): Unit

    Try to enqueue the message to this queue, or throw an exception.

    Try to enqueue the message to this queue, or throw an exception.

    Definition Classes
    NodeMessageQueue → MessageQueue
  9. final def get(): Node[Envelope]
    Definition Classes
    AtomicReference
  10. final def getAndAccumulate(arg0: Node[Envelope], arg1: BinaryOperator[Node[Envelope]]): Node[Envelope]
    Definition Classes
    AtomicReference
  11. final def getAndSet(arg0: Node[Envelope]): Node[Envelope]
    Definition Classes
    AtomicReference
  12. final def getAndUpdate(arg0: UnaryOperator[Node[Envelope]]): Node[Envelope]
    Definition Classes
    AtomicReference
  13. final def hasMessages: Boolean

    Indicates whether this queue is non-empty.

    Indicates whether this queue is non-empty.

    Definition Classes
    NodeMessageQueue → MessageQueue
  14. final def isEmpty(): Boolean

    Query the queue whether it is empty right now.

    Query the queue whether it is empty right now.

    This method can be used from any thread.

    returns

    true if queue was empty at some point in the past

    Definition Classes
    AbstractNodeQueue
  15. final def lazySet(arg0: Node[Envelope]): Unit
    Definition Classes
    AtomicReference
  16. final def numberOfMessages: Int

    Should return the current number of messages held in this queue; may always return 0 if no other value is available efficiently.

    Should return the current number of messages held in this queue; may always return 0 if no other value is available efficiently. Do not use this for testing for presence of messages, use hasMessages instead.

    Definition Classes
    NodeMessageQueue → MessageQueue
  17. final def peek(): Envelope

    Query the queue tail for the next element without dequeuing it.

    Query the queue tail for the next element without dequeuing it.

    Use this method only from the consumer thread!

    returns

    element if there was one, or null if there was none

    Definition Classes
    AbstractNodeQueue
  18. final def poll(): Envelope

    Pull one item from the queue’s tail if there is one.

    Pull one item from the queue’s tail if there is one.

    Use this method only from the consumer thread!

    returns

    element if there was one, or null if there was none

    Definition Classes
    AbstractNodeQueue
  19. final def pollNode(): Node[Envelope]

    Pull one item from the queue, returning it within a queue node.

    Pull one item from the queue, returning it within a queue node.

    Use this method only from the consumer thread!

    returns

    queue node with element inside if there was one, or null if there was none

    Definition Classes
    AbstractNodeQueue
  20. final def set(arg0: Node[Envelope]): Unit
    Definition Classes
    AtomicReference
  21. def toString(): String
    Definition Classes
    AtomicReference → AnyRef → Any
  22. final def updateAndGet(arg0: UnaryOperator[Node[Envelope]]): Node[Envelope]
    Definition Classes
    AtomicReference
  23. final def weakCompareAndSet(arg0: Node[Envelope], arg1: Node[Envelope]): Boolean
    Definition Classes
    AtomicReference