// LQueue.cpp: implementation of the LQueue class.
//
//////////////////////////////////////////////////////////////////////

#include "stdafx.h"
#include "antclusting.h"
#include "LQueue.h"

#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif

//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////
template <class Elem> 
LQueue<Elem>::LQueue(void)
{
front=rear=new CLink<Elem>;
front->next=NULL;
 size = 0;
}
template <class Elem> 
LQueue<Elem>::~LQueue()
{
  clear();
}

template <class Elem> 
void LQueue<Elem>::clear() {         // Clear queue
    while(front != NULL) { // Delete each link node
		rear = front;
		front = front->next;
		delete rear;
    }
    rear = NULL;
    size = 0;
  }

template <class Elem>
bool LQueue<Elem>::enqueue(const Elem& it) {
                  // Append new node
		rear->next = new Link<Elem>(it, NULL);
		rear = rear->next;
       size++;
    return true;
  }

template <class Elem>
bool LQueue<Elem>::dequeue(Elem& it) 
{ // Remove Elem from front
	if (size == 0) return false;    // Empty
	it = front->element;            // Store dequeued value
	Link<Elem>* ltemp = front;      // Hold dequeued link
	front = front->next;            // Advance front
	delete ltemp;                   // Delete link
	if (front == NULL) rear = NULL; // Dequeued last element
	size --;
	return true;                    // Return element value
}


template <class Elem>
bool LQueue<Elem>::frontValue(Elem& it) const {
    if (size == 0) return false;
    it = front->element;
    return true;
  }

template <class Elem>
int LQueue<Elem>::length() const 
{ return size; }

template <class Elem>
bool LQueue<Elem>::visit(Elem& it)
{   
	CLink<Elem> *temp;
	temp=front;
	
	if (front==rear==NULL)
		return false;
	else 
	{
		while(temp)
		{
			if(it==temp->element )	return false;
			temp=temp->next;
		}
		retrun true;
	}
	
}