Find primes of a number implementing queue. Need help debug!

Question

This class "Prime" is to find primes of a number using eratosthenes algorithm implementing queue data structure. I have difficulty removing numbers in the list that is the multiple of the next prime. Since I am only allow to use queue, I have a problem iterate through the list. The problem occurs inside my while loop, but I think it's the loop's condition that causes the problem. The program enters an endless loop when it's run; Anybody famaliar with eratosthenes algorithm; please give me some pointers to debug my program. Thanks
import java.lang.Integer;
import java.lang.Math;
public class Prime
public static void main(String[] args)
int input = 0;
System.out.print("Enter a max value for find its primes>> ");
Scanner in = new Scanner(System.in);
input = in.nextInt();
printAllPrimes(input);
public static void printAllPrimes(int max)
LinkedQueue qNum = new LinkedQueue(); //num list
LinkedQueue qPrime = new LinkedQueue(); //prime list
Integer object = new Integer(2);
Integer temp;
for(int i = 2; i<=max; i++)
Integer num = new Integer(i);
qNum.enqueue(num);
while(object.intValue() <= Math.sqrt(max))
object = (Integer)(qNum.dequeue());
qPrime.enqueue(object);
temp = (Integer)(qNum.first());
while(!qnum.isEmpty())
if((temp.intValue() % object.intValue() == 0))
qNum.dequeue();
//transfer all values of qNum to qPrime
//print qPrime
********************Here is the LinkedQueue implementation that I use with my Prime class*********************
// LinkedQueue.java Authors: Lewis/Chase
// Represents a linked implementation of a queue.
//package jss2;
import jss2.exceptions.*;
public class LinkedQueue implements QueueADT
private int count;
private LinearNode front, rear;
// Creates an empty queue.
public LinkedQueue()
count = 0;
front = rear = null;
// Adds the specified element to the rear of the queue.
public void enqueue (Object element)
LinearNode node = new LinearNode(element);
if (isEmpty())
front = node;
else
rear.setNext (node);
rear = node;
count++;
// Removes the element at the front of the queue and returns a
// reference to it. Throws an EmptyCollectionException if the
// queue is empty.
public Object dequeue() throws EmptyCollectionException
if (isEmpty())
throw new EmptyCollectionException ("queue");
Object result = front.getElement();
front = front.getNext();
count--;
if (isEmpty())
rear = null;
return result;
// Returns a reference to the element at the front of the queue.
// The element is not removed from the queue. Throws an
// EmptyCollectionException if the queue is empty.
public Object first() throws EmptyCollectionException
if (isEmpty())
throw new EmptyCollectionException ("queue");
return front.getElement();
// Returns true if this queue is empty and false otherwise.
public boolean isEmpty()
return (count == 0);
// Returns the number of elements currently in this queue.
public int size()
return count;
// Returns a string representation of this queue.
public String toString()
String result = "";
LinearNode current = front;
while (current != null)
result = result + (current.getElement()).toString() + "\n";
current = current.getNext();
return result;

Answer 1

never mind; it finally got it figured out. Thanks