main.c(queue 구조체)

※main.c파일

#include <stdio.h>

#include "queue.h"



int main(void)

{

	Queue s1, s2;

	initQueue(&s1);

	initQueue(&s2);

	push(&s1,100); 

	push(&s1,200);

	push(&s1,300);

	printf("s1 1st pop() : %d\n",pop(&s1));

	printf("s1 2nd pop() : %d\n",pop(&s1));

	printf("s1 3rd pop() : %d\n",pop(&s1));

	pop(&s1);

	

	push(&s2,900);

	push(&s2,800);

	printf("s2 1st pop() : %d\n",pop(&s2));

	push(&s2,700);

	printf("s2 2nd pop() : %d\n",pop(&s2));

	printf("s2 3rd pop() : %d\n",pop(&s2));

	return 0;

}

※queue.h파일

#ifndef QUEUE_H

#define QUEUE_H

#define QUEUESIZE 100



typedef struct queue {

	int array[QUEUESIZE];

	int rear;

	int front;

}Queue;



void initQueue(Queue *s);

void push(Queue *s, int data);

int pop(Queue *s);



#endif

※queue.c파일

#include <stdlib.h>

#include <stdio.h>

#include "queue.h"



void initQueue(Queue *s)

{

	s->rear = 0;

	s->front = 0;

}



void push(Queue *s, int data)

{

	if (s->rear == QUEUESIZE) {

		fprintf(stderr,"queue is full\n");

		exit(1);

	}

	s->array[s->rear] = data;

	++s->rear;

}



int pop(Queue *s)

{

	if (s->front >= s->rear) {

		fprintf(stderr,"queue is empty\n");

		exit(2);

	}

	int index = s->front;

	++s->front;

	return s->array[index];

}