Packages

final class RingBufferArb[A] extends RingBuffer[A]

Linear Supertypes
RingBuffer[A], Serializable, MutableQueueFieldsPadding[A], TailPadding[A], PreTailPadding[A], HeadPadding[A], ClassFieldsPadding[A], Serializable, MutableConcurrentQueue[A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RingBufferArb
  2. RingBuffer
  3. Serializable
  4. MutableQueueFieldsPadding
  5. TailPadding
  6. PreTailPadding
  7. HeadPadding
  8. ClassFieldsPadding
  9. Serializable
  10. MutableConcurrentQueue
  11. AnyRef
  12. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. final val capacity: Int

    The maximum number of elements that a queue can hold.

    The maximum number of elements that a queue can hold.

    Definition Classes
    RingBufferMutableConcurrentQueue
    Note

    that unbounded queues can still implement this interface with capacity = MAX_INT.

  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  7. final def dequeuedCount(): Long

    returns

    the number of elements that have ever been taken from the queue.

    Definition Classes
    RingBufferMutableConcurrentQueue
    Note

    if you know how much time the queue is alive, you can calculate the rate at which elements are being dequeued.

  8. final def enqueuedCount(): Long

    returns

    the number of elements that have ever been added to the queue.

    Definition Classes
    RingBufferMutableConcurrentQueue
    Note

    that scala.Long is used here, since scala.Int will be overflowed really quickly for busy queues.

    ,

    if you know how much time the queue is alive, you can calculate the rate at which elements are being enqueued.

  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. final def isEmpty(): Boolean
    Definition Classes
    RingBufferMutableConcurrentQueue
  15. final def isFull(): Boolean
    Definition Classes
    RingBufferMutableConcurrentQueue
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  20. final def offer(a: A): Boolean

    A non-blocking enqueue.

    A non-blocking enqueue.

    returns

    whether the enqueue was successful or not.

    Definition Classes
    RingBufferMutableConcurrentQueue
  21. final def poll(default: A): A

    A non-blocking dequeue.

    A non-blocking dequeue.

    returns

    either an element from the queue, or the default param.

    Definition Classes
    RingBufferMutableConcurrentQueue
    Note

    that if there's no meaningful default for your type, you can always use poll(null). Not the best, but reasonable price to pay for lower heap churn from not using scala.Option here.

  22. def posToIdx(pos: Long, capacity: Int): Int
    Attributes
    protected
    Definition Classes
    RingBufferArbRingBuffer
  23. final def size(): Int

    returns

    the current number of elements inside the queue.

    Definition Classes
    RingBufferMutableConcurrentQueue
    Note

    that this method can be non-atomic and return the approximate number in a concurrent setting.

  24. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  25. def toString(): String
    Definition Classes
    AnyRef → Any
  26. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from RingBuffer[A]

Inherited from Serializable

Inherited from MutableQueueFieldsPadding[A]

Inherited from TailPadding[A]

Inherited from PreTailPadding[A]

Inherited from HeadPadding[A]

Inherited from ClassFieldsPadding[A]

Inherited from Serializable

Inherited from MutableConcurrentQueue[A]

Inherited from AnyRef

Inherited from Any

Ungrouped