Instructions
Objective
Write a program to implement array queue in C++.
Requirements and Specifications
Description : follow up the steps in assignment document and display output as assignment requirements. Must finished coding based on provided coding documents. I already have .h and .cpp file. Just need to complete the C++ assignment coding.
Source Code
// Created by Frank M. Carrano and Timothy M. Henry.
// Copyright (c) 2017 Pearson Education, Hoboken, New Jersey.
/** ADT queue: Circular array-based implementation.
Listing 14-5.
@file ArrayQueue.cpp */
#include "ArrayQueue.h" // Header file
template
ArrayQueue::ArrayQueue() : front(0), back(DEFAULT_CAPACITY - 1), count(0)
{
} // end default constructor
template
bool ArrayQueue::isEmpty() const
{
return count == 0;
} // end isEmpty
template
bool ArrayQueue::enqueue(const ItemType& newEntry)
{
bool result = false;
if (count < DEFAULT_CAPACITY)
{
// Queue has room for another item
back = (back + 1) % DEFAULT_CAPACITY;
items[back] = newEntry;
count++;
result = true;
} // end if
return result;
} // end enqueue
template
bool ArrayQueue::dequeue()
{
bool result = false;
if (!isEmpty())
{
front = (front + 1) % DEFAULT_CAPACITY;
count--;
result = true;
} // end if
return result;
} // end dequeue
template
ItemType ArrayQueue::peekFront() const throw(PrecondViolatedExcep)
{
// Enforce precondition
if (isEmpty())
throw PrecondViolatedExcep("peekFront() called with empty queue");
// Queue is not empty; return front
return items[front];
} // end peekFront
// End of implementation file.