queue4.c

自己做的常用库和实现的数据结构。public domain.

/* Demo of simple loop queue, using dynamic link.
 *
 * Written by Cyril Hu ([e-mail]), public domain.
 */
#include<my.h>
#define MAX 10
typedef int ElemType
typedef struct QNode {
	ElemType e;
	struct QNode *next;
} QNode, *QNodePtr;
typedef struct {
	QNodePtr head, front, rear;
} Queue;

void EnQueue(Queue p, ElemType data)
{
	static size_t headflag = 0;
	if(headflag++ == 0) {
		p->head = p->front = p->rear = (QNodePtr)mem('m', sizeof(QNode));
		p->rear->e = data;
	} else {
		p->rear->next = (QNodePtr)mem('m', sizeof(QNode));
		p->rear->next->e = data;
		p->rear = p->rear->next;
	}
	p->rear->next = p->head->next;



}
void DeQueue(Queue p)
{

}
void DestroyQueue(Queue p)
{

}
int main(void)
{
	Queue t, *p = &t;
	int i, a[MAX];
	for(i=0; i<MAX; i++)
		EnQueue(p, i);
	for(i=0; i<MAX; i++)
		DeQueue(p, &a[i]);
	for(i=0; i<MAX; i++)
		printf("%d ", a[i]);
	return 0;
}