C / C++ Code Portfolio

return *this;
}

// Push a new value to the back of the queue

template<typename T>
void Queue::push(const T &t)
{
// If the queue is out of space, allocate new space for more queue items
if (vused_ == vsize_)
{
// double the size of the new queue
size_t vsize_new = vsize_ * 2 + 1;
cout << "Increasing size of Queue. Current size: " << vused_ << ", new size: " << vsize_new << "\n";
// allocate new memory for a larger queue, but do not construct any objects
T *v_new_safe = static_cast(operator new(vsize_new * sizeof(T)));
// construct each object for the new queue
for (size_t i = 0; i < vused_; ++i)
{
construct(v_new_safe + i, v_[i]);
}
// copy elements from the old small queue into the new large queue
swap(v_, v_new_safe);
// destroy the objects in the temporary queue
destroy(v_new_safe);
// deallocate memory from the temporary queue
operator delete(v_new_safe);
vsize_ = vsize_new;
}
// push the new value to the end of the queue
construct(v_ + vused_, t);
// increment number of items in the queue
++vused_;
}

// pop the front value from the queue

template<typename T>
void Queue::pop()
{
// if the queue is empty, cannot pop a value; throw
if (vused_ == 0)
{
throw logic_error("Error: attempt to pop from empty queue");
}
// otherwise, move all of the elements of the queue one closer to the front
// and decrement vused_
// I am guessing this is absurdly inefficient but it works
else
{
for (size_t element = 1; element <= vused_; ++element)
{
v_[element - 1] = v_[element];
}
--vused_;
}
}

// Constructs a new object in a given location using a given value