#include "Queue.h"
#include <iostream>
using namespace std;
Queue ::Queue() {
    front = -1;
    rear = -1;
}
bool Queue::isEmpty() {
    return getFront() == -1 && getRear() == -1;
}
void Queue::operator<<(int value) {
    if(getRear() == SIZE - 1)
        cout << "Queue is full \n";
    else
    {
        if(getFront() == -1)
            front = 0;
        rear++;
        arr[rear] = value;
    }
}
void Queue::displayQueue()  {
    if(isEmpty())
        cout << "Queue is empty \n";
    else
    {
        for(int i = getFront(); i <= getRear(); i++)
            cout << arr[i] << "";
        cout << "\n";
    }
}
void Queue::operator>>(int) {
    if(isEmpty())
        cout << "Queue is empty \n";
    else
        if(getFront() == getRear())
            front = rear = -1;
        else
            front++;
}
int Queue::getRear() const {
    return rear;
}

int Queue::getFront() const {
    return front;
}