[pbl]

complicated for nothing

int compareTo(Object o) {
   return duration - ((Film) o).duration;

Better to declare
class Film implements Comparable<Film>

int compareTo(Film o) {
   return duration - o.duration;

[pbl]

Not really, you missed the whole concept. Nothing to be shamed about
Queues are queues not ARRAY and they are there to AVOID array.
Queue are build out of nodes that have a pointer to the next node (null if there is not one) in the queue, and optionaly in a circular queue, to the previous node object

[macosxnerd101]

You'll have to manually resize your array. Almost better to just use ArrayList<Film>, as ArrayList does all the resizing and position adjustment for you. If you must use static arrays, you'll have to create a new array of a larger size, shift the elements, then insert the new element. Finally, set the old array equal to the new array.

Quote

But is there still nodes when i'm doing it with the array circular queue?

No. You must use a Linked List, which is what pbl was talking about. Basically, you have Nodes pointing to each other. When you go to insert elements, you use a single iteration of insertion sort to determine their ordering.

[pbl]

A queue is NOT an array
A queue is composed of Node

class Node {
   Object data;     // whatever is own in the node
   Node next;       // pointer no next Node
}

And the que is built from node

Node firstNode = new Node()[
firstNode.data = "this is first node or whatever";

Node secondNode = new Node();
secondNode.data = "this is seond node"

firstNode.next = secondNode;
secondNode.next = null;  // end of list

now from fisrtNode you can scan all nodes until next == null

[macosxnerd101]

@pbl: Not entirely true. A Queue, like a Stack, is just a structure that enforces a certain ordering (FIFO for Queue, LIFO for Stack). With Queues, generally a LinkedList backs them. However, with Stacks an array backs them. In order for the Queue to be circular though, I agree with you that it *must* be Node based.

[pbl]

class Node {
   Object data;     // whatever is own in the node
   Node next;       // pointer no next Node
   Node previous;
}

And the queue is built from node

Node firstNode = new Node();
Node secondNode = new Node();
Node thirdNode = new Node();

firstNode.data = "this is first node or whatever";
secondNode.data = "this is second node";
thirdNode.data = "this is third node";

firstNode.next = secondNode;
firstNode.previous = thirdNode;

secondNode.next = thirdNode;
secondNode.previous = firstNode;

thirdNode.next = firstNode;
thirdNode.previous = secondNode;

[CiRi]

Hi I am having the exact same problems with this I understand what needs to be done i just cant get my head around coding it correctly and any help would be much appreciated

here is all my code so far and some of jklam as the project seems to be similar..

package queue;

import entities.Film;

public class ArrayCircularQueue implements Queue {
	private int front = 0, rear = 0;
	private Object []queue;
	
	public ArrayCircularQueue (int maxElements) {
		queue = new Object [maxElements];
	}
	
	public void enqueue (Comparable o) 
	{
		
		if(isEmpty())
		{
			int temp =rear;
			rear= (rear + 1) % queue.length;
			if (front ==rear) 
			{
				rear = temp;
				throw new FullQueueException ();
			}
			queue[rear] = o;
		}
				
		else
		{
			
			for(int i = 0; i <= queue.length; i++)
			{
				//duration is greater so everything must be moved right
				if(o.compareTo(queue[i]) == 1 )
				{
					for(int x = 0; x <= queue.length; x++)
					{
						int temp =rear;
						rear= (rear + 1) % queue.length;
						if (front ==rear) 
						{
							rear = temp;
							throw new FullQueueException ();
						}
						queue[rear] = queue[rear+1];
					}
					queue[front] = o;
				}
				
				if(o.compareTo(queue[i]) == 0 )
				{
					
				}
					
					
				
					
	public Object dequeue () {
		Object result = null ;
		if (front ==rear)
			throw new EmptyQueueException ();
		front= (front + 1) % queue.length;
		result = queue[front] ;
		queue[front] = null ;
		return queue[front];
	}	
	
	public boolean isFull () {
		return ((rear + 1) %queue.length) ==front;
	}
	
	public Object getTop() {
		int pos = (front + 1) % queue.length;
		return queue[pos];
	}

	public boolean isEmpty() {
		return front==rear;
	}

	public int compareTo(Film o) 
	{
		// 1:   films duration is greater than 'o'
		if(this.duration > ((Film)o).duration)
			return 1;
		// 0:   films duration equals 'o'
		else if(this.duration == ((Film)o).duration)
			return 0;
		// -1:   films durations is less than 'o'
		return -1;
	}

	public void enqueue(Object object) {
		// TODO Auto-generated method stub
		
	}

	
}

there are very basic coding errors i think and all help to fix and improve it would be appreciated if possible thanks again.