Package com.rabbitmq.client.impl

Class VariableLinkedBlockingQueue<E>

java.lang.Object
java.util.AbstractCollection<E>
java.util.AbstractQueue<E>
com.rabbitmq.client.impl.VariableLinkedBlockingQueue<E>
Type Parameters:
E - the type of elements held in this collection
All Implemented Interfaces:
Serializable, Iterable<E>, Collection<E>, BlockingQueue<E>, Queue<E>
public class VariableLinkedBlockingQueue<E> extends AbstractQueue<E> implements BlockingQueue<E>, Serializable
A clone of LinkedBlockingQueue with the addition of a setCapacity(int) method, allowing us to change the capacity of the queue while it is in use.

The documentation for LinkedBlockingQueue follows...

An optionally-bounded blocking queue based on linked nodes. This queue orders elements FIFO (first-in-first-out). The head of the queue is that element that has been on the queue the longest time. The tail of the queue is that element that has been on the queue the shortest time. New elements are inserted at the tail of the queue, and the queue retrieval operations obtain elements at the head of the queue. Linked queues typically have higher throughput than array-based queues but less predictable performance in most concurrent applications.

The optional capacity bound constructor argument serves as a way to prevent excessive queue expansion. The capacity, if unspecified, is equal to Integer.MAX_VALUE. Linked nodes are dynamically created upon each insertion unless this would bring the queue above capacity.

This class implements all of the optional methods of the Collection and Iterator interfaces.

This class is a member of the Java Collections Framework.

Since:
1.5
Author:
Doug Lea
See Also:

  • Constructor Details

    • VariableLinkedBlockingQueue

      public VariableLinkedBlockingQueue()
      Creates a LinkedBlockingQueue with a capacity of Integer.MAX_VALUE.

    • VariableLinkedBlockingQueue

      public VariableLinkedBlockingQueue(int capacity)
      Creates a LinkedBlockingQueue with the given (fixed) capacity.
      Parameters:
      capacity - the capacity of this queue.
      Throws:
      IllegalArgumentException - if capacity is not greater than zero.

    • VariableLinkedBlockingQueue

      public VariableLinkedBlockingQueue(Collection<? extends E> c)
      Creates a LinkedBlockingQueue with a capacity of Integer.MAX_VALUE, initially containing the elements of the given collection, added in traversal order of the collection's iterator.
      Parameters:
      c - the collection of elements to initially contain
      Throws:
      NullPointerException - if c or any element within it is null

  • Method Details

    • size

      public int size()
      Returns the number of elements in this queue.
      Specified by:
      size in interface Collection<E>
      Specified by:
      size in class AbstractCollection<E>
      Returns:
      the number of elements in this queue.

    • setCapacity

      public void setCapacity(int capacity)
      Set a new capacity for the queue. Increasing the capacity can cause any waiting put(Object) invocations to succeed if the new capacity is larger than the queue.
      Parameters:
      capacity - the new capacity for the queue

    • remainingCapacity

      public int remainingCapacity()
      Returns the number of elements that this queue can ideally (in the absence of memory or resource constraints) accept without blocking. This is always equal to the initial capacity of this queue less the current size of this queue.

      Note that you cannot always tell if an attempt to add an element will succeed by inspecting remainingCapacity because it may be the case that a waiting consumer is ready to take an element out of an otherwise full queue.

      Specified by:
      remainingCapacity in interface BlockingQueue<E>

    • put

      public void put(E o) throws InterruptedException
      Adds the specified element to the tail of this queue, waiting if necessary for space to become available.
      Specified by:
      put in interface BlockingQueue<E>
      Parameters:
      o - the element to add
      Throws:
      InterruptedException - if interrupted while waiting.
      NullPointerException - if the specified element is null.

    • offer

      public boolean offer(E o, long timeout, TimeUnit unit) throws InterruptedException
      Inserts the specified element at the tail of this queue, waiting if necessary up to the specified wait time for space to become available.
      Specified by:
      offer in interface BlockingQueue<E>
      Parameters:
      o - the element to add
      timeout - how long to wait before giving up, in units of unit
      unit - a TimeUnit determining how to interpret the timeout parameter
      Returns:
      true if successful, or false if the specified waiting time elapses before space is available.
      Throws:
      InterruptedException - if interrupted while waiting.
      NullPointerException - if the specified element is null.

    • offer

      public boolean offer(E o)
      Inserts the specified element at the tail of this queue if possible, returning immediately if this queue is full.
      Specified by:
      offer in interface BlockingQueue<E>
      Specified by:
      offer in interface Queue<E>
      Parameters:
      o - the element to add.
      Returns:
      true if it was possible to add the element to this queue, else false
      Throws:
      NullPointerException - if the specified element is null

    • take

      public E take() throws InterruptedException
      Specified by:
      take in interface BlockingQueue<E>
      Throws:
      InterruptedException

    • poll

      public E poll(long timeout, TimeUnit unit) throws InterruptedException
      Specified by:
      poll in interface BlockingQueue<E>
      Throws:
      InterruptedException

    • poll

      public E poll()
      Specified by:
      poll in interface Queue<E>

    • peek

      public E peek()
      Specified by:
      peek in interface Queue<E>

    • remove

      public boolean remove(Object o)
      Specified by:
      remove in interface BlockingQueue<E>
      Specified by:
      remove in interface Collection<E>
      Overrides:
      remove in class AbstractCollection<E>

    • toArray

      public Object[] toArray()
      Specified by:
      toArray in interface Collection<E>
      Overrides:
      toArray in class AbstractCollection<E>

    • toArray

      public <T> T[] toArray(T[] a)
      Specified by:
      toArray in interface Collection<E>
      Overrides:
      toArray in class AbstractCollection<E>

    • toString

      public String toString()
      Overrides:
      toString in class AbstractCollection<E>

    • clear

      public void clear()
      Specified by:
      clear in interface Collection<E>
      Overrides:
      clear in class AbstractQueue<E>

    • drainTo

      public int drainTo(Collection<? super E> c)
      Specified by:
      drainTo in interface BlockingQueue<E>

    • drainTo

      public int drainTo(Collection<? super E> c, int maxElements)
      Specified by:
      drainTo in interface BlockingQueue<E>

    • iterator

      public Iterator<E> iterator()
      Returns an iterator over the elements in this queue in proper sequence. The returned Iterator is a "weakly consistent" iterator that will never throw ConcurrentModificationException, and guarantees to traverse elements as they existed upon construction of the iterator, and may (but is not guaranteed to) reflect any modifications subsequent to construction.
      Specified by:
      iterator in interface Collection<E>
      Specified by:
      iterator in interface Iterable<E>
      Specified by:
      iterator in class AbstractCollection<E>
      Returns:
      an iterator over the elements in this queue in proper sequence.