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
|
/*
===========================================================================
Copyright (C) 2024 the OpenMoHAA team
This file is part of OpenMoHAA source code.
OpenMoHAA source code 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 2 of the License,
or (at your option) any later version.
OpenMoHAA source code 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 OpenMoHAA source code; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
===========================================================================
*/
// stack.h: Generic Stack object.
//
#pragma once
#include "g_local.h"
#include "class.h"
template<class Type>
class StackNode : public Class
{
public:
Type data;
StackNode *next;
StackNode(Type d);
};
template<class Type>
inline StackNode<Type>::StackNode(Type d)
: data(d)
{
next = NULL;
}
template<class Type>
class Stack : public Class
{
private:
StackNode<Type> *head;
public:
Stack();
~Stack<Type>();
void Clear(void);
qboolean Empty(void);
void Push(Type data);
Type Pop(void);
};
template<class Type>
inline Stack<Type>::Stack()
{
head = NULL;
}
template<class Type>
inline Stack<Type>::~Stack()
{
Clear();
}
template<class Type>
inline void Stack<Type>::Clear(void)
{
while (!Empty()) {
Pop();
}
}
template<class Type>
inline qboolean Stack<Type>::Empty(void)
{
if (head == NULL) {
return true;
}
return false;
}
template<class Type>
inline void Stack<Type>::Push(Type data)
{
StackNode<Type> *tmp;
tmp = new StackNode<Type>(data);
if (!tmp) {
assert(NULL);
gi.Error(ERR_DROP, "Stack::Push : Out of memory");
}
tmp->next = head;
head = tmp;
}
template<class Type>
inline Type Stack<Type>::Pop(void)
{
Type ret;
StackNode<Type> *node;
if (!head) {
return NULL;
}
node = head;
ret = node->data;
head = node->next;
delete node;
return ret;
}
|
