Triggering build... again.
1 /* ======== SourceMM ========
2 * Copyright (C) 2004-2008 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
22 bool Grow(size_t amount)
25 size_t newSize = m_Size * 2;
32 while (m_CurrentUsedSize + amount > newSize)
37 T *newData = new T[newSize];
41 for (size_t i=0; i<m_CurrentUsedSize; i++)
43 newData[i] = m_Data[i];
55 bool GrowIfNeeded(size_t amount)
57 if (m_CurrentUsedSize + amount >= m_Size)
67 bool ChangeSize(size_t size)
86 T *newData = new T[size];
90 size_t end = (m_CurrentUsedSize < size) ? (m_CurrentUsedSize) : size;
91 for (size_t i=0; i<end; i++)
93 newData[i] = m_Data[i];
101 if (m_CurrentUsedSize > m_Size)
103 m_CurrentUsedSize = m_Size;
109 void FreeMemIfPossible()
116 if (!m_CurrentUsedSize)
122 size_t newSize = m_Size;
123 while (m_CurrentUsedSize <= newSize / 2)
128 if (newSize != m_Size)
136 size_t m_CurrentUsedSize;
143 // constructors / destructors
160 const T * base() const
176 iterator & operator++() // preincrement
182 iterator operator++(int) // postincrement
184 iterator tmp = *this;
189 iterator & operator--() // predecrement
195 iterator operator--(int) // postdecrememnt
197 iterator tmp = *this;
202 bool operator==(T * right) const
204 return (m_Ptr == right);
207 bool operator==(const iterator & right) const
209 return (m_Ptr == right.m_Ptr);
212 bool operator!=(T * right) const
214 return (m_Ptr != right);
217 bool operator!=(const iterator & right) const
219 return (m_Ptr != right.m_Ptr);
222 iterator & operator+=(size_t offset)
228 iterator & operator-=(size_t offset)
234 iterator operator+(size_t offset) const
241 iterator operator-(size_t offset) const
248 T & operator[](size_t offset)
250 return (*(*this + offset));
253 const T & operator[](size_t offset) const
255 return (*(*this + offset));
258 bool operator<(const iterator & right) const
260 return m_Ptr < right.m_Ptr;
263 bool operator>(const iterator & right) const
265 return m_Ptr > right.m_Ptr;
268 bool operator<=(const iterator & right) const
270 return m_Ptr <= right.m_Ptr;
273 bool operator>=(const iterator & right) const
275 return m_Ptr >= right.m_Ptr;
278 size_t operator-(const iterator & right) const
280 return m_Ptr - right.m_Ptr;
284 // constructors / destructors
288 m_CurrentUsedSize = 0;
292 CVector<T>(const CVector<T> & other)
295 m_Data = new T [other.m_CurrentUsedSize];
296 m_Size = other.m_CurrentUsedSize;
297 m_CurrentUsedSize = other.m_CurrentUsedSize;
298 for (size_t i=0; i<other.m_CurrentUsedSize; i++)
299 m_Data[i] = other.m_Data[i];
307 CVector & operator =(const CVector<T> & other)
310 ChangeSize(other.size());
311 m_CurrentUsedSize = other.size();
312 for (size_t i=0; i<other.size(); i++)
313 m_Data[i] = other.at(i);
320 return m_CurrentUsedSize;
323 size_t capacity() const
328 iterator begin() const
330 return iterator(m_Data);
335 return iterator(m_Data + m_CurrentUsedSize);
338 iterator iterAt(size_t pos)
340 if (pos > m_CurrentUsedSize)
342 return iterator(m_Data + pos);
345 bool reserve(size_t newSize)
347 if (newSize > m_Size)
348 return ChangeSize(newSize);
352 bool push_back(const T & elem)
354 if (!GrowIfNeeded(1))
359 m_Data[m_CurrentUsedSize++] = elem;
367 if (m_CurrentUsedSize < 0)
368 m_CurrentUsedSize = 0;
373 bool resize(size_t newSize)
375 return resize(newSize, T());
378 bool resize(size_t newSize, T defval)
380 if (!ChangeSize(newSize))
382 for (size_t i = m_CurrentUsedSize; i < newSize; ++i)
384 m_CurrentUsedSize = newSize;
390 return (m_CurrentUsedSize == 0);
395 if (pos > m_CurrentUsedSize)
402 const T & at(size_t pos) const
404 if (pos > m_CurrentUsedSize)
411 T & operator[](size_t pos)
416 const T & operator[](size_t pos) const
423 if (m_CurrentUsedSize < 1)
430 const T & front() const
432 if (m_CurrentUsedSize < 1)
441 if (m_CurrentUsedSize < 1)
445 return m_Data[m_CurrentUsedSize - 1];
448 const T & back() const
450 if (m_CurrentUsedSize < 1)
454 return m_Data[m_CurrentUsedSize - 1];
457 iterator insert(iterator where, const T & value)
460 if (where < m_Data || where > (m_Data + m_CurrentUsedSize))
463 size_t ofs = where - begin();
465 if (!GrowIfNeeded(1))
472 where = begin() + ofs;
474 // Move subsequent entries
475 for (T *ptr = m_Data + m_CurrentUsedSize - 2; ptr >= where.base(); --ptr)
478 *where.base() = value;
483 iterator erase(iterator where)
486 if (where < m_Data || where >= (m_Data + m_CurrentUsedSize))
489 size_t ofs = where - begin();
491 if (m_CurrentUsedSize > 1)
494 T *theend = m_Data + m_CurrentUsedSize;
495 for (T *ptr = where.base() + 1; ptr < theend; ++ptr)
503 return begin() + ofs;
509 m_CurrentUsedSize = 0;
517 }; //namespace SourceHook
519 #endif // __CVECTOR_H__