AssertJ Core 3.26.0 · org.assertj.core.presentation.BoundedQueue

Modifier and Type	Field and Description
private final int	capacity The maximum number of elements that can be present.
private final Queue<T>	data Queue that never holds more than `capacity` elements.

Access	Constructor and Description
pack-priv	BoundedQueue(int the maximum number of elements the queue can hold capacity) Creates a new `BoundedQueue`.

Method Summary

Modifier and Type	Method and Description
public Iterator<T>	iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Collection.iterator. Returns an iterator over the elements in this collection.
public boolean	offer(T the element to add element) Implements java.util.Queue.offer. Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions.
public T	peek() Implements java.util.Queue.peek. Retrieves, but does not remove, the head of this queue, or returns `null` if this queue is empty.
public T	poll() Implements java.util.Queue.poll. Retrieves and removes the head of this queue, or returns `null` if this queue is empty.
public int	size() Implements abstract java.util.AbstractCollection.size. Implements java.util.Collection.size. Returns the number of elements in this collection.

Inherited from java.util.AbstractQueue:: add addAll clear element remove

capacity	back to summary
private final int capacity The maximum number of elements that can be present.

data	back to summary
private final Queue<T> data Queue that never holds more than `capacity` elements.

BoundedQueue	back to summary
pack-priv BoundedQueue(int capacity) Creates a new `BoundedQueue`. Parameters capacity:int the maximum number of elements the queue can hold Exceptions IllegalArgumentException: if the capacity is negative

Method Detail

iterator back to summary

iterator	back to summary
public Iterator<T> iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Collection.iterator. Doc from java.util.Collection.iterator. Returns an iterator over the elements in this collection. There are no guarantees concerning the order in which the elements are returned (unless this collection is an instance of some class that provides a guarantee). Returns:Iterator<T> an `Iterator` over the elements in this collection Annotations @Override

public Iterator<T> iterator()

Implements abstract java.util.AbstractCollection.iterator.

Implements java.util.Collection.iterator.

Doc from java.util.Collection.iterator.

Returns an iterator over the elements in this collection. There are no guarantees concerning the order in which the elements are returned (unless this collection is an instance of some class that provides a guarantee).

Returns:Iterator<T>

an Iterator over the elements in this collection

Annotations

@Override

offer back to summary

offer	back to summary
public boolean offer(T element) Implements java.util.Queue.offer. Doc from java.util.Queue.offer. Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions. When using a capacity-restricted queue, this method is generally preferable to `add`, which can fail to insert an element only by throwing an exception. Parameters element:T the element to add Returns:boolean `true` if the element was added to this queue, else `false` Annotations @Override

public boolean offer(T element)

Implements java.util.Queue.offer.

Doc from java.util.Queue.offer.

Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions. When using a capacity-restricted queue, this method is generally preferable to add, which can fail to insert an element only by throwing an exception.

Parameters

element:T: the element to add

Returns:boolean

true if the element was added to this queue, else false

Annotations

@Override

peek back to summary

peek	back to summary
public T peek() Implements java.util.Queue.peek. Doc from java.util.Queue.peek. Retrieves, but does not remove, the head of this queue, or returns `null` if this queue is empty. Returns:T the head of this queue, or `null` if this queue is empty Annotations @Override

public T peek()

Implements java.util.Queue.peek.

Doc from java.util.Queue.peek.

Retrieves, but does not remove, the head of this queue, or returns null if this queue is empty.

Returns:T

the head of this queue, or null if this queue is empty

Annotations

@Override

poll back to summary

poll	back to summary
public T poll() Implements java.util.Queue.poll. Doc from java.util.Queue.poll. Retrieves and removes the head of this queue, or returns `null` if this queue is empty. Returns:T the head of this queue, or `null` if this queue is empty Annotations @Override

public T poll()

Implements java.util.Queue.poll.

Doc from java.util.Queue.poll.

Retrieves and removes the head of this queue, or returns null if this queue is empty.

Returns:T

the head of this queue, or null if this queue is empty

Annotations

@Override

size back to summary

size	back to summary
public int size() Implements abstract java.util.AbstractCollection.size. Implements java.util.Collection.size. Doc from java.util.Collection.size. Returns the number of elements in this collection. If this collection contains more than `Integer.MAX_VALUE` elements, returns `Integer.MAX_VALUE`. Returns:int the number of elements in this collection Annotations @Override

public int size()

Implements abstract java.util.AbstractCollection.size.

Implements java.util.Collection.size.

Doc from java.util.Collection.size.

Returns the number of elements in this collection. If this collection contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Returns:int

the number of elements in this collection

Annotations

@Override

pack-priv final Class BoundedQueue<T>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail