I was browsing through the Java docs to look for the Java equivalent for C++'s STL <code>Queue</code>, but all I found was an interface called <code>Queue</code> and a bunch of implementations I can't make heads or tails of. Does Java have an implementation for <code>Queue</code> that's just a FIFO data structure without the added bells and whistles? I only need the <code>enqueue</code>, <code>dequeue</code> and <code>front</code> operations and the data structure should allow duplicates.

<code>Queue</code> will work. Use any implementation you like. <code>LinkedList</code> or <code>ConcurrentLinkedQueue</code> for example. <code>enqueue</code> = <code>offer(..)</code> <code>dequeue</code> = <code>poll()</code> <code>front</code> = <code>peek()</code>

What's the Java equivalent of C++'s STL Queue?

Tags:

java

collections

data-structures

queue

I was browsing through the Java docs to look for the Java equivalent for C++'s STL Queue, but all I found was an interface called Queue and a bunch of implementations I can't make heads or tails of.

Does Java have an implementation for Queue that's just a FIFO data structure without the added bells and whistles? I only need the enqueue, dequeue and front operations and the data structure should allow duplicates.