#if !defined H_CLASS_FUNCTIONS
#define H_CLASS_FUNCTIONS
#include <stdlib.h>
#include <iostream.h>
#include "hadexitcodes.h"

#include "hqueuedata.h"
template<class Type> void HQueueData<Type>::free() {
	if(!pFirst) return;
	pCurrent=pFirst;
	HQueueElement * pElement;
	do {
		pElement=current;
		current=current->next;
		delete pElement;
	} while(pCurrent!=pFirst);
	pFirst=pLast=pCurrent=0;
}

template<class Type> Type& HQueueData<Type>::remove() {
	if(nElements==0) {
		cerr << " Queue already empty"<<endl;
		return Type();
	}
	HQueueElement * pElement=current;
	(current->previous)->next=current->next;
	(current->next)->previous=current->previous;
	current=current->next;
	nElements--;
	return pElement->element;
}

template<class Type> int HQueueData<Type>::append(const Type &dataElement) {
	HQueueElement *pElement=new HQueueElement (dataElement);
	if (pElement==0) return HFAILURE;
	if (nElements++) {
		last->next=pElement;
		pElement->previous=last;
		last=pElement;
		last->next=first;
		first->previous=last;
	}
	else {
		first=last=current=pElement;
		first->next=first->previous=pElement;
	}
	return HSUCCESS;
}
template<class Type> int HQueueData<Type>::insert(const Type &dataElement) {
	HQueueElement *pElement=new HQueueElement (dataElement);
	if (pElement==0) return HFAILURE;
	if (nElements++) {
		current->next=pElement;
		pElement->previous=current;
		pElement->next=current->next;
		(pElement->next)->previous=pElement;
		current=pElement;
	}
	else {
		first=last=current=pElement;
		first->next=first->previous=pElement;
	}
	return HSUCCESS;
}

template<class Type> int HQueueData<Type>::find(const Type &dataElement) {
	HQueueElement * pElement=current->next;
	int i=0;
	while( pElement->element!=dataElement && i<nElements) {
		i++;
		pElement=pElement->next;
	}
	if (i=nElements) return HFAILURE;
	current=pElement;
	return HSUCCESS;
}

template<class Type> int HQueueData<Type>::find() {
	HQueueElement * pCurEle=current;
	HQueueElement * pElement=current->next;
	int i=0;
	while(pCurEle->element != pElement->element && i<nElements) {
		i++;
		pElement=pElement->next;
	}
	if (i=nElements) return 0;
	current=pElement;
	return 1;
}

template<class Type> 
int HQueueData<Type>::find(const Type &minEle,const Type &maxEle) {
	HQueueElement * pElement=current->next;
	int i=0;
	while( pElement->element > minEle && pElement->element < maxEle && i<nElements) {
		i++;
		pElement=pElement->next;
	}
	if (i=nElements) return 0;
	current=pElement;
	return 1;
}

#endif