How to Loop thru a Queue?

Question

I have a Queue that I can add and remove items from, but I need to display all the contents currently in the Queue.
How would I loop thru the Queue and do this?
Any simple example will do.
Thanks!

Answer 1

Thanks for the link. It showed me which methods an Iterator has, but not practical way to use it. So I did some googling and found this example.
import java.util.Iterator;
import java.util.NoSuchElementException;
for ( Iterator iter = myList.iterator(); iter.hasNext(); )
   String key = (String) iter.next();
   System.out.println( key );
   }Which makes perfect sense. However, where it says Iterator iter = myList.iterator(); I am not sure what to put in the myList.iterator(); part.
I would assume that my Queue object would be used there, however, my Queue object has no .iterator() method.
Like I said, I am new to Java so this is not as easy to me as it seems it should be.
But there is all of my code if it helps.....I'll leave out the unimportant parts.
Queenode class........................................
public class QueueNode {
//fields
Object info;
QueueNode link;
    public QueueNode() {
    public QueueNode(Object item) {
    info=item;
    link=null;
    public QueueNode(Object item, QueueNode qn) {
        info=item;
        link=qn;
}//end classQueue class..............................................
public class Queue {
   //create a front and back node
   private QueueNode front;
   private QueueNode rear;
   private int size;
   //methods
   public void insert(Object item){
      //if queue is empty front and rear are same
      if(isEmpty()){
          rear=new QueueNode(item);
          front = rear;
      }//end if
      //otherwise queue not empty add top end
      else{
          rear.link= new QueueNode(item);
          rear=rear.link;
      }//end else
      ///either case incriment size
      size++;
   }//end insert
   public Object remove(){
       //create a temp node referencing the front
       QueueNode oldFront=front;
       //peek at front item
       Object item = peek();
       //make front to link with the next node
       front=front.link;
       //remove temp node
       oldFront=null;
       //decrement size
       size--;
       //return the item that was removed
       return item;
   }//remove
   public Object peek(){
       if(isEmpty()){
           throw new NullPointerException();
       }//end if
       else{
           return front.info;
       }//and else
   }//end peek
   public boolean isEmpty(){
       return(size==0);
   }//end isEmpty
   public int getSize(){
       return size;
   }//end getsize
}//end classAnd finaly my class to test that the Queue is working....................
import javax.swing.*;
import javax.swing.border.BevelBorder;
import java.awt.*;
import java.awt.event.*;
import java.util.Iterator;
import java.util.NoSuchElementException;
public class QueueTest extends JFrame implements ActionListener{
    //Create Queue object
    Queue q = new Queue();
   public QueueTest(){
        //Add title to window
        super("Testing Queue's");
     }//end constructor
    public void actionPerformed(ActionEvent event){
        if (event.getSource()==btnAddQueueItem){
            q.insert(txtAddQueueItem.getText());
            for(Iterator iter = q.?????; iter.hasNext();){
                ///Output each queue item here........
            }//end for
        }//end if
         if (event.getSource()==btnRemoveQueueItem){
             q.remove();
         }//end if
    }//end actionPerformed
    public static void main(String[] args) {
    QueueTest testQueue = new QueueTest();
    }//end main
}//end class