This repository has been archived by the owner on Oct 1, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 91
/
Copy pathadvi3pp_stack.h
79 lines (66 loc) · 1.88 KB
/
advi3pp_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
74
75
76
77
78
79
/**
* Marlin 3D Printer Firmware For Wanhao Duplicator i3 Plus (ADVi3++)
*
* Copyright (C) 2017-2019 Sebastien Andrivet [https://github.com/andrivet/]
*
* 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 <http://www.gnu.org/licenses/>.
*
*/
#ifndef ADV_I3_PLUS_PLUS_STACK_H
#define ADV_I3_PLUS_PLUS_STACK_H
#include <stddef.h>
#include "advi3pp_log.h"
namespace advi3pp {
// --------------------------------------------------------------------
// Stack - Simple Stack
// --------------------------------------------------------------------
template<typename T, size_t S>
struct Stack
{
void push(T e);
T pop();
bool is_empty() const;
bool contains(T e) const;
private:
T elements_[S];
size_t top_ = 0;
};
template<typename T, size_t S>
void Stack<T, S>::push(T e)
{
assert(top_ <= S);
elements_[top_++] = e;
}
template<typename T, size_t S>
T Stack<T, S>::pop()
{
assert(!is_empty());
return elements_[--top_];
}
template<typename T, size_t S>
bool Stack<T, S>::is_empty() const
{
return top_ == 0;
}
template<typename T, size_t S>
bool Stack<T, S>::contains(T e) const
{
for(size_t i = 0; i < top_; ++i)
if(elements_[top_ - i - 1] == e)
return true;
return false;
}
// --------------------------------------------------------------------
}
#endif //ADV_I3_PLUS_PLUS_STACK_H