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 * ============================
16 //This file originally from AMX Mod X
20 template <class T> class CVector
25 size_t newSize = m_Size * 2;
27 newSize = 8; // a good init value
28 T *newData = new T[newSize];
33 for (size_t i=0; i<m_CurrentUsedSize; i++)
34 newData[i] = m_Data[i];
44 if (m_CurrentUsedSize >= m_Size)
50 bool ChangeSize(size_t size)
67 T *newData = new T[size];
72 size_t end = (m_CurrentUsedSize < size) ? (m_CurrentUsedSize) : size;
73 for (size_t i=0; i<end; i++)
74 newData[i] = m_Data[i];
79 if (m_CurrentUsedSize > m_Size)
80 m_CurrentUsedSize = m_Size;
85 void FreeMemIfPossible()
90 if (!m_CurrentUsedSize)
96 size_t newSize = m_Size;
97 while (m_CurrentUsedSize <= newSize / 2)
100 if (newSize != m_Size)
106 size_t m_CurrentUsedSize;
113 // constructors / destructors
130 const T * base() const
146 iterator & operator++() // preincrement
152 iterator operator++(int) // postincrement
154 iterator tmp = *this;
159 iterator & operator--() // predecrement
165 iterator operator--(int) // postdecrememnt
167 iterator tmp = *this;
172 bool operator==(T * right) const
174 return (m_Ptr == right);
177 bool operator==(const iterator & right) const
179 return (m_Ptr == right.m_Ptr);
182 bool operator!=(T * right) const
184 return (m_Ptr != right);
187 bool operator!=(const iterator & right) const
189 return (m_Ptr != right.m_Ptr);
192 iterator & operator+=(size_t offset)
198 iterator & operator-=(size_t offset)
204 iterator operator+(size_t offset) const
211 iterator operator-(size_t offset) const
218 T & operator[](size_t offset)
220 return (*(*this + offset));
223 const T & operator[](size_t offset) const
225 return (*(*this + offset));
228 bool operator<(const iterator & right) const
230 return m_Ptr < right.m_Ptr;
233 bool operator>(const iterator & right) const
235 return m_Ptr > right.m_Ptr;
238 bool operator<=(const iterator & right) const
240 return m_Ptr <= right.m_Ptr;
243 bool operator>=(const iterator & right) const
245 return m_Ptr >= right.m_Ptr;
248 size_t operator-(const iterator & right) const
250 return m_Ptr - right.m_Ptr;
254 // constructors / destructors
258 m_CurrentUsedSize = 0;
262 CVector<T>(const CVector<T> & other)
265 m_Data = new T [other.m_CurrentUsedSize];
266 m_Size = other.m_CurrentUsedSize;
267 m_CurrentUsedSize = other.m_CurrentUsedSize;
268 for (size_t i=0; i<other.m_CurrentUsedSize; i++)
269 m_Data[i] = other.m_Data[i];
277 CVector & operator =(const CVector<T> & other)
280 ChangeSize(other.size());
281 m_CurrentUsedSize = other.size();
282 for (size_t i=0; i<other.size(); i++)
283 m_Data[i] = other.at(i);
290 return m_CurrentUsedSize;
293 size_t capacity() const
298 iterator begin() const
300 return iterator(m_Data);
305 return iterator(m_Data + m_CurrentUsedSize);
308 iterator iterAt(size_t pos)
310 if (pos > m_CurrentUsedSize)
312 return iterator(m_Data + pos);
315 bool reserve(size_t newSize)
317 if (newSize > m_Size)
318 return ChangeSize(newSize);
322 bool push_back(const T & elem)
331 m_Data[m_CurrentUsedSize - 1] = elem;
338 if (m_CurrentUsedSize < 0)
339 m_CurrentUsedSize = 0;
344 bool resize(size_t newSize)
346 return resize(newSize, T());
349 bool resize(size_t newSize, T defval)
351 if (!ChangeSize(newSize))
353 for (size_t i = m_CurrentUsedSize; i < newSize; ++i)
355 m_CurrentUsedSize = newSize;
361 return (m_CurrentUsedSize == 0);
366 if (pos > m_CurrentUsedSize)
373 const T & at(size_t pos) const
375 if (pos > m_CurrentUsedSize)
382 T & operator[](size_t pos)
387 const T & operator[](size_t pos) const
394 if (m_CurrentUsedSize < 1)
401 const T & front() const
403 if (m_CurrentUsedSize < 1)
412 if (m_CurrentUsedSize < 1)
416 return m_Data[m_CurrentUsedSize - 1];
419 const T & back() const
421 if (m_CurrentUsedSize < 1)
425 return m_Data[m_CurrentUsedSize - 1];
428 iterator insert(iterator where, const T & value)
431 if (where < m_Data || where > (m_Data + m_CurrentUsedSize))
434 size_t ofs = where - begin();
443 where = begin() + ofs;
445 // Move subsequent entries
446 for (T *ptr = m_Data + m_CurrentUsedSize - 2; ptr >= where.base(); --ptr)
449 *where.base() = value;
454 iterator erase(iterator where)
457 if (where < m_Data || where >= (m_Data + m_CurrentUsedSize))
460 size_t ofs = where - begin();
462 if (m_CurrentUsedSize > 1)
465 T *theend = m_Data + m_CurrentUsedSize;
466 for (T *ptr = where.base() + 1; ptr < theend; ++ptr)
474 return begin() + ofs;
480 m_CurrentUsedSize = 0;
488 }; //namespace SourceHook
490 #endif // __CVECTOR_H__