1 /* ======== SourceMM ========
2 * Copyright (C) 2004-2007 Metamod:Source Development Team
3 * No warranties of any kind
7 * Author(s): Pavol "PM OnoTo" Marko
8 * ============================
11 #ifndef __SH_STACK_H__
12 #define __SH_STACK_H__
16 #define SH_STACK_DEFAULT_SIZE 4
21 template <class T> class CStack
24 size_t m_AllocatedSize;
27 friend class iterator;
33 iterator(CStack<T> *pParent, size_t id) : m_pParent(pParent), m_Index(id)
37 iterator(CStack<T> *pParent) : m_pParent(pParent), m_Index(0)
41 iterator() : m_pParent(NULL), m_Index(0)
47 return m_pParent->m_Elements[m_Index];
49 const T &operator *() const
51 return m_pParent->m_Elements[m_Index];
56 return m_pParent->m_Elements + m_Index;
59 const T * operator->() const
61 return m_pParent->m_Elements + m_Index;
64 iterator & operator++() // preincrement
70 iterator operator++(int) // postincrement
77 iterator & operator--() // predecrement
83 iterator operator--(int) // postdecrememnt
90 bool operator==(const iterator & right) const
92 return (m_pParent == right.m_pParent && m_Index == right.m_Index);
95 bool operator!=(const iterator & right) const
97 return !(*this == right);
100 CStack() : m_Elements(new T[SH_STACK_DEFAULT_SIZE]),
101 m_AllocatedSize(SH_STACK_DEFAULT_SIZE),
105 CStack(size_t size) : m_Elements(new T[size]),
106 m_AllocatedSize(size),
111 CStack(const CStack &other) : m_Elements(NULL),
115 reserve(other.m_AllocatedSize);
116 m_UsedSize = other.m_UsedSize;
117 for (size_t i = 0; i < m_UsedSize; ++i)
118 m_Elements[i] = other.m_Elements[i];
124 delete [] m_Elements;
127 void operator=(const CStack &other)
129 if (m_AllocatedSize < other.m_AllocatedSize)
132 delete [] m_Elements;
133 m_Elements = new T[other.m_AllocatedSize];
134 m_AllocatedSize = other.m_AllocatedSize;
136 m_UsedSize = other.m_UsedSize;
137 for (size_t i = 0; i < m_UsedSize; ++i)
138 m_Elements[i] = other.m_Elements[i];
141 bool push(const T &val)
143 if (m_UsedSize + 1 == m_AllocatedSize)
145 // zOHNOES! REALLOCATE!
146 m_AllocatedSize *= 2;
147 T *newElements = new T[m_AllocatedSize];
150 m_AllocatedSize /= 2;
155 for (size_t i = 0; i < m_UsedSize; ++i)
156 newElements[i] = m_Elements[i];
157 delete [] m_Elements;
159 m_Elements = newElements;
161 m_Elements[m_UsedSize++] = val;
177 return m_Elements[m_UsedSize - 1];
180 const T &front() const
182 return m_Elements[m_UsedSize - 1];
187 return m_Elements[m_UsedSize - 2];
190 const T &second() const
192 return m_Elements[m_UsedSize - 2];
197 return iterator(this, 0);
201 return iterator(this, m_UsedSize);
210 return m_AllocatedSize;
214 return m_UsedSize == 0 ? true : false;
216 bool reserve(size_t size)
218 if (size > m_AllocatedSize)
220 T *newElements = new T[size];
225 for (size_t i = 0; i < m_UsedSize; ++i)
226 newElements[i] = m_Elements[i];
227 delete [] m_Elements;
229 m_Elements = newElements;
230 m_AllocatedSize = size;
235 }; //namespace SourceHook