Returns:int

the capacity of this queue or MessagePassingQueue#UNBOUNDED_CAPACITY if not bounded

Removes all items from the queue. Called from the consumer thread subject to the restrictions appropriate to the implementation and according to the Queue#clear() interface.

Remove up to limit elements from the queue and hand to consume. This should be semantically similar to:

M m;
  int i = 0;
  for(;i < limit && (m = relaxedPoll()) != null; i++){
    c.accept(m);
  }
  return i;

There's no strong commitment to the queue being empty at the end of a drain. Called from a consumer thread subject to the restrictions appropriate to the implementation.

Returns:int

the number of polled elements

Exceptions

IllegalArgumentException:

• c is null
• if limit is negative

Remove all available item from the queue and hand to consume. This should be semantically similar to:

M m;
while((m = relaxedPoll()) != null){
c.accept(m);
}

Returns:int

the number of polled elements

Exceptions

IllegalArgumentException:

c is null

Remove elements from the queue and hand to consume forever. Semantically similar to:

 int idleCounter = 0;
 while (exit.keepRunning()) {
     E e = relaxedPoll();
     if(e==null){
         idleCounter = wait.idle(idleCounter);
         continue;
     }
     idleCounter = 0;
     c.accept(e);
 }

Called from a consumer thread subject to the restrictions appropriate to the implementation.

Exceptions

IllegalArgumentException:

c OR wait OR exit are null

Stuff the queue with up to limit elements from the supplier. Semantically similar to:

for(int i=0; i < limit && relaxedOffer(s.get()); i++);

There's no strong commitment to the queue being full at the end of a fill. Called from a producer thread subject to the restrictions appropriate to the implementation

Returns:int

the number of offered elements

Exceptions

IllegalArgumentException:

• s is null
• if limit is negative

Stuff the queue with elements from the supplier. Semantically similar to:

while(relaxedOffer(s.get());

Unbounded queues will fill up the queue with a fixed amount rather than fill up to oblivion

Returns:int

the number of offered elements

Exceptions

IllegalArgumentException:

s is null

Stuff the queue with elements from the supplier forever. Semantically similar to:

 int idleCounter = 0;
 while (exit.keepRunning()) {
     E e = s.get();
     while (!relaxedOffer(e)) {
         idleCounter = wait.idle(idleCounter);
         continue;
     }
     idleCounter = 0;
 }

Called from a producer thread subject to the restrictions appropriate to the implementation. The main difference being that implementors MUST assure room in the queue is available BEFORE calling Supplier#get

Exceptions

IllegalArgumentException:

s OR wait OR exit are null

This method's accuracy is subject to concurrent modifications happening as the observation is carried out.

Returns:boolean

true if empty, false otherwise

Called from a producer thread subject to the restrictions appropriate to the implementation and according to the Queue#offer(Object) interface.

Parameters

e:T

not null, will throw NPE if it is

Returns:boolean

true if element was inserted into the queue, false iff full

Called from the consumer thread subject to the restrictions appropriate to the implementation and according to the Queue#peek() interface.

Returns:T

a message from the queue if one is available, null iff empty

Called from the consumer thread subject to the restrictions appropriate to the implementation and according to the Queue#poll() interface.

Returns:T

a message from the queue if one is available, null iff empty

Called from a producer thread subject to the restrictions appropriate to the implementation. As opposed to Queue#offer(Object) this method may return false without the queue being full.

Parameters

e:T

not null, will throw NPE if it is

Returns:boolean

true if element was inserted into the queue, false if unable to offer

Called from the consumer thread subject to the restrictions appropriate to the implementation. As opposed to Queue#peek() this method may return null without the queue being empty.

Returns:T

a message from the queue if one is available, null if unable to peek

Called from the consumer thread subject to the restrictions appropriate to the implementation. As opposed to Queue#poll() this method may return null without the queue being empty.

Returns:T

a message from the queue if one is available, null if unable to poll

This method's accuracy is subject to concurrent modifications happening as the size is estimated and as such is a best effort rather than absolute value. For some implementations this method may be O(n) rather than O(1).

Returns:int

number of messages in the queue, between 0 and Integer#MAX_VALUE but less or equals to capacity (if bounded).