Packages

c

akka.dispatch

AbstractNodeQueue

abstract class AbstractNodeQueue[T] extends AtomicReference[Node[T]]

Lock-free MPSC linked queue implementation based on Dmitriy Vyukov's non-intrusive MPSC queue: http://www.1024cores.net/home/lock-free-algorithms/queues/non-intrusive-mpsc-node-based-queue

This queue could be wait-free (i.e. without the spinning loops in peekNode and pollNode) if it were permitted to return null while the queue is not quite empty anymore but the enqueued element is not yet visible. This would break actor scheduling, though.

Source
AbstractNodeQueue.java
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AbstractNodeQueue
  2. AtomicReference
  3. Serializable
  4. AnyRef
  5. 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 AbstractNodeQueue()
    Attributes
    protected[akka.dispatch]

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from AbstractNodeQueue[T] to any2stringadd[AbstractNodeQueue[T]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (AbstractNodeQueue[T], B)
    Implicit
    This member is added by an implicit conversion from AbstractNodeQueue[T] to ArrowAssoc[AbstractNodeQueue[T]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. final def accumulateAndGet(arg0: Node[T], arg1: BinaryOperator[Node[T]]): Node[T]
    Definition Classes
    AtomicReference
  7. final def add(value: T): 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

  8. final def addNode(n: Node[T]): 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

  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  11. final def compareAndSet(arg0: Node[T], arg1: Node[T]): Boolean
    Definition Classes
    AtomicReference
  12. 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

  13. def ensuring(cond: (AbstractNodeQueue[T]) ⇒ Boolean, msg: ⇒ Any): AbstractNodeQueue[T]
    Implicit
    This member is added by an implicit conversion from AbstractNodeQueue[T] to Ensuring[AbstractNodeQueue[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. def ensuring(cond: (AbstractNodeQueue[T]) ⇒ Boolean): AbstractNodeQueue[T]
    Implicit
    This member is added by an implicit conversion from AbstractNodeQueue[T] to Ensuring[AbstractNodeQueue[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  15. def ensuring(cond: Boolean, msg: ⇒ Any): AbstractNodeQueue[T]
    Implicit
    This member is added by an implicit conversion from AbstractNodeQueue[T] to Ensuring[AbstractNodeQueue[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  16. def ensuring(cond: Boolean): AbstractNodeQueue[T]
    Implicit
    This member is added by an implicit conversion from AbstractNodeQueue[T] to Ensuring[AbstractNodeQueue[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  17. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  19. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  20. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from AbstractNodeQueue[T] to StringFormat[AbstractNodeQueue[T]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  21. final def get(): Node[T]
    Definition Classes
    AtomicReference
  22. final def getAndAccumulate(arg0: Node[T], arg1: BinaryOperator[Node[T]]): Node[T]
    Definition Classes
    AtomicReference
  23. final def getAndSet(arg0: Node[T]): Node[T]
    Definition Classes
    AtomicReference
  24. final def getAndUpdate(arg0: UnaryOperator[Node[T]]): Node[T]
    Definition Classes
    AtomicReference
  25. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  26. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  27. 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

  28. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  29. final def lazySet(arg0: Node[T]): Unit
    Definition Classes
    AtomicReference
  30. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  32. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  33. final def peek(): T

    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

  34. final def peekNode(): Node[T]

    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!

    !!! There is a copy of this code in pollNode() !!!

    returns

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

    Attributes
    protected[akka.dispatch]
  35. final def poll(): T

    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

  36. final def pollNode(): Node[T]

    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

  37. final def set(arg0: Node[T]): Unit
    Definition Classes
    AtomicReference
  38. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  39. def toString(): String
    Definition Classes
    AtomicReference → AnyRef → Any
  40. final def updateAndGet(arg0: UnaryOperator[Node[T]]): Node[T]
    Definition Classes
    AtomicReference
  41. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  42. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  43. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  44. final def weakCompareAndSet(arg0: Node[T], arg1: Node[T]): Boolean
    Definition Classes
    AtomicReference
  45. def [B](y: B): (AbstractNodeQueue[T], B)
    Implicit
    This member is added by an implicit conversion from AbstractNodeQueue[T] to ArrowAssoc[AbstractNodeQueue[T]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from AtomicReference[Node[T]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from AbstractNodeQueue[T] to any2stringadd[AbstractNodeQueue[T]]

Inherited by implicit conversion StringFormat from AbstractNodeQueue[T] to StringFormat[AbstractNodeQueue[T]]

Inherited by implicit conversion Ensuring from AbstractNodeQueue[T] to Ensuring[AbstractNodeQueue[T]]

Inherited by implicit conversion ArrowAssoc from AbstractNodeQueue[T] to ArrowAssoc[AbstractNodeQueue[T]]

Ungrouped