1 /* ======== SourceMM ========
2 * Copyright (C) 2004-2005 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__
14 #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),
106 CStack(size_t size) : m_Elements(new T[size]),
107 m_AllocatedSize(size),
113 CStack(const CStack &other) : m_Elements(NULL),
117 assert(reserve(other.m_AllocatedSize) && m_Elements);
118 m_UsedSize = other.m_UsedSize;
119 for (size_t i = 0; i < m_UsedSize; ++i)
120 m_Elements[i] = other.m_Elements[i];
126 delete [] m_Elements;
129 void operator=(const CStack &other)
131 if (m_AllocatedSize < other.m_AllocatedSize)
134 delete [] m_Elements;
135 m_Elements = new T[other.m_AllocatedSize];
137 m_AllocatedSize = other.m_AllocatedSize;
139 m_UsedSize = other.m_UsedSize;
140 for (size_t i = 0; i < m_UsedSize; ++i)
141 m_Elements[i] = other.m_Elements[i];
144 bool push(const T &val)
146 if (m_UsedSize + 1 == m_AllocatedSize)
148 // zOHNOES! REALLOCATE!
149 m_AllocatedSize *= 2;
150 T *newElements = new T[m_AllocatedSize];
153 m_AllocatedSize /= 2;
158 for (size_t i = 0; i < m_UsedSize; ++i)
159 newElements[i] = m_Elements[i];
160 delete [] m_Elements;
162 m_Elements = newElements;
164 m_Elements[m_UsedSize++] = val;
174 return m_Elements[m_UsedSize - 1];
177 const T &front() const
179 return m_Elements[m_UsedSize - 1];
184 return iterator(this, 0);
188 return iterator(this, m_UsedSize);
197 return m_AllocatedSize;
201 return m_UsedSize == 0 ? true : false;
203 bool reserve(size_t size)
205 if (size > m_AllocatedSize)
207 T *newElements = new T[size];
212 for (size_t i = 0; i < m_UsedSize; ++i)
213 newElements[i] = m_Elements[i];
214 delete [] m_Elements;
216 m_Elements = newElements;
217 m_AllocatedSize = size;
222 }; //namespace SourceHook