Look at LinkedBlockingDeque.  You will have to implement the removal of
the first element but that should be too complicated.

On Mar 6, 8:49 am, "Proton Projects - Moin" <mohd.mohid...@gmail.com>
wrote:

Hi Moin,
your required functionality can be obtained with some logic on arrays
or lists. Find the below code which implements the above logic with
array list:

import java.util.ArrayList;

public class FixQueue<T> {

    public static final int QUEUE_SIZE = 2000; //Fixing the Queue Size
    private ArrayList fixQueue;

    public FixQueue(int queue_size2) {
        fixQueue = new ArrayList<String>(QUEUE_SIZE);
    }

    public void add(String element){

        if(fixQueue.size() == QUEUE_SIZE)
            fixQueue.remove(0); // Remove first element when queue is full

               //adds the element in the last position,
               //when queue is full, the elements will be added at
2000th position
        fixQueue.add(element);
    }

    public String toString(){
        return fixQueue.toString();
    }

    public static void main(String[] args) {
        FixQueue<String> queue = new FixQueue<String>(QUEUE_SIZE);
        for(int i=1; i<=2010; i++)
            queue.add("e"+i);

        System.out.println(queue);
    }
}

Proton Projects - Moin schreef:

Have a look at
http://jakarta.apache.org/commons/collections/apidocs/org/apache/commons/collect
ions/buffer/BoundedBuffer.html
and the Buffer package in general.

If you want a version that uses generics, contact me.

H.
- --
Hendrik Maryns
http://tcl.sfs.uni-tuebingen.de/~hendrik/
==================
http://aouw.org
Ask smart questions, get good answers:
http://www.catb.org/~esr/faqs/smart-questions.html

Historically, these things have been implemented as "ring buffers": An array
of the appropriate size and type, with an index that is incremented modulo
the array size whenever an element is added. The compute overhead with this
type of extremely low, and no conditional logic is required at all. The
newest element simply replaces the oldest element at the insertion point.

http://en.wikipedia.org/wiki/Ring_buffer