core/sourcehook/sh_stack.h
changeset 539 db914129ae01
parent 523 6f1630519b81
child 733 2365240861a2
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/core/sourcehook/sh_stack.h	Fri Nov 14 04:04:02 2008 -0600
     1.3 @@ -0,0 +1,232 @@
     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 __SH_STACK_H__
    1.15 +#define __SH_STACK_H__
    1.16 +
    1.17 +#include <stddef.h>
    1.18 +#include "sh_vector.h"
    1.19 +
    1.20 +namespace SourceHook
    1.21 +{
    1.22 +	// May _never_ reallocate used memory!
    1.23 +
    1.24 +	template <class T> class CStack
    1.25 +	{
    1.26 +		static const size_t SECTOR_SIZE = 16;
    1.27 +
    1.28 +		CVector<T*> m_Sectors;				// Stores sectors
    1.29 +
    1.30 +		size_t m_UsedSize;
    1.31 +
    1.32 +		void clear()
    1.33 +		{
    1.34 +			typename CVector<T*>::iterator sect_iter;
    1.35 +			for (sect_iter = m_Sectors.begin(); sect_iter != m_Sectors.end(); ++sect_iter)
    1.36 +			{
    1.37 +				delete [] *sect_iter;
    1.38 +			}
    1.39 +			m_Sectors.clear();
    1.40 +		}
    1.41 +	public:
    1.42 +		friend class iterator;
    1.43 +		class iterator
    1.44 +		{
    1.45 +			CStack<T> *m_pParent;
    1.46 +			size_t m_Index;
    1.47 +		public:
    1.48 +			iterator(CStack<T> *pParent, size_t id) : m_pParent(pParent), m_Index(id)
    1.49 +			{
    1.50 +			}
    1.51 +
    1.52 +			iterator(CStack<T> *pParent) : m_pParent(pParent), m_Index(0)
    1.53 +			{
    1.54 +			}
    1.55 +			
    1.56 +			iterator() : m_pParent(NULL), m_Index(0)
    1.57 +			{
    1.58 +			}
    1.59 +
    1.60 +			T &operator *()
    1.61 +			{
    1.62 +				return m_pParent->at(m_Index);
    1.63 +			}
    1.64 +			const T &operator *() const
    1.65 +			{
    1.66 +				return m_pParent->at(m_Index);
    1.67 +			}
    1.68 +			
    1.69 +			T * operator->()
    1.70 +			{
    1.71 +				return &(m_pParent->at(m_Index));
    1.72 +			}
    1.73 +
    1.74 +			const T * operator->() const
    1.75 +			{
    1.76 +				return &(m_pParent->at(m_Index));
    1.77 +			}
    1.78 +
    1.79 +			iterator & operator++()		// preincrement
    1.80 +			{
    1.81 +				++m_Index;
    1.82 +				return (*this);
    1.83 +			}
    1.84 +
    1.85 +			iterator operator++(int)	// postincrement
    1.86 +			{
    1.87 +				iterator tmp = *this;
    1.88 +				++m_Index;
    1.89 +				return tmp;
    1.90 +			}
    1.91 +
    1.92 +			iterator & operator--()		// predecrement
    1.93 +			{
    1.94 +				--m_Index;
    1.95 +				return (*this);
    1.96 +			}
    1.97 +
    1.98 +			iterator operator--(int)	// postdecrememnt
    1.99 +			{
   1.100 +				iterator tmp = *this;
   1.101 +				--m_Index;
   1.102 +				return tmp;
   1.103 +			}
   1.104 +
   1.105 +			bool operator==(const iterator & right) const
   1.106 +			{
   1.107 +				return (m_pParent == right.m_pParent && m_Index == right.m_Index);
   1.108 +			}
   1.109 +
   1.110 +			bool operator!=(const iterator & right) const
   1.111 +			{
   1.112 +				return !(*this == right);
   1.113 +			}
   1.114 +		};
   1.115 +		CStack() : m_UsedSize(0)
   1.116 +		{
   1.117 +		}
   1.118 +
   1.119 +		CStack(const CStack &other)
   1.120 +		{
   1.121 +			for (typename CVector<T*>::iterator sect_iter = other.m_Sectors.begin();
   1.122 +				sect_iter != other.m_Sectors.end(); ++sect_iter)
   1.123 +			{
   1.124 +				m_Sectors.push_back(new T[SECTOR_SIZE]);
   1.125 +				for (size_t i = 0; i < SECTOR_SIZE; ++i)
   1.126 +					m_Sectors.back()[i] = (*sect_iter)[i];
   1.127 +			}
   1.128 +			m_UsedSize = other.m_UsedSize;
   1.129 +		}
   1.130 +
   1.131 +		CStack & operator =(const CStack &other)
   1.132 +		{
   1.133 +			clear();
   1.134 +			for (typename CVector<T*>::iterator sect_iter = other.m_Sectors.begin();
   1.135 +				sect_iter != other.m_Sectors.end(); ++sect_iter)
   1.136 +			{
   1.137 +				m_Sectors.push_back(new T[SECTOR_SIZE]);
   1.138 +				for (size_t i = 0; i < SECTOR_SIZE; ++i)
   1.139 +					m_Sectors.back()[i] = (*sect_iter)[i];
   1.140 +			}
   1.141 +			m_UsedSize = other.m_UsedSize;
   1.142 +			return *this;
   1.143 +		}
   1.144 +
   1.145 +		~CStack()
   1.146 +		{
   1.147 +			clear();
   1.148 +		}
   1.149 +
   1.150 +		T &at(size_t x)
   1.151 +		{
   1.152 +			return m_Sectors[x / SECTOR_SIZE][x % SECTOR_SIZE];
   1.153 +		}
   1.154 +
   1.155 +		const T &at(size_t x) const
   1.156 +		{
   1.157 +			return m_Sectors[x / SECTOR_SIZE][x % SECTOR_SIZE];
   1.158 +		}
   1.159 +
   1.160 +		bool push(const T &val)
   1.161 +		{
   1.162 +			if ((m_UsedSize / SECTOR_SIZE) >= m_Sectors.size())
   1.163 +			{
   1.164 +				// New sector
   1.165 +				m_Sectors.push_back(new T[SECTOR_SIZE]);
   1.166 +			}
   1.167 +
   1.168 +			at(m_UsedSize) = val;
   1.169 +
   1.170 +			++m_UsedSize;
   1.171 +			return true;
   1.172 +		}
   1.173 +
   1.174 +		T *make_next()
   1.175 +		{
   1.176 +			if ((m_UsedSize / SECTOR_SIZE) >= m_Sectors.size())
   1.177 +			{
   1.178 +				// New sector
   1.179 +				m_Sectors.push_back(new T[SECTOR_SIZE]);
   1.180 +			}
   1.181 +
   1.182 +			return &(at(m_UsedSize++));
   1.183 +		}
   1.184 +
   1.185 +		void pop()
   1.186 +		{
   1.187 +			--m_UsedSize;
   1.188 +		}
   1.189 +
   1.190 +		void popall()
   1.191 +		{
   1.192 +			m_UsedSize = 0;
   1.193 +		}
   1.194 +
   1.195 +		T &front()
   1.196 +		{
   1.197 +			return at(m_UsedSize-1);
   1.198 +		}
   1.199 +
   1.200 +		const T &front() const
   1.201 +		{
   1.202 +			return at(m_UsedSize-1);
   1.203 +		}
   1.204 +
   1.205 +		T &second()
   1.206 +		{
   1.207 +			return at(m_UsedSize-2);
   1.208 +		}
   1.209 +
   1.210 +		const T &second() const
   1.211 +		{
   1.212 +			return at(m_UsedSize-2);
   1.213 +		}
   1.214 +
   1.215 +		iterator begin()
   1.216 +		{
   1.217 +			return iterator(this, 0);
   1.218 +		}
   1.219 +		iterator end()
   1.220 +		{
   1.221 +			return iterator(this, m_UsedSize);
   1.222 +		}
   1.223 +
   1.224 +		size_t size()
   1.225 +		{
   1.226 +			return m_UsedSize;
   1.227 +		}
   1.228 +		bool empty()
   1.229 +		{
   1.230 +			return m_UsedSize == 0 ? true : false;
   1.231 +		}
   1.232 +	};
   1.233 +};	//namespace SourceHook
   1.234 +
   1.235 +#endif