Dealing with queue

A queue is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position. This makes the queue a First-In-First-Out (FIFO) data structure.Queue is a linear data structure.

Codes:

Interface

public interface InterQueue {
	boolean isEmpty();
    	void enqueue(Object x);
    	Object dequeue();
}

Basic class:

public class RishanQueue {

    public RishanQueue() {
    	theArray = new Object[DEFAULT_CAPACITY];
    	head = 0;
    	tail = 0;
    }
    
    public boolean isEmpty(){
    	return queueSize==0;
    }
    
    public void enqueue(Object x){
    	if(queueSize==theArray.length)throw new RishanException("Enqueue");
    	theArray[tail] = x;
    	queueSize++;
    	if(queueSize<theArray.length && tail+1 == theArray.length){
    		tail = 0;
    	}else tail++;
    }
    
    public Object dequeue(){
    	if(isEmpty())throw new RishanException("Dequeue");
    	Object x = theArray&#91;head&#93;;
    	queueSize--;
    	if(++head==theArray.length)
    		head = 0;
    	return x;
    }
      
    private final int DEFAULT_CAPACITY = 10;
    private int &#91;&#93; theArray;
    private int head=0;
    private int tail=0;
    private int queueSize=0;
    
}
&#91;/sourcecode&#93;

<strong>Exception class:</strong>


public class RishanException extends java.io.RuntimeException {
    public RishanException(String msg) {
        super(msg);
    }
}

In this implementation i used a fixed length of array but if anyone we want to increase out queue size
then we can use following method:

private void doubleQueue( )
{
Object [ ] dummy;
dummy = new Object[ theArray.length * 2 ];
for(int i=0;i

Advertisements