//queue.h
//John T. Rine
//November 3, 2011

#ifndef _QUEUE_H
#define _QUEUE_H

#include<stdlib.h>
#include<stdio.h>

struct Node
{
	int data;
	struct Node * prev;
	struct Node * next;
};

typedef struct Node node;

//copyQueue.c
void copyQueue(node *head, node **copyHead, node **copyTail);

//isEmpty.c
int isEmptyTail(node *);
int isEmptyHead(node *);

//createFixedQueue.c
void createFixedQueue(node **, node **, int);

//listQueueSize.c
int listQueueSizeHead(node *);
int listQueueSizeTail(node *tail);

//enQueue.c
void enQueue(node **, node **, int);

//deQueue.c
int deQueue(node **, node **);

//destroyFixedQueue.c
void destroyFixedQueueHead(node **, node **);
void destroyFixedQueueTail(node **, node **);


#endif