zio/zio.internal/RingBufferPow2

RingBufferPow2

final class RingBufferPow2[A](val requestedCapacity: Int) extends RingBuffer[A]
Companion:
object
class RingBuffer[A]
class Object
trait Matchable
class Any

Value members

Inherited methods

final override def dequeuedCount(): Long
Returns:

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

Note:

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

Definition Classes
RingBuffer -> MutableConcurrentQueue
Inherited from:
RingBuffer
final override def enqueuedCount(): Long
Returns:

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

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.

Definition Classes
RingBuffer -> MutableConcurrentQueue
Inherited from:
RingBuffer
final override def isEmpty(): Boolean
Definition Classes
RingBuffer -> MutableConcurrentQueue
Inherited from:
RingBuffer
final override def isFull(): Boolean
Definition Classes
RingBuffer -> MutableConcurrentQueue
Inherited from:
RingBuffer
final override def offer(a: A): Boolean

A non-blocking enqueue.

A non-blocking enqueue.

Returns:

whether the enqueue was successful or not.

Definition Classes
RingBuffer -> MutableConcurrentQueue
Inherited from:
RingBuffer
def offerAll(as: Iterable[A]): Chunk[A]

A non-blocking enqueue of multiple elements.

A non-blocking enqueue of multiple elements.

Inherited from:
MutableConcurrentQueue (hidden)
final override def poll(default: A): A

A non-blocking dequeue.

A non-blocking dequeue.

Returns:

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

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.

Definition Classes
RingBuffer -> MutableConcurrentQueue
Inherited from:
RingBuffer
def pollUpTo(n: Int): Chunk[A]

A non-blocking dequeue of multiple elements.

A non-blocking dequeue of multiple elements.

Inherited from:
MutableConcurrentQueue (hidden)
final override def size(): Int
Returns:

the '''current''' number of elements inside the queue.

Note:

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

Definition Classes
RingBuffer -> MutableConcurrentQueue
Inherited from:
RingBuffer

Concrete fields

Inherited fields

final override val capacity: Int

The '''maximum''' number of elements that a queue can hold.

The '''maximum''' number of elements that a queue can hold.

Note:

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

Inherited from:
RingBuffer