queue.h

#ifndef _QUEUE_H
#define _QUEUE_H

#undef min
#undef max

#include <queue>

template <class T>
class Queue {
private:
  std::queue<T> q;
  int max;

public:
  Queue(int max) {
    this->max = max;
  }

public:
  void push(T &value) {
    if (isFull()) {
      q.pop();
    }
    q.push(value);
  }

  T pop() {
    T value = q.front();
    q.pop();
    return value;
  }

  int size() {
    return q.size();
  }
  
  bool isFull() {
    return size() == max;
  }

  bool isEmpty() {
    return size() == 0;
  }
};

#endif