|
pavolmarko@128
|
1 |
/* ======== SourceMM ======== |
|
ds@294
|
2 |
* Copyright (C) 2004-2007 Metamod:Source Development Team |
|
ds@294
|
3 |
* No warranties of any kind |
|
ds@294
|
4 |
* |
|
ds@294
|
5 |
* License: zlib/libpng |
|
ds@294
|
6 |
* |
|
ds@294
|
7 |
* Author(s): Pavol "PM OnoTo" Marko |
|
ds@294
|
8 |
* ============================ |
|
ds@294
|
9 |
*/ |
|
pavolmarko@128
|
10 |
|
|
pavolmarko@128
|
11 |
#ifndef __SH_STACK_H__ |
|
pavolmarko@128
|
12 |
#define __SH_STACK_H__ |
|
pavolmarko@128
|
13 |
|
|
dvander@264
|
14 |
#include <stddef.h> |
|
dvander@264
|
15 |
|
|
pavolmarko@128
|
16 |
#define SH_STACK_DEFAULT_SIZE 4 |
|
pavolmarko@128
|
17 |
|
|
pavolmarko@128
|
18 |
namespace SourceHook |
|
pavolmarko@128
|
19 |
{ |
|
pavolmarko@128
|
20 |
// Vector |
|
pavolmarko@128
|
21 |
template <class T> class CStack |
|
pavolmarko@128
|
22 |
{ |
|
pavolmarko@128
|
23 |
T *m_Elements; |
|
pavolmarko@128
|
24 |
size_t m_AllocatedSize; |
|
pavolmarko@128
|
25 |
size_t m_UsedSize; |
|
pavolmarko@128
|
26 |
public: |
|
pavolmarko@128
|
27 |
friend class iterator; |
|
pavolmarko@128
|
28 |
class iterator |
|
pavolmarko@128
|
29 |
{ |
|
pavolmarko@128
|
30 |
CStack<T> *m_pParent; |
|
pavolmarko@128
|
31 |
size_t m_Index; |
|
pavolmarko@128
|
32 |
public: |
|
pavolmarko@128
|
33 |
iterator(CStack<T> *pParent, size_t id) : m_pParent(pParent), m_Index(id) |
|
pavolmarko@128
|
34 |
{ |
|
pavolmarko@128
|
35 |
} |
|
pavolmarko@128
|
36 |
|
|
pavolmarko@128
|
37 |
iterator(CStack<T> *pParent) : m_pParent(pParent), m_Index(0) |
|
pavolmarko@128
|
38 |
{ |
|
pavolmarko@128
|
39 |
} |
|
pavolmarko@128
|
40 |
|
|
pavolmarko@128
|
41 |
iterator() : m_pParent(NULL), m_Index(0) |
|
pavolmarko@128
|
42 |
{ |
|
pavolmarko@128
|
43 |
} |
|
pavolmarko@128
|
44 |
|
|
pavolmarko@128
|
45 |
T &operator *() |
|
pavolmarko@128
|
46 |
{ |
|
pavolmarko@128
|
47 |
return m_pParent->m_Elements[m_Index]; |
|
pavolmarko@128
|
48 |
} |
|
pavolmarko@128
|
49 |
const T &operator *() const |
|
pavolmarko@128
|
50 |
{ |
|
pavolmarko@128
|
51 |
return m_pParent->m_Elements[m_Index]; |
|
pavolmarko@128
|
52 |
} |
|
pavolmarko@128
|
53 |
|
|
pavolmarko@128
|
54 |
T * operator->() |
|
pavolmarko@128
|
55 |
{ |
|
pavolmarko@128
|
56 |
return m_pParent->m_Elements + m_Index; |
|
pavolmarko@128
|
57 |
} |
|
pavolmarko@128
|
58 |
|
|
pavolmarko@128
|
59 |
const T * operator->() const |
|
pavolmarko@128
|
60 |
{ |
|
pavolmarko@128
|
61 |
return m_pParent->m_Elements + m_Index; |
|
pavolmarko@128
|
62 |
} |
|
pavolmarko@128
|
63 |
|
|
pavolmarko@128
|
64 |
iterator & operator++() // preincrement |
|
pavolmarko@128
|
65 |
{ |
|
pavolmarko@128
|
66 |
++m_Index; |
|
pavolmarko@128
|
67 |
return (*this); |
|
pavolmarko@128
|
68 |
} |
|
pavolmarko@128
|
69 |
|
|
pavolmarko@128
|
70 |
iterator operator++(int) // postincrement |
|
pavolmarko@128
|
71 |
{ |
|
pavolmarko@128
|
72 |
iterator tmp = *this; |
|
pavolmarko@129
|
73 |
++m_Index; |
|
pavolmarko@128
|
74 |
return tmp; |
|
pavolmarko@128
|
75 |
} |
|
pavolmarko@128
|
76 |
|
|
pavolmarko@128
|
77 |
iterator & operator--() // predecrement |
|
pavolmarko@128
|
78 |
{ |
|
pavolmarko@128
|
79 |
--m_Index; |
|
pavolmarko@128
|
80 |
return (*this); |
|
pavolmarko@128
|
81 |
} |
|
pavolmarko@128
|
82 |
|
|
pavolmarko@128
|
83 |
iterator operator--(int) // postdecrememnt |
|
pavolmarko@128
|
84 |
{ |
|
pavolmarko@128
|
85 |
iterator tmp = *this; |
|
pavolmarko@129
|
86 |
--m_Index; |
|
pavolmarko@128
|
87 |
return tmp; |
|
pavolmarko@128
|
88 |
} |
|
pavolmarko@128
|
89 |
|
|
pavolmarko@128
|
90 |
bool operator==(const iterator & right) const |
|
pavolmarko@128
|
91 |
{ |
|
pavolmarko@128
|
92 |
return (m_pParent == right.m_pParent && m_Index == right.m_Index); |
|
pavolmarko@128
|
93 |
} |
|
pavolmarko@128
|
94 |
|
|
pavolmarko@128
|
95 |
bool operator!=(const iterator & right) const |
|
pavolmarko@128
|
96 |
{ |
|
pavolmarko@128
|
97 |
return !(*this == right); |
|
pavolmarko@128
|
98 |
} |
|
pavolmarko@128
|
99 |
}; |
|
pavolmarko@128
|
100 |
CStack() : m_Elements(new T[SH_STACK_DEFAULT_SIZE]), |
|
pavolmarko@128
|
101 |
m_AllocatedSize(SH_STACK_DEFAULT_SIZE), |
|
pavolmarko@128
|
102 |
m_UsedSize(0) |
|
pavolmarko@128
|
103 |
{ |
|
pavolmarko@128
|
104 |
} |
|
pavolmarko@128
|
105 |
CStack(size_t size) : m_Elements(new T[size]), |
|
pavolmarko@128
|
106 |
m_AllocatedSize(size), |
|
pavolmarko@128
|
107 |
m_UsedSize(0) |
|
pavolmarko@128
|
108 |
{ |
|
pavolmarko@128
|
109 |
} |
|
pavolmarko@128
|
110 |
|
|
pavolmarko@129
|
111 |
CStack(const CStack &other) : m_Elements(NULL), |
|
pavolmarko@129
|
112 |
m_AllocatedSize(0), |
|
pavolmarko@129
|
113 |
m_UsedSize(0) |
|
pavolmarko@129
|
114 |
{ |
|
pavolmarko@133
|
115 |
reserve(other.m_AllocatedSize); |
|
pavolmarko@129
|
116 |
m_UsedSize = other.m_UsedSize; |
|
pavolmarko@129
|
117 |
for (size_t i = 0; i < m_UsedSize; ++i) |
|
pavolmarko@129
|
118 |
m_Elements[i] = other.m_Elements[i]; |
|
pavolmarko@129
|
119 |
} |
|
pavolmarko@129
|
120 |
|
|
pavolmarko@128
|
121 |
~CStack() |
|
pavolmarko@128
|
122 |
{ |
|
pavolmarko@128
|
123 |
if (m_Elements) |
|
pavolmarko@128
|
124 |
delete [] m_Elements; |
|
pavolmarko@128
|
125 |
} |
|
pavolmarko@128
|
126 |
|
|
pavolmarko@129
|
127 |
void operator=(const CStack &other) |
|
pavolmarko@129
|
128 |
{ |
|
pavolmarko@129
|
129 |
if (m_AllocatedSize < other.m_AllocatedSize) |
|
pavolmarko@129
|
130 |
{ |
|
pavolmarko@129
|
131 |
if (m_Elements) |
|
pavolmarko@129
|
132 |
delete [] m_Elements; |
|
pavolmarko@129
|
133 |
m_Elements = new T[other.m_AllocatedSize]; |
|
pavolmarko@129
|
134 |
m_AllocatedSize = other.m_AllocatedSize; |
|
pavolmarko@129
|
135 |
} |
|
pavolmarko@129
|
136 |
m_UsedSize = other.m_UsedSize; |
|
pavolmarko@129
|
137 |
for (size_t i = 0; i < m_UsedSize; ++i) |
|
pavolmarko@129
|
138 |
m_Elements[i] = other.m_Elements[i]; |
|
pavolmarko@129
|
139 |
} |
|
pavolmarko@129
|
140 |
|
|
pavolmarko@128
|
141 |
bool push(const T &val) |
|
pavolmarko@128
|
142 |
{ |
|
pavolmarko@128
|
143 |
if (m_UsedSize + 1 == m_AllocatedSize) |
|
pavolmarko@128
|
144 |
{ |
|
pavolmarko@128
|
145 |
// zOHNOES! REALLOCATE! |
|
pavolmarko@128
|
146 |
m_AllocatedSize *= 2; |
|
pavolmarko@128
|
147 |
T *newElements = new T[m_AllocatedSize]; |
|
pavolmarko@128
|
148 |
if (!newElements) |
|
pavolmarko@128
|
149 |
{ |
|
pavolmarko@128
|
150 |
m_AllocatedSize /= 2; |
|
pavolmarko@128
|
151 |
return false; |
|
pavolmarko@128
|
152 |
} |
|
pavolmarko@129
|
153 |
if (m_Elements) |
|
pavolmarko@129
|
154 |
{ |
|
pavolmarko@129
|
155 |
for (size_t i = 0; i < m_UsedSize; ++i) |
|
pavolmarko@129
|
156 |
newElements[i] = m_Elements[i]; |
|
pavolmarko@129
|
157 |
delete [] m_Elements; |
|
pavolmarko@129
|
158 |
} |
|
pavolmarko@128
|
159 |
m_Elements = newElements; |
|
pavolmarko@128
|
160 |
} |
|
pavolmarko@128
|
161 |
m_Elements[m_UsedSize++] = val; |
|
pavolmarko@128
|
162 |
return true; |
|
pavolmarko@128
|
163 |
} |
|
dvander@252
|
164 |
|
|
pavolmarko@128
|
165 |
void pop() |
|
pavolmarko@128
|
166 |
{ |
|
pavolmarko@128
|
167 |
--m_UsedSize; |
|
pavolmarko@128
|
168 |
} |
|
pavolmarko@128
|
169 |
|
|
dvander@252
|
170 |
void popall() |
|
dvander@252
|
171 |
{ |
|
dvander@252
|
172 |
m_UsedSize = 0; |
|
dvander@252
|
173 |
} |
|
dvander@252
|
174 |
|
|
pavolmarko@128
|
175 |
T &front() |
|
pavolmarko@128
|
176 |
{ |
|
pavolmarko@128
|
177 |
return m_Elements[m_UsedSize - 1]; |
|
pavolmarko@128
|
178 |
} |
|
pavolmarko@128
|
179 |
|
|
pavolmarko@128
|
180 |
const T &front() const |
|
pavolmarko@128
|
181 |
{ |
|
pavolmarko@128
|
182 |
return m_Elements[m_UsedSize - 1]; |
|
pavolmarko@128
|
183 |
} |
|
pavolmarko@128
|
184 |
|
|
pavolmarko@162
|
185 |
T &second() |
|
pavolmarko@162
|
186 |
{ |
|
pavolmarko@162
|
187 |
return m_Elements[m_UsedSize - 2]; |
|
pavolmarko@162
|
188 |
} |
|
pavolmarko@162
|
189 |
|
|
pavolmarko@162
|
190 |
const T &second() const |
|
pavolmarko@162
|
191 |
{ |
|
pavolmarko@162
|
192 |
return m_Elements[m_UsedSize - 2]; |
|
pavolmarko@162
|
193 |
} |
|
pavolmarko@162
|
194 |
|
|
pavolmarko@128
|
195 |
iterator begin() |
|
pavolmarko@128
|
196 |
{ |
|
pavolmarko@128
|
197 |
return iterator(this, 0); |
|
pavolmarko@128
|
198 |
} |
|
pavolmarko@128
|
199 |
iterator end() |
|
pavolmarko@128
|
200 |
{ |
|
pavolmarko@128
|
201 |
return iterator(this, m_UsedSize); |
|
pavolmarko@128
|
202 |
} |
|
pavolmarko@129
|
203 |
|
|
pavolmarko@129
|
204 |
size_t size() |
|
pavolmarko@129
|
205 |
{ |
|
pavolmarko@129
|
206 |
return m_UsedSize; |
|
pavolmarko@129
|
207 |
} |
|
pavolmarko@129
|
208 |
size_t capacity() |
|
pavolmarko@129
|
209 |
{ |
|
pavolmarko@129
|
210 |
return m_AllocatedSize; |
|
pavolmarko@129
|
211 |
} |
|
pavolmarko@129
|
212 |
bool empty() |
|
pavolmarko@129
|
213 |
{ |
|
pavolmarko@129
|
214 |
return m_UsedSize == 0 ? true : false; |
|
pavolmarko@129
|
215 |
} |
|
pavolmarko@129
|
216 |
bool reserve(size_t size) |
|
pavolmarko@129
|
217 |
{ |
|
pavolmarko@129
|
218 |
if (size > m_AllocatedSize) |
|
pavolmarko@129
|
219 |
{ |
|
pavolmarko@129
|
220 |
T *newElements = new T[size]; |
|
pavolmarko@129
|
221 |
if (!newElements) |
|
pavolmarko@129
|
222 |
return false; |
|
pavolmarko@129
|
223 |
if (m_Elements) |
|
pavolmarko@129
|
224 |
{ |
|
pavolmarko@129
|
225 |
for (size_t i = 0; i < m_UsedSize; ++i) |
|
pavolmarko@129
|
226 |
newElements[i] = m_Elements[i]; |
|
pavolmarko@129
|
227 |
delete [] m_Elements; |
|
pavolmarko@129
|
228 |
} |
|
pavolmarko@129
|
229 |
m_Elements = newElements; |
|
pavolmarko@129
|
230 |
m_AllocatedSize = size; |
|
pavolmarko@129
|
231 |
} |
|
pavolmarko@129
|
232 |
return true; |
|
pavolmarko@129
|
233 |
} |
|
pavolmarko@128
|
234 |
}; |
|
pavolmarko@128
|
235 |
}; //namespace SourceHook |
|
pavolmarko@128
|
236 |
|
|
pavolmarko@128
|
237 |
#endif |