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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
|
/*****************************************************************************/
/* */
/* STACK.H */
/* */
/* (C) 1993,94 Ullrich von Bassewitz */
/* Zwehrenbuehlstrasse 33 */
/* D-72070 Tuebingen */
/* EMail: uz@ibb.schwaben.com */
/* */
/*****************************************************************************/
// $Id$
//
// $Log$
//
//
#ifndef __STACK_H
#define __STACK_H
#include <limits.h>
#include "machine.h"
#include "object.h"
#include "strmable.h"
#include "stream.h"
/*****************************************************************************/
/* template class Stack */
/*****************************************************************************/
template <class T>
class Stack : public Streamable {
protected:
T *Data;
u16 SP;
u16 Limit;
protected:
virtual void PutItem (Stream &S, T Item) const; // Not defined
virtual T GetItem (Stream &S); // Not defined
virtual void FreeItem (T Item);
public:
Stack (u16 Size);
Stack (StreamableInit);
virtual ~Stack ();
// Derived from class Streamable
virtual void Load (Stream&);
virtual void Store (Stream&) const;
static Streamable* Build ();
// New member functions
int IsEmpty ();
void Push (T);
T Pop ();
T Peek ();
void Drop ();
void Swap ();
};
template <class T>
Stack<T>::Stack (u16 Size) :
SP (0), Limit (Size)
{
// Allocate memory
Data = new T [Limit];
}
template <class T>
inline Stack<T>::Stack (StreamableInit)
{
}
template <class T>
Stack<T>::~Stack ()
{
// Free remaining items
while (SP--) {
FreeItem (Data [SP]);
}
// Free the array
delete [] Data;
}
template <class T>
void Stack<T>::Load (Stream& S)
{
// Read data
S >> SP >> Limit;
// Allocate memory
Data = new T [Limit];
// Now read the items
u16 I = SP;
while (I--) {
Data [I] = GetItem (S);
}
}
template <class T>
void Stack<T>::Store (Stream& S) const
{
// Store data
S << SP << Limit;
// Store the items
u16 I = SP;
while (I--) {
PutItem (S, Data [I]);
}
}
template <class T>
T Stack<T>::GetItem (Stream&)
{
ABSTRACT ();
return * (T *) NULL;
}
template <class T>
void Stack<T>::PutItem (Stream&, T) const
{
ABSTRACT ();
}
template <class T>
inline void Stack<T>::FreeItem (T)
{
// Default is to do nothing
}
template <class T>
inline Streamable * Stack<T>::Build ()
{
return new Stack<T> (Empty);
}
template <class T>
inline int Stack<T>::IsEmpty ()
{
return (SP == 0);
}
template <class T>
void Stack<T>::Push (T O)
{
// Check for overflow
CHECK (SP < Limit);
// Push the item
Data [SP++] = O;
}
template <class T>
T Stack<T>::Pop ()
{
// There must be at least one element
CHECK (SP >= 1);
// Pop an element
return Data [--SP];
}
template <class T>
T Stack<T>::Peek ()
{
// There must be at least one element
CHECK (SP >= 1);
// Pop an element
return Data [SP-1];
}
template <class T>
void Stack<T>::Drop ()
{
// There must be at least one element
CHECK (SP >= 1);
// Drop the last element
FreeItem (Data [--SP]);
}
template <class T>
void Stack<T>::Swap ()
{
// Swap needs two elements at least
CHECK (SP >= 2);
// Swap the elements
T Tmp = Data [SP-1];
Data [SP-1] = Data [SP-2];
Data [SP-2] = Tmp;
}
// End of STACK.H
#endif
|
