data-structures-and-algorithms/homework3/SeqQueue.cpp

//SeqQueue.cpp

#include "SeqQueue.h"

void initSeqQueue(SeqQueue &q) {
    q.front = q.rear = 0;
}

bool isEmpty(SeqQueue &q) {
    if (q.front == q.rear) {
        return true;
    }
    return false;
}

bool isFull(SeqQueue &q) {
    if ((q.rear + 1) % MAX_SIZE == q.front) {
        return true;
    }
    return false;
}