// fifo.h  -- A queue of integers (dynamic storage)

#ifndef FIFO_H_
#define FIFO_H_

class Fifo {
	struct node{
		node *next;
		int value;
	};
	node * head;	// whence we dequeue
	node * tail;	// where we enqueue
public:

	// Constructor
	Fifo();

	// enqueue a new value
	void enqueue(int who);

	// dequeue a value from a fifo
	int dequeue();

	// check if a fifo is empty
	int isempty();
};

#endif