Queue.cpp

bool Queue::enqueue(const Potion& aPotion)
{
    if (size == MAX_CAPACITY)
        return false; //Returns false if the queue is full

    //Add the item to the end of the queue
    items[rear] = aPotion;
    rear = (rear + 1) % MAX_CAPACITY; //Circular, so no shifting needed.
    size++;
    return true;
}