Uh.
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
19 template <class T> class CStack
22 size_t m_AllocatedSize;
25 friend class iterator;
31 iterator(CStack<T> *pParent, size_t id) : m_pParent(pParent), m_Index(id)
35 iterator(CStack<T> *pParent) : m_pParent(pParent), m_Index(0)
39 iterator() : m_pParent(NULL), m_Index(0)
45 return m_pParent->m_Elements[m_Index];
47 const T &operator *() const
49 return m_pParent->m_Elements[m_Index];
54 return m_pParent->m_Elements + m_Index;
57 const T * operator->() const
59 return m_pParent->m_Elements + m_Index;
62 iterator & operator++() // preincrement
68 iterator operator++(int) // postincrement
75 iterator & operator--() // predecrement
81 iterator operator--(int) // postdecrememnt
88 bool operator==(const iterator & right) const
90 return (m_pParent == right.m_pParent && m_Index == right.m_Index);
93 bool operator!=(const iterator & right) const
95 return !(*this == right);
98 CStack() : m_Elements(new T[SH_STACK_DEFAULT_SIZE]),
99 m_AllocatedSize(SH_STACK_DEFAULT_SIZE),
103 CStack(size_t size) : m_Elements(new T[size]),
104 m_AllocatedSize(size),
109 CStack(const CStack &other) : m_Elements(NULL),
113 reserve(other.m_AllocatedSize);
114 m_UsedSize = other.m_UsedSize;
115 for (size_t i = 0; i < m_UsedSize; ++i)
116 m_Elements[i] = other.m_Elements[i];
122 delete [] m_Elements;
125 void operator=(const CStack &other)
127 if (m_AllocatedSize < other.m_AllocatedSize)
130 delete [] m_Elements;
131 m_Elements = new T[other.m_AllocatedSize];
132 m_AllocatedSize = other.m_AllocatedSize;
134 m_UsedSize = other.m_UsedSize;
135 for (size_t i = 0; i < m_UsedSize; ++i)
136 m_Elements[i] = other.m_Elements[i];
139 bool push(const T &val)
141 if (m_UsedSize + 1 == m_AllocatedSize)
143 // zOHNOES! REALLOCATE!
144 m_AllocatedSize *= 2;
145 T *newElements = new T[m_AllocatedSize];
148 m_AllocatedSize /= 2;
153 for (size_t i = 0; i < m_UsedSize; ++i)
154 newElements[i] = m_Elements[i];
155 delete [] m_Elements;
157 m_Elements = newElements;
159 m_Elements[m_UsedSize++] = val;
169 return m_Elements[m_UsedSize - 1];
172 const T &front() const
174 return m_Elements[m_UsedSize - 1];
179 return m_Elements[m_UsedSize - 2];
182 const T &second() const
184 return m_Elements[m_UsedSize - 2];
189 return iterator(this, 0);
193 return iterator(this, m_UsedSize);
202 return m_AllocatedSize;
206 return m_UsedSize == 0 ? true : false;
208 bool reserve(size_t size)
210 if (size > m_AllocatedSize)
212 T *newElements = new T[size];
217 for (size_t i = 0; i < m_UsedSize; ++i)
218 newElements[i] = m_Elements[i];
219 delete [] m_Elements;
221 m_Elements = newElements;
222 m_AllocatedSize = size;
227 }; //namespace SourceHook