-
Notifications
You must be signed in to change notification settings - Fork 0
/
02_ShallowCopyProblem.cpp
73 lines (63 loc) · 1.19 KB
/
02_ShallowCopyProblem.cpp
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
#include <iostream>
using namespace std;
#define DEFAULT_SIZE 10
class invalid_operation_ex {};
class stack {
public:
stack(int size = DEFAULT_SIZE);
~stack();
void push(int x);
void pop();
int top() const;
int elem_count() const { return count; }
private:
int *elements;
int size;
int count;
};
stack::stack(int s) {
cout << "--constructor called\n";
size = s;
elements = new int[size];
count = 0;
}
stack::~stack() {
cout << "--destructor called\n";
delete[] elements;
}
void stack::push(int x) {
if (count >= size)
throw invalid_operation_ex();
elements[count] = x;
count++;
}
void stack::pop() {
if (count > 0)
count--;
else
throw invalid_operation_ex();
}
int stack::top() const {
if (count > 0)
return elements[count-1];
else
throw invalid_operation_ex();
}
void print_stack(stack s) {
while (s.elem_count() > 0) {
cout << s.top() << ' ';
s.pop();
}
cout << endl;
}
int main() {
stack u;
u.push(4);
u.push(5);
u.push(12);
print_stack(u);
u.pop();
u.pop();
u.pop();
// Explain the result of execution of this code
}