Implementing a basic FIFO queue in Java

Question

I need to implement a basic FIFO queue of objects. Whats the best built-in class for do that?

Can you explain why you need implement a basic FIFO unless this is homework? Why not use on of the many builtin implementations? — Peter Lawrey
– Peter Lawrey, Commented Feb 8, 2012 at 19:23
Because i just need add items at the tail and consume it from the head. Jus wondered if there is a basic build in implementation and java.util.Queue works nice — Addev
– Addev, Commented Feb 9, 2012 at 15:02
Queue is the interface, another useful one is Deque, LinkedList is the simplest implementation. You can also add to the head and consume from the tail if you wish. ;) — Peter Lawrey
– Peter Lawrey, Commented Feb 9, 2012 at 15:28

Spencer Kormos · Accepted Answer · 2012-02-08 18:55:31Z

8

LinkedList is as good as any for just basic FIFO operations, but there are others there that implement the Queue interface in case you need something more advanced.

answered Feb 8, 2012 at 18:55

Spencer Kormos

8,4913 gold badges31 silver badges47 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Benj Over a year ago

Don't forget to declare your LinkedList (the most simple to use, IMHO) as a Queue and not as a List if you have (as me) this bad habit. Else, you will be given access only to the List Interface methods.

Jim Garrison · Accepted Answer · 2012-02-08 18:54:14Z

7

Read the JavaDoc for the java.util.Queue interface and pick an appropriate implementing class from the list shown.

answered Feb 8, 2012 at 18:54

Jim Garrison

87k20 gold badges161 silver badges196 bronze badges

Collectives™ on Stack Overflow

Implementing a basic FIFO queue in Java

2 Answers 2

1 Comment

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

1 Comment

Comments

Your Answer

Sign up or log in

Post as a guest

Related