[java] Java 1.5 - Queue Data Type

What's wrong with:

Queue myQueue = new LinkedList();

That way, whenever you use myQueue, you only have access to the methods defined in the queue interface.
Also, a linked list is the ideal data structure to use to back a queue interface from an execution speed viewpoint.

Bleb is right - LinkedList implements the Queue interface, and it's one of the most basic and fast implementations of it.

The only thing possibly faster than that would be a Circular Array Queue, which wouldn't be hard to create yourself, but the basic problem would be that you would have to know how large to make it when instantiating it. Of course, you could always "grow" it when it gets too large, but if your going to have to "grow" the thing then a LinkedList is better. The only other possible side problem with a LinkedList implementation is the added storage required by each node to hold the Link Reference. But that isn't really all to big a deal most of the time. (Heck you probably already know all this).

Another solution would be to write a class that extends ArrayList, and Implements the Queue interface. And you could do that as an annonymous class, that just forwards the Queue interface calls to the appropriate ArrayList methods calls.

L-