Which Queue implementation to use in Java?
        Posted  
        
            by devoured elysium
        on Stack Overflow
        
        See other posts from Stack Overflow
        
            or by devoured elysium
        
        
        
        Published on 2010-04-17T17:16:21Z
        Indexed on 
            2010/04/17
            17:23 UTC
        
        
        Read the original article
        Hit count: 311
        
I need to use a FIFO structure in my application. It needs to have at most 5 elements. I'd like to have something easy to use (I don't care for concurrency) that implements the Collection interface.
I've tried the LinkedList, that seems to come from Queue, but it doesn't seem to allow me to set it's maximum capacity. It feels as if I just want at max 5 elements but try to add 20, it will just keep increasing in size to fit it. I'd like something that'd work the following way:
XQueue<Integer> queue = new XQueue<Integer>(5); //where 5 is the maximum number of elements I want in my queue.
for (int i = 0; i < 10; ++i) {
    queue.offer(i);
}
for (int i = 0; i < 5; ++i) {
    System.out.println(queue.poll());
}
That'd print:
5
6
7
8
9
Thanks
© Stack Overflow or respective owner