-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathStack.h
73 lines (68 loc) · 1.65 KB
/
Stack.h
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
/*
Stack
Stack program of template
Copyright (C) 2021 Osamu Miyazawa
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#pragma once
#include <Arduino.h>
#define STACKSIZE 8
template <class T>
class Stack {
static const int size = STACKSIZE;
static const int bottom = 0;
public:
Stack(){
top = -1;
data = new T[size];
}
~Stack(){
delete[] data;
}
void push(const T &element){
if(depth() == size) {
Serial.println("This Stack is already full.");
return;
}
data[++top] = element;
}
T pop(){
if(depth() == 0) {
Serial.println("This Stack is already empty.");
exit(1);
}
return data[top--];
}
T peek(){
if(depth() == 0) {
Serial.println("This Stack is already empty.");
exit(1);
}
return data[top];
}
int depth(){
return top + 1;
}
bool search(const T &element){
if(depth() == 0) return false;
for(int i = bottom; i <= top; i++) {
if(data[i] == element) return true;
}
return false;
}
void clear(){
top = -1;
}
private:
int top;
T *data;
};