-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstackWithAccess.cpp
More file actions
125 lines (108 loc) · 2.3 KB
/
stackWithAccess.cpp
File metadata and controls
125 lines (108 loc) · 2.3 KB
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
#include <iostream>
#include <memory>
#include "stackWithAccess.hpp"
stack::stack () {
top = nullptr;
size = 0;
}
stack::~stack () {
}
void stack::push (int v) {
if (size >= max_size) {
std::cout<<"Stack full, cannot push\n";
return;
}
std::unique_ptr<stackElem> temp (new stackElem);
temp->ptr = std::move(top);
temp->val = v;
top = std::move(temp);
size++;
}
int stack::pop () {
if (size <= 0) {
std::cout<<"Stack empty, cannot pop\n";
return 0;
}
int temp = top->val;
top = std::move(top->ptr); //I hope this deletes top
size--;
return temp;
}
const int& stack::operator[] (size_t index) const {
if (index >= size) {
std::cout<<"Tried to access nonexistent stack element\n";
exit(2);
}
stackElem *temp = top.get();
for (size_t i = 0; i < index; i++) {
temp = temp->ptr.get();
}
return temp->val;
}
int& stack::operator[] (size_t index) {
if (index >= size) {
std::cout<<"Tried to access nonexistent stack element. The program will crash now\n";
exit(1);
}
stackElem *temp = top.get();
for (size_t i = 0; i < index; i++) {
temp = temp->ptr.get();
}
return temp->val;
}
const size_t stack::getSize () const {
return size;
}
// float stack here =====================
stackf::stackf () {
top = nullptr;
size = 0;
}
stackf::~stackf () {
}
void stackf::push (float v) {
if (size >= max_size) {
std::cout<<"Stack full, cannot push\n";
return;
}
std::unique_ptr<stackfElem> temp (new stackfElem);
temp->ptr = std::move(top);
temp->val = v;
top = std::move(temp);
size++;
}
float stackf::pop () {
if (size <= 0) {
std::cout<<"Stack empty, cannot pop\n";
return 0;
}
float temp = top->val;
top = std::move(top->ptr); //I hope this deletes top
size--;
return temp;
}
const float& stackf::operator[] (size_t index) const {
if (index >= size) {
std::cout<<"Tried to access nonexistent stack element\n";
exit(2);
}
stackfElem *temp = top.get();
for (size_t i = 0; i < index; i++) {
temp = temp->ptr.get();
}
return temp->val;
}
float& stackf::operator[] (size_t index) {
if (index >= size) {
std::cout<<"Tried to access nonexistent stack element. The program will crash now\n";
exit(1);
}
stackfElem *temp = top.get();
for (size_t i = 0; i < index; i++) {
temp = temp->ptr.get();
}
return temp->val;
}
const size_t stackf::getSize () const {
return size;
}