Repository navigation
Expand file tree
/
Copy pathDSStack.h
More file actions
150 lines (128 loc) · 2.76 KB
/
Copy pathDSStack.h
File metadata and controls
150 lines (128 loc) · 2.76 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
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
//
// Created by tirem on 3/23/2021.
//
#ifndef PA04_AMAZING_DSSTACK_H
#define PA04_AMAZING_DSSTACK_H
template <class T>
class DSStack {
private:
T* datas;
int capacity;
int size;
public:
DSStack();
DSStack(int);
DSStack(const DSVector<T>& original);
~DSStack();
void resize();
void push_back(const T&);
int getSize();
int getCapacity();
T peek();
bool empty();
void pop();
void swap(int, int);
DSStack<T>& operator=(const DSStack<T>&);
T& operator[] (const int);
};
template <class T>
DSStack<T>::DSStack(){
this->capacity = 10;
this->size = 0;
this->datas = new T[capacity];
}
template <class T>
DSStack<T>::DSStack(int v){
this->capacity = v;
this->size = 0;
this->datas = new T[capacity];
}
template <class T>
DSStack<T>::DSStack(const DSVector<T>& original){
this->capacity = original.capacity;
this->size = original.size;
this->datas = new T[capacity];
for(int i = 0; i < original.size; i++){
this->datas[i] = original.datas[i];
}
}
template <class T>
DSStack<T>::~DSStack(){
delete[] datas;
}
template <class T>
void DSStack<T>::resize(){
T* temp = new T[2*capacity];
for(int i = 0; i < size; i++){
temp[i] = datas[i];
}
capacity *= 2;
delete[] datas;
datas = temp;
}
template <class T>
void DSStack<T>::push_back(const T& value){
if(size == capacity){
resize();
}
datas[size++] = value;
}
template <class T>
int DSStack<T>::getSize(){
return size;
}
template <class T>
int DSStack<T>::getCapacity(){
return capacity;
}
template <class T>
T DSStack<T>::peek(){
return datas[size-1];
}
template <class T>
bool DSStack<T>::empty(){
if(size == 0){
return true;
}
return false;
};
template <class T>
void DSStack<T>::pop(){
if(size == 0){
throw std::out_of_range("Nothing to pop");
}
T empty;
datas[size-1] = empty;
size--;
}
template <class T>
void DSStack<T>::swap(int index1, int index2){
T temp = datas[index1];
datas[index1] = datas[index2];
datas[index2] = temp;
}
template <class T>
DSStack<T>& DSStack<T>::operator=(const DSStack<T>& oldVector) {
if (this == &oldVector) {
return *this;
}
//Create new vector
if(this->empty() == false){
delete[] datas;
}
this->capacity = oldVector.capacity;
this->size = oldVector.size;
this->datas = new T[oldVector.capacity];
for(int i = 0; i < oldVector.size;i++){
this->datas[i]= oldVector[i];
}
return *this;
}
template <class T>
T& DSStack<T>::operator[] (const int index){
if(index >= capacity){
throw std::out_of_range("bad index value");
}
return datas[index];
}
#endif //PA04_AMAZING_DSSTACK_H