#include <stdio.h>
#include "pq.h"

QuePtr initQueue(){
	QuePtr queue = (QuePtr)malloc(sizeof(QueType));
	queue->head = NULL;
	return queue;
}

int isEmpty(QuePtr queue){
	int i = 5;
	if (queue->head == NULL){
		i = 1;
	}
	if (queue->head != NULL){
		i = 0;
	}
	return i;

}
void emptyqueue(QuePtr queue){
	NodePtr node = queue->head;
	while (node != NULL){
		node = node->next;
		queue->head = queue->head->next;
	}
}
void destroyqueue(QuePtr queue){
	NodePtr node = queue->head;
	NodePtr nodeAfter = queue->head;

	while (nodeAfter){
		nodeAfter = node->next;
		free(node);
		node = nodeAfter;
	}
}
void enqueue(QuePtr queue, int data){
	NodePtr EnqueuedNode, Temp;

	EnqueuedNode = (NodePtr)malloc(sizeof(Node));

	EnqueuedNode->data = data;

	EnqueuedNode->next = NULL;
	if (queue->head == NULL){
		queue->head = EnqueuedNode;
	}
	else
	{
		queue->tail->next = EnqueuedNode;
		//Temp = queue->tail;
		//Temp->next = EnqueuedNode;
		//EnqueuedNode = EnqueuedNode->next;
		//queue->tail = Temp;
	}
	queue->tail = EnqueuedNode;
	//queue->tail->next = EnqueuedNode;
	queue->size++;
	//queue->tail = EnqueuedNode;
}

QueData getHighestPr(QuePtr queue){
	QueData front = queue->head->data;

	return front;

}

void dequeue(QuePtr queue){
	NodePtr DequeuedNode;

	DequeuedNode = (NodePtr)malloc(sizeof(Node));

	DequeuedNode = queue->head;

	queue->head = queue->head->next;

	free(DequeuedNode);
}


QueData getSize(QuePtr queue){
	NodePtr Node;
	int size = 1;

	Node = (NodePtr)malloc(sizeof(Node));

	Node = queue->head;
	if (Node == NULL){
		size--;
		return size;
	}
	else while (Node->next != NULL){
		Node = Node->next;
		size++;
	}
	return size;
}

void compare(QueueData a1, QueueData a2){


}