Class IntArrayFIFOQueue

  • All Implemented Interfaces:
    IntPriorityQueue, PriorityQueue<Integer>, Serializable

    public class IntArrayFIFOQueue
    extends Object
    implements IntPriorityQueue, Serializable
    A type-specific array-based FIFO queue, supporting also deque operations.

    Instances of this class represent a FIFO queue using a backing array in a circular way. The array is enlarged and shrunk as needed. You can use the trim() method to reduce its memory usage, if necessary.

    This class provides additional methods that implement a deque (double-ended queue).

    See Also:
    Serialized Form
    • Field Detail

      • INITIAL_CAPACITY

        public static final int INITIAL_CAPACITY
        The standard initial capacity of a queue.
        See Also:
        Constant Field Values
    • Constructor Detail

      • IntArrayFIFOQueue

        public IntArrayFIFOQueue​(int capacity)
        Creates a new empty queue with given capacity.
        Parameters:
        capacity - the initial capacity of this queue.
      • IntArrayFIFOQueue

        public IntArrayFIFOQueue()
        Creates a new empty queue with standard initial capacity.