1.1 --- a/sourcehook/sh_vector.h Thu Oct 04 19:46:28 2007 +0000
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,490 +0,0 @@
1.4 -/* ======== SourceMM ========
1.5 -* Copyright (C) 2004-2007 Metamod:Source Development Team
1.6 -* No warranties of any kind
1.7 -*
1.8 -* License: zlib/libpng
1.9 -*
1.10 -* Author(s): Pavol "PM OnoTo" Marko
1.11 -* ============================
1.12 -*/
1.13 -
1.14 -#ifndef __CVECTOR_H__
1.15 -#define __CVECTOR_H__
1.16 -
1.17 -#include <assert.h>
1.18 -
1.19 -//This file originally from AMX Mod X
1.20 -namespace SourceHook
1.21 -{
1.22 -// Vector
1.23 -template <class T> class CVector
1.24 -{
1.25 - bool Grow()
1.26 - {
1.27 - // automatic grow
1.28 - size_t newSize = m_Size * 2;
1.29 - if (newSize == 0)
1.30 - newSize = 8; // a good init value
1.31 - T *newData = new T[newSize];
1.32 - if (!newData)
1.33 - return false;
1.34 - if (m_Data)
1.35 - {
1.36 - for (size_t i=0; i<m_CurrentUsedSize; i++)
1.37 - newData[i] = m_Data[i];
1.38 - delete [] m_Data;
1.39 - }
1.40 - m_Data = newData;
1.41 - m_Size = newSize;
1.42 - return true;
1.43 - }
1.44 -
1.45 - bool GrowIfNeeded()
1.46 - {
1.47 - if (m_CurrentUsedSize >= m_Size)
1.48 - return Grow();
1.49 - else
1.50 - return true;
1.51 - }
1.52 -
1.53 - bool ChangeSize(size_t size)
1.54 - {
1.55 - // change size
1.56 - if (size == m_Size)
1.57 - return true;
1.58 -
1.59 - if (!size)
1.60 - {
1.61 - if (m_Data)
1.62 - {
1.63 - delete [] m_Data;
1.64 - m_Data = NULL;
1.65 - m_Size = 0;
1.66 - }
1.67 - return true;
1.68 - }
1.69 -
1.70 - T *newData = new T[size];
1.71 - if (!newData)
1.72 - return false;
1.73 - if (m_Data)
1.74 - {
1.75 - size_t end = (m_CurrentUsedSize < size) ? (m_CurrentUsedSize) : size;
1.76 - for (size_t i=0; i<end; i++)
1.77 - newData[i] = m_Data[i];
1.78 - delete [] m_Data;
1.79 - }
1.80 - m_Data = newData;
1.81 - m_Size = size;
1.82 - if (m_CurrentUsedSize > m_Size)
1.83 - m_CurrentUsedSize = m_Size;
1.84 -
1.85 - return true;
1.86 - }
1.87 -
1.88 - void FreeMemIfPossible()
1.89 - {
1.90 - if (!m_Data)
1.91 - return;
1.92 -
1.93 - if (!m_CurrentUsedSize)
1.94 - {
1.95 - ChangeSize(0);
1.96 - return;
1.97 - }
1.98 -
1.99 - size_t newSize = m_Size;
1.100 - while (m_CurrentUsedSize <= newSize / 2)
1.101 - newSize /= 2;
1.102 -
1.103 - if (newSize != m_Size)
1.104 - ChangeSize(newSize);
1.105 - }
1.106 -protected:
1.107 - T *m_Data;
1.108 - size_t m_Size;
1.109 - size_t m_CurrentUsedSize;
1.110 -public:
1.111 - class iterator
1.112 - {
1.113 - protected:
1.114 - T *m_Ptr;
1.115 - public:
1.116 - // constructors / destructors
1.117 - iterator()
1.118 - {
1.119 - m_Ptr = NULL;
1.120 - }
1.121 -
1.122 - iterator(T * ptr)
1.123 - {
1.124 - m_Ptr = ptr;
1.125 - }
1.126 -
1.127 - // member functions
1.128 - T * base()
1.129 - {
1.130 - return m_Ptr;
1.131 - }
1.132 -
1.133 - const T * base() const
1.134 - {
1.135 - return m_Ptr;
1.136 - }
1.137 -
1.138 - // operators
1.139 - T & operator*()
1.140 - {
1.141 - return *m_Ptr;
1.142 - }
1.143 -
1.144 - T * operator->()
1.145 - {
1.146 - return m_Ptr;
1.147 - }
1.148 -
1.149 - iterator & operator++() // preincrement
1.150 - {
1.151 - ++m_Ptr;
1.152 - return (*this);
1.153 - }
1.154 -
1.155 - iterator operator++(int) // postincrement
1.156 - {
1.157 - iterator tmp = *this;
1.158 - ++m_Ptr;
1.159 - return tmp;
1.160 - }
1.161 -
1.162 - iterator & operator--() // predecrement
1.163 - {
1.164 - --m_Ptr;
1.165 - return (*this);
1.166 - }
1.167 -
1.168 - iterator operator--(int) // postdecrememnt
1.169 - {
1.170 - iterator tmp = *this;
1.171 - --m_Ptr;
1.172 - return tmp;
1.173 - }
1.174 -
1.175 - bool operator==(T * right) const
1.176 - {
1.177 - return (m_Ptr == right);
1.178 - }
1.179 -
1.180 - bool operator==(const iterator & right) const
1.181 - {
1.182 - return (m_Ptr == right.m_Ptr);
1.183 - }
1.184 -
1.185 - bool operator!=(T * right) const
1.186 - {
1.187 - return (m_Ptr != right);
1.188 - }
1.189 -
1.190 - bool operator!=(const iterator & right) const
1.191 - {
1.192 - return (m_Ptr != right.m_Ptr);
1.193 - }
1.194 -
1.195 - iterator & operator+=(size_t offset)
1.196 - {
1.197 - m_Ptr += offset;
1.198 - return (*this);
1.199 - }
1.200 -
1.201 - iterator & operator-=(size_t offset)
1.202 - {
1.203 - m_Ptr -= offset;
1.204 - return (*this);
1.205 - }
1.206 -
1.207 - iterator operator+(size_t offset) const
1.208 - {
1.209 - iterator tmp(*this);
1.210 - tmp.m_Ptr += offset;
1.211 - return tmp;
1.212 - }
1.213 -
1.214 - iterator operator-(size_t offset) const
1.215 - {
1.216 - iterator tmp(*this);
1.217 - tmp.m_Ptr -= offset;
1.218 - return tmp;
1.219 - }
1.220 -
1.221 - T & operator[](size_t offset)
1.222 - {
1.223 - return (*(*this + offset));
1.224 - }
1.225 -
1.226 - const T & operator[](size_t offset) const
1.227 - {
1.228 - return (*(*this + offset));
1.229 - }
1.230 -
1.231 - bool operator<(const iterator & right) const
1.232 - {
1.233 - return m_Ptr < right.m_Ptr;
1.234 - }
1.235 -
1.236 - bool operator>(const iterator & right) const
1.237 - {
1.238 - return m_Ptr > right.m_Ptr;
1.239 - }
1.240 -
1.241 - bool operator<=(const iterator & right) const
1.242 - {
1.243 - return m_Ptr <= right.m_Ptr;
1.244 - }
1.245 -
1.246 - bool operator>=(const iterator & right) const
1.247 - {
1.248 - return m_Ptr >= right.m_Ptr;
1.249 - }
1.250 -
1.251 - size_t operator-(const iterator & right) const
1.252 - {
1.253 - return m_Ptr - right.m_Ptr;
1.254 - }
1.255 - };
1.256 -
1.257 - // constructors / destructors
1.258 - CVector<T>()
1.259 - {
1.260 - m_Size = 0;
1.261 - m_CurrentUsedSize = 0;
1.262 - m_Data = NULL;
1.263 - }
1.264 -
1.265 - CVector<T>(const CVector<T> & other)
1.266 - {
1.267 - // copy data
1.268 - m_Data = new T [other.m_CurrentUsedSize];
1.269 - m_Size = other.m_CurrentUsedSize;
1.270 - m_CurrentUsedSize = other.m_CurrentUsedSize;
1.271 - for (size_t i=0; i<other.m_CurrentUsedSize; i++)
1.272 - m_Data[i] = other.m_Data[i];
1.273 - }
1.274 -
1.275 - ~CVector<T>()
1.276 - {
1.277 - clear();
1.278 - }
1.279 -
1.280 - CVector & operator =(const CVector<T> & other)
1.281 - {
1.282 - clear();
1.283 - ChangeSize(other.size());
1.284 - m_CurrentUsedSize = other.size();
1.285 - for (size_t i=0; i<other.size(); i++)
1.286 - m_Data[i] = other.at(i);
1.287 - return *this;
1.288 - }
1.289 -
1.290 - // interface
1.291 - size_t size() const
1.292 - {
1.293 - return m_CurrentUsedSize;
1.294 - }
1.295 -
1.296 - size_t capacity() const
1.297 - {
1.298 - return m_Size;
1.299 - }
1.300 -
1.301 - iterator begin() const
1.302 - {
1.303 - return iterator(m_Data);
1.304 - }
1.305 -
1.306 - iterator end() const
1.307 - {
1.308 - return iterator(m_Data + m_CurrentUsedSize);
1.309 - }
1.310 -
1.311 - iterator iterAt(size_t pos)
1.312 - {
1.313 - if (pos > m_CurrentUsedSize)
1.314 - assert(0);
1.315 - return iterator(m_Data + pos);
1.316 - }
1.317 -
1.318 - bool reserve(size_t newSize)
1.319 - {
1.320 - if (newSize > m_Size)
1.321 - return ChangeSize(newSize);
1.322 - return true;
1.323 - }
1.324 -
1.325 - bool push_back(const T & elem)
1.326 - {
1.327 - ++m_CurrentUsedSize;
1.328 - if (!GrowIfNeeded())
1.329 - {
1.330 - --m_CurrentUsedSize;
1.331 - return false;
1.332 - }
1.333 -
1.334 - m_Data[m_CurrentUsedSize - 1] = elem;
1.335 - return true;
1.336 - }
1.337 -
1.338 - void pop_back()
1.339 - {
1.340 - --m_CurrentUsedSize;
1.341 - if (m_CurrentUsedSize < 0)
1.342 - m_CurrentUsedSize = 0;
1.343 -
1.344 - FreeMemIfPossible();
1.345 - }
1.346 -
1.347 - bool resize(size_t newSize)
1.348 - {
1.349 - return resize(newSize, T());
1.350 - }
1.351 -
1.352 - bool resize(size_t newSize, T defval)
1.353 - {
1.354 - if (!ChangeSize(newSize))
1.355 - return false;
1.356 - for (size_t i = m_CurrentUsedSize; i < newSize; ++i)
1.357 - m_Data[i] = defval;
1.358 - m_CurrentUsedSize = newSize;
1.359 - return true;
1.360 - }
1.361 -
1.362 - bool empty() const
1.363 - {
1.364 - return (m_CurrentUsedSize == 0);
1.365 - }
1.366 -
1.367 - T & at(size_t pos)
1.368 - {
1.369 - if (pos > m_CurrentUsedSize)
1.370 - {
1.371 - assert(0);
1.372 - }
1.373 - return m_Data[pos];
1.374 - }
1.375 -
1.376 - const T & at(size_t pos) const
1.377 - {
1.378 - if (pos > m_CurrentUsedSize)
1.379 - {
1.380 - assert(0);
1.381 - }
1.382 - return m_Data[pos];
1.383 - }
1.384 -
1.385 - T & operator[](size_t pos)
1.386 - {
1.387 - return at(pos);
1.388 - }
1.389 -
1.390 - const T & operator[](size_t pos) const
1.391 - {
1.392 - return at(pos);
1.393 - }
1.394 -
1.395 - T & front()
1.396 - {
1.397 - if (m_CurrentUsedSize < 1)
1.398 - {
1.399 - assert(0);
1.400 - }
1.401 - return m_Data[0];
1.402 - }
1.403 -
1.404 - const T & front() const
1.405 - {
1.406 - if (m_CurrentUsedSize < 1)
1.407 - {
1.408 - assert(0);
1.409 - }
1.410 - return m_Data[0];
1.411 - }
1.412 -
1.413 - T & back()
1.414 - {
1.415 - if (m_CurrentUsedSize < 1)
1.416 - {
1.417 - assert(0);
1.418 - }
1.419 - return m_Data[m_CurrentUsedSize - 1];
1.420 - }
1.421 -
1.422 - const T & back() const
1.423 - {
1.424 - if (m_CurrentUsedSize < 1)
1.425 - {
1.426 - assert(0);
1.427 - }
1.428 - return m_Data[m_CurrentUsedSize - 1];
1.429 - }
1.430 -
1.431 - iterator insert(iterator where, const T & value)
1.432 - {
1.433 - // validate iter
1.434 - if (where < m_Data || where > (m_Data + m_CurrentUsedSize))
1.435 - return iterator(0);
1.436 -
1.437 - size_t ofs = where - begin();
1.438 -
1.439 - ++m_CurrentUsedSize;
1.440 - if (!GrowIfNeeded())
1.441 - {
1.442 - --m_CurrentUsedSize;
1.443 - return false;
1.444 - }
1.445 -
1.446 - where = begin() + ofs;
1.447 -
1.448 - // Move subsequent entries
1.449 - for (T *ptr = m_Data + m_CurrentUsedSize - 2; ptr >= where.base(); --ptr)
1.450 - *(ptr + 1) = *ptr;
1.451 -
1.452 - *where.base() = value;
1.453 -
1.454 - return where;
1.455 - }
1.456 -
1.457 - iterator erase(iterator where)
1.458 - {
1.459 - // validate iter
1.460 - if (where < m_Data || where >= (m_Data + m_CurrentUsedSize))
1.461 - return iterator(0);
1.462 -
1.463 - size_t ofs = where - begin();
1.464 -
1.465 - if (m_CurrentUsedSize > 1)
1.466 - {
1.467 - // move
1.468 - T *theend = m_Data + m_CurrentUsedSize;
1.469 - for (T *ptr = where.base() + 1; ptr < theend; ++ptr)
1.470 - *(ptr - 1) = *ptr;
1.471 - }
1.472 -
1.473 - --m_CurrentUsedSize;
1.474 -
1.475 - FreeMemIfPossible();
1.476 -
1.477 - return begin() + ofs;
1.478 - }
1.479 -
1.480 - void clear()
1.481 - {
1.482 - m_Size = 0;
1.483 - m_CurrentUsedSize = 0;
1.484 - if (m_Data)
1.485 - {
1.486 - delete [] m_Data;
1.487 - m_Data = NULL;
1.488 - }
1.489 - }
1.490 -};
1.491 -}; //namespace SourceHook
1.492 -
1.493 -#endif // __CVECTOR_H__