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