This Stack class uses a dynamically allocated one-dimensional array to store dat
ID: 3790759 • Letter: T
Question
This Stack class uses a dynamically allocated one-dimensional array to store data values (integers) that have been pushed onto the stack object. When the client code attempts to push another integer onto a full stack, your Push operation should invoke the Resize() function which attempts to double the capacity of the stack and then add the new data value to the resized stack array. In Resize() a new array (that holds twice as many integers) is dynamically allocated, data from the old stack array is copied into the new larger stack array, the old stack array is deallocated, and the new data value is pushed onto the new array.
main.cpp
/*************************************************************************************************/
#include <iostream>
#include <fstream>
#include <new>
#include <cstddef>
#include "stack.h"
using namespace std;
int main(int argc, char* argv[])
{
ifstream inputs; // Input file for commands
char op; // Hold operation and optional char input
int value; // Value input from file
string comment; // Holds comment from file
Stack* sPtr = NULL; // Will point to TemplateQ object
// Output usage message if one input file name is not provided
if (argc != 2)
{
cout << "Usage: project03 <inputfile> ";
return 1;
}
// Attempt to open input file -- terminate if file does not open
inputs.open(argv[1]);
if (!inputs)
{
cout << "Error - unable to open input file" << endl;
return 1;
}
// Input and echo header comment from file
getline(inputs, comment); // Input and echo the comment appearing in the test file
cout << endl << '#' << comment << endl;
// Process commands from input file
inputs >> op; // Attempt to input first command
while (inputs)
{
switch (op) // Process operation input from file
{
case '#': // Test file comment
getline(inputs, comment); // Input and echo the comment appearing in the test file
cout << '#' << comment << endl;
break;
case 'c': // Parameterized Constructor
inputs >> value;
cout << endl << "Stack(" << value << ")";
try
{
sPtr = new Stack(value); // Attempt to create a stack object with array size value
cout << " -- completed" << endl;
}
catch ( std::bad_alloc )
{
cout << "Failed : Terminating now..." << endl;
return 1;
}
break;
case '+': // Push
inputs >> value;
cout << "Push(" << value << ") -- ";
try
{
sPtr->Push(value);
cout << "completed";
}
catch (StackFull)
{
cout << "Failed Full Stack";
}
catch (...)
{
cout << "operation failed" << endl;
}
cout << endl;
break;
case '-': // Pop
cout << "Pop() -- ";
try
{
sPtr->Pop();
cout << "completed";
}
catch (StackEmpty)
{
cout << "Failed Empty Stack";
}
catch (...)
{
cout << "operation failed" << endl;
}
cout << endl;
break;
case 'f': // IsFull
cout << "IsFull() -- ";
try
{
if (sPtr->IsFull())
cout << "true";
else
cout << "false";
}
catch ( ... )
{
cout << "operation failed";
}
cout << endl;
break;
case 'e': // IsEmpty
cout << "IsEmpty() -- ";
try
{
if (sPtr->IsEmpty())
cout << "true";
else
cout << "false";
}
catch ( ... )
{
cout << "operation failed";
}
cout << endl;
break;
case 'm': // Make Empty
cout << "MakeEmpty() -- ";
try
{
sPtr->MakeEmpty();
cout << "completed" << endl;
}
catch (...)
{
cout << "operation failed" << endl;
}
break;
case 'p': // Print Stack
cout << "Print() -- ";
sPtr->Print();
break;
case 't': // Top of Stack
try
{
cout << "Top() -- " << sPtr->Top() << endl;
}
catch (StackEmpty)
{
cout << "Top() -- Failed Empty Stack" << endl;
}
catch (...)
{
cout << "operation failed" << endl;
}
break;
case '>': // Max value within Stack
try
{
cout << "Max() -- " << sPtr->Max() << endl;
}
catch (StackEmpty)
{
cout << "Max() -- Failed Empty Stack" << endl;
}
catch (...)
{
cout << "operation failed" << endl;
}
break;
case '<': // Min value within Stack
try
{
cout << "Min() -- " << sPtr->Min() << endl;
}
catch (StackEmpty)
{
cout << "Min() -- Failed Empty Stack" << endl;
}
catch (...)
{
cout << "operation failed" << endl;
}
break;
case '?': // Peek(n) Stack
inputs >> value;
try
{
cout << "Peek(" << value << ") -- " << sPtr->Peek(value) << endl;
}
catch (StackInvalidPeek)
{
cout << "Peek(" << value << ") -- Failed Invalid Peek" << endl;
}
catch (...)
{
cout << "operation failed" << endl;
}
break;
case 's': // Size of Stack
cout << "Size() -- ";
try
{
cout << sPtr->Size() << endl;
}
catch (...)
{
cout << "operation failed" << endl;
}
break;
case 'z': // Capacity of Stack
cout << "Capacity() -- ";
try
{
cout << sPtr->Capacity() << endl;
}
catch (...)
{
cout << "operation failed" << endl;
}
break;
case 'd': // Destructor
cout << "~Stack() -- ";
try
{
delete sPtr;
sPtr = NULL;
cout << "completed" << endl << endl;
}
catch (...)
{
cout << "operation failed" << endl << endl;
}
break;
default: // Error
cout << "Error - unrecognized operation '" << op << "'" << endl;
cout << "Terminating now..." << endl;
return 1;
break;
}
inputs >> op; // Attempt to input next command
}
return 0;
} // End main()
/*****************************************************************************************/
stack.h
/*****************************************************************************************/
#include <iostream>
using namespace std;
#ifndef STACK_H
#define STACK_H
class StackEmpty
{
// Exception class - throw an object of this type when stack is empty
// Hint: there is no code for exception classes
};
class StackFull
{
// Exception class - throw an object of this type when stack is full
};
class StackInvalidPeek
{
// Exception class - throw an object of this type when invalid peek position is used
};
class Stack // Models stack of integers ADT implemented as a dynamically allocated array
{
private:
int* array; // Points to the stack array
int num; // Holds max number of elements that may be stored in stack array
int top; // Holds the index of the top data value stored on the stack
void Resize(int n); // Attempts to increase size of stack array to 2*num and then push n onto stack
// If unable to resize, throw StackFull exception
public:
Stack(int n); // Parameterized constructor dynamically allocates an empty stack array
// that may hold no more than n elements and initializes other private variables
~Stack(); // Destructor deallocates all dynamically-allocated memory
// associated with the object
void Push(int n); // Pushes integer n onto top of stack. If stack is full, attempts to
// resize stack and then push n. If unable to resize, throws StackFull exception.
void Pop(); // Removes top integer from stack
// If stack is empty, throws StackEmpty exception
bool IsEmpty() const; // Returns true if stack is empty; false otherwise
bool IsFull() const; // Returns true if stack is full; false otherwise
void MakeEmpty(); // Removes all items from stack leaving an empty, but usable stack with capacity num
// If stack is already empty, MakeEmpty() does nothing
int Top() const; // Returns value of top integer on stack WITHOUT modifying the stack
// If stack is empty, throws StackEmpty exception
int Size() const; // Returns number of items on stack WITHOUT modifying the stack
int Max() const; // Returns value of largest integer on stack WITHOUT modifying the stack
// If stack is empty, throws StackEmpty
int Min() const; // Returns value of smallest integer on stack WITHOUT modifying the stack
// If stack is empty, throws StackEmpty
int Peek(unsigned int n) const; // Returns stack value n levels down from top of stack. Peek(0) = Top()
// If position n does not exist, throws StackInvalidPeek
int Capacity() const; // Returns total num of elements that maybe stored in stack array
/******* DO NOT MODIFY ANY OF THE CODE FOR PRINT() *******/
/****** DO NOT PLACE A COPY OF PRINT() CODE IN STACK.CPP!!! *******/
void Print() const // Writes stack contents to stdout, separated by a space, followed by endl
{
int index = top;
cout << "Top { ";
while (index != -1)
{
cout << array[index] << " ";
index--;
}
cout << "} Bottom" << endl;
} // End Print()
}; // End Class Stack
#endif
/*********************************************************************************************/
.txt files
/*********************************************************************************************/
# p03input1.txt -- Test: Stack(), Push(), Pop(), Top(), ~Stack()
# Test: Stack(), Push(), Pop(), Top(), ~Stack()
c 8
p
t
+ 5
+ 10
+ 15
p
t
+ 20
+ 25
+ 30
p
t
-
-
p
+ 35
+ 40
t
+ 45
t
p
-
-
-
-
-
-
-
-
p
t
d
# Test: Stack(), Push(), Pop(), Top(), ~Stack()
c 4
p
-
t
d
/****************************/
# p03input2.txt -- Test IsFull(), IsEmpty(), MakeEmpty()
# Size(), Capacity()
# Test IsFull(), IsEmpty(), MakeEmpty()
c 8
e
f
+ 5
+ 10
+ 15
+ 20
+ 25
+ 30
p
e
f
m
p
e
f
+ 35
+ 40
+ 45
+ 50
p
e
f
-
-
-
p
e
f
m
p
e
f
d
# Test Size()
c 6
p
s
+ 5
+ 10
p
s
+ 15
+ 20
p
s
+ 25
+ 30
p
s
-
-
-
p
s
-
-
-
p
s
d
# Test Capacity()
c 2
z
+ 5
z
+ 10
z
+ 15
z
+ 20
z
+ 25
z
+ 30
z
p
-
-
-
z
p
-
-
-
z
p
d
/************************/
# p03input3.txt -- Test Min(), Max(), Peek(...)
# Test Min() and Max()
c 8
<
>
+ 5
+ 30
+ 15
+ 20
+ 50
+ 10
p
<
>
+ 20
+ 50
+ 5
p
<
>
-
-
-
p
<
>
-
-
-
p
<
>
d
# Test Peek(n)
c 8
? 0
+ 5
+ 30
+ 15
+ 20
+ 50
+ 10
p
? 0
? 1
? 2
? 3
? 4
? 5
? 6
p
-
-
-
p
? 0
? 1
? 2
? 5
p
-
-
-
p
? 0
? 1
? 2
? 3
? 4
? 5
+ 25
+ 9
+ 8
p
? 0
? 1
? 2
? 3
? 4
? 5
d
Explanation / Answer
/*****************************************************************************************/
#include <iostream>
#include <exception>
#include <limits.h>
#include <new>
using namespace std;
#ifndef STACK_H
#define STACK_H
class StackEmpty: public exception
{
// Exception class - throw an object of this type when stack is empty
// Hint: there is no code for exception classes
virtual const char* what() const throw()
{
return "Stack is Empty Exception";
}
};
class StackFull: public exception
{
// Exception class - throw an object of this type when stack is full
virtual const char* what() const throw()
{
return "Stack is Full Exception";
}
};
class StackInvalidPeek: public exception
{
// Exception class - throw an object of this type when invalid peek position is used
virtual const char* what() const throw()
{
return "Stack Invalid Peek Excpetion";
}
};
class Stack // Models stack of integers ADT implemented as a dynamically allocated array
{
private:
int* array; // Points to the stack array
int num; // Holds max number of elements that may be stored in stack array
int top; // Holds the index of the top data value stored on the stack
void Resize(int n); // Attempts to increase size of stack array to 2*num and then push n onto stack
// If unable to resize, throw StackFull exception
public:
Stack(int n); // Parameterized constructor dynamically allocates an empty stack array
// that may hold no more than n elements and initializes other private variables
~Stack(); // Destructor deallocates all dynamically-allocated memory
// associated with the object
void Push(int n); // Pushes integer n onto top of stack. If stack is full, attempts to
// resize stack and then push n. If unable to resize, throws StackFull exception.
void Pop(); // Removes top integer from stack
// If stack is empty, throws StackEmpty exception
bool IsEmpty() const; // Returns true if stack is empty; false otherwise
bool IsFull() const; // Returns true if stack is full; false otherwise
void MakeEmpty(); // Removes all items from stack leaving an empty, but usable stack with capacity num
// If stack is already empty, MakeEmpty() does nothing
int Top() const; // Returns value of top integer on stack WITHOUT modifying the stack
// If stack is empty, throws StackEmpty exception
int Size() const; // Returns number of items on stack WITHOUT modifying the stack
int Max() const; // Returns value of largest integer on stack WITHOUT modifying the stack
// If stack is empty, throws StackEmpty
int Min() const; // Returns value of smallest integer on stack WITHOUT modifying the stack
// If stack is empty, throws StackEmpty
int Peek(unsigned int n) const; // Returns stack value n levels down from top of stack. Peek(0) = Top()
// If position n does not exist, throws StackInvalidPeek
int Capacity() const; // Returns total num of elements that maybe stored in stack array
/******* DO NOT MODIFY ANY OF THE CODE FOR PRINT() *******/
/****** DO NOT PLACE A COPY OF PRINT() CODE IN STACK.CPP!!! *******/
void Print() const // Writes stack contents to stdout, separated by a space, followed by endl
{
int index = top;
cout << "Top { ";
while (index != -1)
{
cout << array[index] << " ";
index--;
}
cout << "} Bottom" << endl;
} // End Print()
}; // End Class Stack
void Stack::Resize(int n) {
int *temp = NULL;
try {
temp = new int[2*num];
} catch (std::bad_alloc& bd) {
throw StackFull();
return;
}
for(int i=0;i<num;i++){
temp[i] = array[i];
}
temp[num] = n;
top = num;
num = 2*num;
delete [] array;
array = temp;
}
Stack::Stack(int n) {
num = n;
array = new int[n];
top = -1;
}
Stack::~Stack(void) {
delete [] array;
}
void Stack::Push(int n) {
if(IsFull()){
Resize(n);
}else{
array[++top] = n;
}
}
void Stack::Pop() {
if(IsEmpty()){
throw StackEmpty();
}else{
top--;
}
}
bool Stack::IsEmpty() const{
if(top == -1){
return true;
}else{
return false;
}
}
bool Stack::IsFull() const{
if(top == num-1){
return true;
}else{
return false;
}
}
void Stack::MakeEmpty() {
if(IsEmpty()){
return;
}
top = -1;
}
int Stack::Top() const{
if(IsEmpty()) {
throw StackEmpty();
}else{
return array[top];
}
return -1;
}
int Stack::Size() const {
return top+1;
}
int Stack::Max() const{
int max=INT_MIN;
if(IsEmpty()) {
throw StackEmpty();
}
for(int i=0;i<=top;i++){
if(array[i]>max){
max = array[i];
}
}
return max;
}
int Stack::Min() const{
int min=INT_MAX;
if(IsEmpty()) {
throw StackEmpty();
}
for(int i=0;i<=top;i++){
if(array[i]<min){
min = array[i];
}
}
return min;
}
int Stack::Peek(unsigned int n) const{
if(top+1 <= n){
throw StackInvalidPeek();
return -1;
}else{
return array[top-n];
}
}
int Stack::Capacity() const {
return num;
}
#endif
/*********************************************************************************************/
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.