stack-Array/stackType.h at main · Danhh-zk/stack-Array · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
#pragma once

#include <iostream>

#include <assert.h>
#include "stackType.h"

using namespace std;

template <class Type>

class stackType
{

private:
	int maxStackSize;
	int stacktop;
	Type* list;

public:

	void initializeStack();

	bool isEmptyStack();

	bool isFullStack();

	void destroyStack();

	void push(const Type& newItem); void pop(Type& poppedItem);

	void displaystack();

	Type top();

	stackType(int stackSize = 100);

	~stackType();

	const stackType<Type>& operator=(const stackType<Type>&);

	stackType(const stackType<Type>& otherStack);

};

template<class Type>
void stackType<Type>::initializeStack()
{
	stacktop = 0;
}

template<class Type> void stackType<Type> ::destroyStack()

{

	stacktop = 0;
}

template<class Type>

bool stackType<Type>::isEmptyStack()

{
	return(stacktop== 0);
}


template<class Type>

bool stackType<Type>::isFullStack()

{
	return(stacktop == maxStackSize);

}

template<class Type>

stackType<Type> ::stackType(int stackSize)

{

	if (stackSize <= 0)

	{

		cout << "The size of the array to hold the stack must "<< "be positive. " << endl;

		cout << "Creating an array of size 100." << endl;

		maxStackSize = 100;
	}
	else

		maxStackSize =stackSize;

	stacktop = 0;

	list= new Type[maxStackSize];

}

	template<class Type>

	stackType<Type>::~stackType()
	{
		delete[] list;
	}
    template<class Type>

stackType<Type> ::stackType(const stackType<Type>& otherStack)
{
  int j;
	maxStackSize =otherStack.maxStackSize;
	stacktop = otherStack.stacktop;
	list= new Type[maxStackSize];

	if (stacktop != 0)
		for (j = 0; j < stacktop; j++)
			list[j] = otherStack.list[j];

}

template<class Type>
const stackType<Type>& stackType<Type>::operator=(const stackType<Type>& otherStack)
{
	int j;
if (this != &otherStack)
{
  if (maxStackSize != otherStack.maxStackSize)

    cout << "Cannot copy. The two stacks are of different sizes." << endl;

else

{

stacktop = otherStack.stacktop;

if (stacktop != 0)
for (j = 0; j < stacktop; j++)
list[j] = otherStack.list[j];

}

}

return *this;

}

template<class Type>

void stackType<Type> ::push(const Type& newItem)

{

	if (!isFullStack())
	{
		list[stacktop] = newItem;
		stacktop++;
	}
	else

		cout << "Cannot add to a full stack." << endl;

}


template<class Type>
void stackType<Type>::pop(Type& poppedItem)
{

	if (!isEmptyStack())

	{

		stacktop--;

		poppedItem =list[stacktop];

	}
	else

		cout << "Cannot remove from an empty stack." << endl;

}

template<class Type>
void stackType<Type>::displaystack()

{
	int i;
	for (i = 0; i < stacktop; i++)
	cout << list[i] << " ";
	cout << endl;

}

template <class Type>

Type stackType<Type>::top() {

	assert(stacktop != 0);

	return list[stacktop - 1];

}