How implementation of java.util.queue uses LIFO?

java collections queue fifo
celsowm picture celsowm · Jul 26, 2011 · Viewed 19.1k times · Source

In Java doc:

[...] Among the exceptions are priority queues, which order elements according to a supplied comparator, or the elements' natural ordering, and LIFO queues (or stacks) which order the elements LIFO (last-in-first-out)

How implementation of java.util.queue uses LIFO instead of FIFO?

Answer

ZhekaKozlov picture ZhekaKozlov · Jul 30, 2013

You can use any Deque as a LIFO queue using Collections.asLifoQueue method:

Queue<Integer> arrayLifoQueue = Collections.asLifoQueue(new ArrayDeque<Integer>());
Queue<Integer> linkedListLifoQueue = Collections.asLifoQueue(new LinkedList<Integer>());

Related questions

FIFO Map with limited elements

I need a HashMap or simpy a Map with a fixed number of elements (n) working like a FIFO queue. So until the element number is <= n new elements are simply put in the map. For element number > …

Read More
FIFO based Queue implementations?

I need a simple FIFO implemented queue for storing a bunch of ints (I don't mind much if it is generics implementation). Anything already baked for me in java.util or Trove/Guava library?

Read More
Size-limited queue that holds last N elements in Java

A very simple & quick question on Java libraries: is there a ready-made class that implements a Queue with a fixed maximum size - i.e. it always allows addition of elements, but it will silently remove head elements to …

Read More