FIFO-based queue implementations?

Question

I need a simple FIFO implemented queue to store an int bundle (I don't mind if this is a generics implementation).

Anything already baked for me in java.util or in the Trove / Guava library?

Answer 1

Yes. Queue

LinkedList is the most trivial concrete implementation.

Answer 2

Here is a sample code to use the java built-in FIFO queue:

 public static void main(String[] args) { Queue<Integer> myQ=new LinkedList<Integer>(); myQ.add(1); myQ.add(6); myQ.add(3); System.out.println(myQ); //1 6 3 int first=myQ.poll();// retrieve and remove the first element System.out.println(first);//1 System.out.println(myQ);//6 3 } 

Answer 3

ArrayDeque is probably the fastest object queue in the JDK; Trove has a TIntQueue interface, but I don’t know where its implementations live.

Answer 4

Queue is an interface that extends Collection in Java. It has all the features needed to support the FIFO architecture.

For a specific implementation, you can use LinkedList . LinkedList implements Deque , which in turn implements Queue . All of this is part of the java.util package.

For more information on the method with an example example, see FIFO-based Queue Implementation in Java .

Answer 5

Yes, these things are built into Java. Just one example here . Have a google search about queues in java, and thats it.