/*
 * fifo.h
 *
 * Author: Pedro de la Cruz
 * University of Houston
 * Data Structures, Fall 2009
 *
 */
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
using namespace std;

class Fifo {
	
    private:
			int pid;
			int duration;
			int arrival;
			int occupied;
    public:
			
			Fifo();
			Fifo(int pidValue, int durationValue, int arrivalValue);
			Fifo(char * line);
			~Fifo();
			void clear();
			static void append(Fifo * array, Fifo * object, int queueSize);
			static void remove(Fifo * array, int value, int queueSize);
			void setPid(int value);
			int getPid();
			void setDuration(int value);
			int getDuration();
			void setArrival(int value);
			int getArrival();
			void setOccupied(int value);
			int getOccupied();
			
			
};