Queue.java

import java.io.*;
public class Queue{
	public int maxsize;
	public double[] queuearray;
	public int front;
	public int rear;
	public int jumlah;

	public void inisiasi(int s) {
		maxsize = s;
		queuearray= new double[maxsize];
		front = rear = jumlah = 0;
	}

	public void enqueue(double data) {
		if(jumlah == maxsize)
			System.out.println("Queue penuh. " + data + " Tidak bisa masuk");
		else {
			queuearray[rear] = data;
			rear = (rear+1) % maxsize;
			jumlah++;
			System.out.println("berhasil. " + data + " Masuk ke queue");
		}
	}

	public double dequeue() {
		double temp;
		if(jumlah == 0){
			System.out.println("Queue sudah kosong. ");
			return (-1);
		} else {
			temp = queuearray[front];
			front = (front+1) % maxsize;
			jumlah--;
			System.out.println(temp + " Keluar dari queue");
			return (temp);
		}
	}

	public static void main(String[] args)
	{
	 	Queue queue = new Queue();
	 	queue.inisiasi(3);
	 	queue.enqueue(2);
	 	queue.enqueue(3);
	 	queue.enqueue(5);
	 	queue.enqueue(7);
	 	queue.view();

	 	queue.dequeue();
	 	queue.dequeue();
	 	queue.dequeue();
	 	queue.dequeue();
	 	queue.view();

	 	queue.enqueue(8);
		queue.enqueue(9);
		queue.enqueue(7);
	 	queue.enqueue(10);
	 	queue.view();

	 	queue.dequeue();
	 	queue.view();

	}

	public void view() {
		System.out.print("Isi Queue: ");

		if(jumlah> 0 && front < rear)
			for(int i = front; i<=rear; i++)
				System.out.print(queuearray[i] + " " );
		else if(jumlah > 0 && rear <=front) {
			for(int i=front; i<=maxsize-1; i++)
				System.out.print(queuearray[i] + " ");

			//for(int i=0; i<maxsize-1; i++)
			//	System.out.print(queuearray[i] + " ");

		}

		System.out.println();
	}
}