#include"Queue.h"
#include<stdio.h>
#include<malloc.h>
#include<assert.h>



QNode* buyQNode(QDataType data) {
	QNode* newNode = (QNode*)malloc(sizeof(QNode));
	if (newNode == NULL) {
		assert(0);
		return NULL;
	}

	newNode->data = data;
	newNode->next = NULL;
	return newNode;
}

void QueueInit(Queue* q) {
	assert(q);
	q->front = q->back = NULL;
	q->size = 0;

}

void QueueDestroy(Queue* q) {
	assert(q);
	QNode* cur = q->front;
	while (cur) {
		q->front = cur->next;
		free(cur);
		cur = q->front;
	}
	q->back = NULL;
	q->size = 0;
}

void QueuePush(Queue* q, QDataType data) {
	assert(0);
	QNode* newNode = buyQNode(data);
	if (q->front == NULL) {
		q->front = newNode;
	}
	else {
		q->back->next = newNode;

	}
	q->back = newNode;
	q->size++;
}

void QueuePop(Queue* q) {
	if (QueueEmpty(q)) {
		return;
	}
	else {
		QNode* delNode = q->front;
		q->front = delNode->next;
		free(delNode);
		if (q->front == NULL) {
			q->back = NULL;
		}
	}
	q->size--;
}
// 获取队头元素
QDataType QueueFront(Queue* q)
{
	assert(!QueueEmpty(q));
	return q->front->data;
}

// 获取队尾元素
QDataType QueueBack(Queue* q)
{
	assert(!QueueEmpty(q));
	return q->back->data;
}

// 获取队列中有效元素个数
int QueueSize(Queue* q)
{
	assert(!QueueEmpty(q));
	return q->size;
}

// 检测队列是否为空
int QueueEmpty(Queue* q)
{
	assert(q);
	return NULL == q->front;
}