sourcehook/sh_stack.h
changeset 128 63f95eed16b6
child 129 1e021006dae7
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/sourcehook/sh_stack.h	Wed Oct 12 20:25:15 2005 +0000
     1.3 @@ -0,0 +1,165 @@
     1.4 +/* ======== SourceMM ========
     1.5 +* Copyright (C) 2004-2005 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 +#define SH_STACK_DEFAULT_SIZE 4
    1.18 +
    1.19 +#include <assert.h>
    1.20 +
    1.21 +namespace SourceHook
    1.22 +{
    1.23 +	// Vector
    1.24 +	template <class T> class CStack
    1.25 +	{
    1.26 +		T *m_Elements;
    1.27 +		size_t m_AllocatedSize;
    1.28 +		size_t m_UsedSize;
    1.29 +	public:
    1.30 +		friend class iterator;
    1.31 +		class iterator
    1.32 +		{
    1.33 +			CStack<T> *m_pParent;
    1.34 +			size_t m_Index;
    1.35 +		public:
    1.36 +			iterator(CStack<T> *pParent, size_t id) : m_pParent(pParent), m_Index(id)
    1.37 +			{
    1.38 +			}
    1.39 +
    1.40 +			iterator(CStack<T> *pParent) : m_pParent(pParent), m_Index(0)
    1.41 +			{
    1.42 +			}
    1.43 +			
    1.44 +			iterator() : m_pParent(NULL), m_Index(0)
    1.45 +			{
    1.46 +			}
    1.47 +
    1.48 +			T &operator *()
    1.49 +			{
    1.50 +				return m_pParent->m_Elements[m_Index];
    1.51 +			}
    1.52 +			const T &operator *() const
    1.53 +			{
    1.54 +				return m_pParent->m_Elements[m_Index];
    1.55 +			}
    1.56 +			
    1.57 +			T * operator->()
    1.58 +			{
    1.59 +				return m_pParent->m_Elements + m_Index;
    1.60 +			}
    1.61 +
    1.62 +			const T * operator->() const
    1.63 +			{
    1.64 +				return m_pParent->m_Elements + m_Index;
    1.65 +			}
    1.66 +
    1.67 +			iterator & operator++()		// preincrement
    1.68 +			{
    1.69 +				++m_Index;
    1.70 +				return (*this);
    1.71 +			}
    1.72 +
    1.73 +			iterator operator++(int)	// postincrement
    1.74 +			{
    1.75 +				iterator tmp = *this;
    1.76 +				++m_Ptr;
    1.77 +				return tmp;
    1.78 +			}
    1.79 +
    1.80 +			iterator & operator--()		// predecrement
    1.81 +			{
    1.82 +				--m_Index;
    1.83 +				return (*this);
    1.84 +			}
    1.85 +
    1.86 +			iterator operator--(int)	// postdecrememnt
    1.87 +			{
    1.88 +				iterator tmp = *this;
    1.89 +				--m_Ptr;
    1.90 +				return tmp;
    1.91 +			}
    1.92 +
    1.93 +			bool operator==(const iterator & right) const
    1.94 +			{
    1.95 +				return (m_pParent == right.m_pParent && m_Index == right.m_Index);
    1.96 +			}
    1.97 +
    1.98 +			bool operator!=(const iterator & right) const
    1.99 +			{
   1.100 +				return !(*this == right);
   1.101 +			}
   1.102 +		};
   1.103 +		CStack() : m_Elements(new T[SH_STACK_DEFAULT_SIZE]),
   1.104 +			m_AllocatedSize(SH_STACK_DEFAULT_SIZE),
   1.105 +			m_UsedSize(0)
   1.106 +		{
   1.107 +			assert(m_Elements);
   1.108 +		}
   1.109 +		CStack(size_t size) : m_Elements(new T[size]),
   1.110 +			m_AllocatedSize(size),
   1.111 +			m_UsedSize(0)
   1.112 +		{
   1.113 +			assert(m_Elements);
   1.114 +		}
   1.115 +
   1.116 +		~CStack()
   1.117 +		{
   1.118 +			if (m_Elements)
   1.119 +				delete [] m_Elements;
   1.120 +		}
   1.121 +		
   1.122 +		bool push(const T &val)
   1.123 +		{
   1.124 +			if (m_UsedSize + 1 == m_AllocatedSize)
   1.125 +			{
   1.126 +				// zOHNOES! REALLOCATE!
   1.127 +				m_AllocatedSize *= 2;
   1.128 +				T *newElements = new T[m_AllocatedSize];
   1.129 +				if (!newElements)
   1.130 +				{
   1.131 +					m_AllocatedSize /= 2;
   1.132 +					return false;
   1.133 +				}
   1.134 +				for (size_t i = 0; i < m_UsedSize; ++i)
   1.135 +					newElements[i] = m_Elements[i];
   1.136 +				delete [] m_Elements;
   1.137 +				m_Elements = newElements;
   1.138 +			}
   1.139 +			m_Elements[m_UsedSize++] = val;
   1.140 +			return true;
   1.141 +		}
   1.142 +		void pop()
   1.143 +		{
   1.144 +			--m_UsedSize;
   1.145 +		}
   1.146 +
   1.147 +		T &front()
   1.148 +		{
   1.149 +			return m_Elements[m_UsedSize - 1];
   1.150 +		}
   1.151 +
   1.152 +		const T &front() const
   1.153 +		{
   1.154 +			return m_Elements[m_UsedSize - 1];
   1.155 +		}
   1.156 +
   1.157 +		iterator begin()
   1.158 +		{
   1.159 +			return iterator(this, 0);
   1.160 +		}
   1.161 +		iterator end()
   1.162 +		{
   1.163 +			return iterator(this, m_UsedSize);
   1.164 +		}
   1.165 +	};
   1.166 +};	//namespace SourceHook
   1.167 +
   1.168 +#endif