sourcehook/sh_stack.h
author Christian Hammacher <bmasterc@gmail.com>
Thu Oct 13 23:42:51 2005 +0000 (2005-10-13)
changeset 130 ba6b4cb2505a
parent 129 1e021006dae7
child 133 ffe46578a1ae
permissions -rw-r--r--
I can't spell "LATEST"
pavolmarko@128
     1
/* ======== SourceMM ========
pavolmarko@128
     2
* Copyright (C) 2004-2005 Metamod:Source Development Team
pavolmarko@128
     3
* No warranties of any kind
pavolmarko@128
     4
*
pavolmarko@128
     5
* License: zlib/libpng
pavolmarko@128
     6
*
pavolmarko@128
     7
* Author(s): Pavol "PM OnoTo" Marko
pavolmarko@128
     8
* ============================
pavolmarko@128
     9
*/
pavolmarko@128
    10
pavolmarko@128
    11
#ifndef __SH_STACK_H__
pavolmarko@128
    12
#define __SH_STACK_H__
pavolmarko@128
    13
pavolmarko@128
    14
#define SH_STACK_DEFAULT_SIZE 4
pavolmarko@128
    15
pavolmarko@128
    16
#include <assert.h>
pavolmarko@128
    17
pavolmarko@128
    18
namespace SourceHook
pavolmarko@128
    19
{
pavolmarko@128
    20
	// Vector
pavolmarko@128
    21
	template <class T> class CStack
pavolmarko@128
    22
	{
pavolmarko@128
    23
		T *m_Elements;
pavolmarko@128
    24
		size_t m_AllocatedSize;
pavolmarko@128
    25
		size_t m_UsedSize;
pavolmarko@128
    26
	public:
pavolmarko@128
    27
		friend class iterator;
pavolmarko@128
    28
		class iterator
pavolmarko@128
    29
		{
pavolmarko@128
    30
			CStack<T> *m_pParent;
pavolmarko@128
    31
			size_t m_Index;
pavolmarko@128
    32
		public:
pavolmarko@128
    33
			iterator(CStack<T> *pParent, size_t id) : m_pParent(pParent), m_Index(id)
pavolmarko@128
    34
			{
pavolmarko@128
    35
			}
pavolmarko@128
    36
pavolmarko@128
    37
			iterator(CStack<T> *pParent) : m_pParent(pParent), m_Index(0)
pavolmarko@128
    38
			{
pavolmarko@128
    39
			}
pavolmarko@128
    40
			
pavolmarko@128
    41
			iterator() : m_pParent(NULL), m_Index(0)
pavolmarko@128
    42
			{
pavolmarko@128
    43
			}
pavolmarko@128
    44
pavolmarko@128
    45
			T &operator *()
pavolmarko@128
    46
			{
pavolmarko@128
    47
				return m_pParent->m_Elements[m_Index];
pavolmarko@128
    48
			}
pavolmarko@128
    49
			const T &operator *() const
pavolmarko@128
    50
			{
pavolmarko@128
    51
				return m_pParent->m_Elements[m_Index];
pavolmarko@128
    52
			}
pavolmarko@128
    53
			
pavolmarko@128
    54
			T * operator->()
pavolmarko@128
    55
			{
pavolmarko@128
    56
				return m_pParent->m_Elements + m_Index;
pavolmarko@128
    57
			}
pavolmarko@128
    58
pavolmarko@128
    59
			const T * operator->() const
pavolmarko@128
    60
			{
pavolmarko@128
    61
				return m_pParent->m_Elements + m_Index;
pavolmarko@128
    62
			}
pavolmarko@128
    63
pavolmarko@128
    64
			iterator & operator++()		// preincrement
pavolmarko@128
    65
			{
pavolmarko@128
    66
				++m_Index;
pavolmarko@128
    67
				return (*this);
pavolmarko@128
    68
			}
pavolmarko@128
    69
pavolmarko@128
    70
			iterator operator++(int)	// postincrement
pavolmarko@128
    71
			{
pavolmarko@128
    72
				iterator tmp = *this;
pavolmarko@129
    73
				++m_Index;
pavolmarko@128
    74
				return tmp;
pavolmarko@128
    75
			}
pavolmarko@128
    76
pavolmarko@128
    77
			iterator & operator--()		// predecrement
pavolmarko@128
    78
			{
pavolmarko@128
    79
				--m_Index;
pavolmarko@128
    80
				return (*this);
pavolmarko@128
    81
			}
pavolmarko@128
    82
pavolmarko@128
    83
			iterator operator--(int)	// postdecrememnt
pavolmarko@128
    84
			{
pavolmarko@128
    85
				iterator tmp = *this;
pavolmarko@129
    86
				--m_Index;
pavolmarko@128
    87
				return tmp;
pavolmarko@128
    88
			}
pavolmarko@128
    89
pavolmarko@128
    90
			bool operator==(const iterator & right) const
pavolmarko@128
    91
			{
pavolmarko@128
    92
				return (m_pParent == right.m_pParent && m_Index == right.m_Index);
pavolmarko@128
    93
			}
pavolmarko@128
    94
pavolmarko@128
    95
			bool operator!=(const iterator & right) const
pavolmarko@128
    96
			{
pavolmarko@128
    97
				return !(*this == right);
pavolmarko@128
    98
			}
pavolmarko@128
    99
		};
pavolmarko@128
   100
		CStack() : m_Elements(new T[SH_STACK_DEFAULT_SIZE]),
pavolmarko@128
   101
			m_AllocatedSize(SH_STACK_DEFAULT_SIZE),
pavolmarko@128
   102
			m_UsedSize(0)
pavolmarko@128
   103
		{
pavolmarko@128
   104
			assert(m_Elements);
pavolmarko@128
   105
		}
pavolmarko@128
   106
		CStack(size_t size) : m_Elements(new T[size]),
pavolmarko@128
   107
			m_AllocatedSize(size),
pavolmarko@128
   108
			m_UsedSize(0)
pavolmarko@128
   109
		{
pavolmarko@128
   110
			assert(m_Elements);
pavolmarko@128
   111
		}
pavolmarko@128
   112
pavolmarko@129
   113
		CStack(const CStack &other) : m_Elements(NULL),
pavolmarko@129
   114
			m_AllocatedSize(0),
pavolmarko@129
   115
			m_UsedSize(0)
pavolmarko@129
   116
		{
pavolmarko@129
   117
			assert(reserve(other.m_AllocatedSize) && m_Elements);
pavolmarko@129
   118
			m_UsedSize = other.m_UsedSize;
pavolmarko@129
   119
			for (size_t i = 0; i < m_UsedSize; ++i)
pavolmarko@129
   120
				m_Elements[i] = other.m_Elements[i];
pavolmarko@129
   121
		}
pavolmarko@129
   122
pavolmarko@128
   123
		~CStack()
pavolmarko@128
   124
		{
pavolmarko@128
   125
			if (m_Elements)
pavolmarko@128
   126
				delete [] m_Elements;
pavolmarko@128
   127
		}
pavolmarko@128
   128
		
pavolmarko@129
   129
		void operator=(const CStack &other)
pavolmarko@129
   130
		{
pavolmarko@129
   131
			if (m_AllocatedSize < other.m_AllocatedSize)
pavolmarko@129
   132
			{
pavolmarko@129
   133
				if (m_Elements)
pavolmarko@129
   134
					delete [] m_Elements;
pavolmarko@129
   135
				m_Elements = new T[other.m_AllocatedSize];
pavolmarko@129
   136
				assert(m_Elements);
pavolmarko@129
   137
				m_AllocatedSize = other.m_AllocatedSize;
pavolmarko@129
   138
			}
pavolmarko@129
   139
			m_UsedSize = other.m_UsedSize;
pavolmarko@129
   140
			for (size_t i = 0; i < m_UsedSize; ++i)
pavolmarko@129
   141
				m_Elements[i] = other.m_Elements[i];
pavolmarko@129
   142
		}
pavolmarko@129
   143
pavolmarko@128
   144
		bool push(const T &val)
pavolmarko@128
   145
		{
pavolmarko@128
   146
			if (m_UsedSize + 1 == m_AllocatedSize)
pavolmarko@128
   147
			{
pavolmarko@128
   148
				// zOHNOES! REALLOCATE!
pavolmarko@128
   149
				m_AllocatedSize *= 2;
pavolmarko@128
   150
				T *newElements = new T[m_AllocatedSize];
pavolmarko@128
   151
				if (!newElements)
pavolmarko@128
   152
				{
pavolmarko@128
   153
					m_AllocatedSize /= 2;
pavolmarko@128
   154
					return false;
pavolmarko@128
   155
				}
pavolmarko@129
   156
				if (m_Elements)
pavolmarko@129
   157
				{
pavolmarko@129
   158
					for (size_t i = 0; i < m_UsedSize; ++i)
pavolmarko@129
   159
						newElements[i] = m_Elements[i];
pavolmarko@129
   160
					delete [] m_Elements;
pavolmarko@129
   161
				}
pavolmarko@128
   162
				m_Elements = newElements;
pavolmarko@128
   163
			}
pavolmarko@128
   164
			m_Elements[m_UsedSize++] = val;
pavolmarko@128
   165
			return true;
pavolmarko@128
   166
		}
pavolmarko@128
   167
		void pop()
pavolmarko@128
   168
		{
pavolmarko@128
   169
			--m_UsedSize;
pavolmarko@128
   170
		}
pavolmarko@128
   171
pavolmarko@128
   172
		T &front()
pavolmarko@128
   173
		{
pavolmarko@128
   174
			return m_Elements[m_UsedSize - 1];
pavolmarko@128
   175
		}
pavolmarko@128
   176
pavolmarko@128
   177
		const T &front() const
pavolmarko@128
   178
		{
pavolmarko@128
   179
			return m_Elements[m_UsedSize - 1];
pavolmarko@128
   180
		}
pavolmarko@128
   181
pavolmarko@128
   182
		iterator begin()
pavolmarko@128
   183
		{
pavolmarko@128
   184
			return iterator(this, 0);
pavolmarko@128
   185
		}
pavolmarko@128
   186
		iterator end()
pavolmarko@128
   187
		{
pavolmarko@128
   188
			return iterator(this, m_UsedSize);
pavolmarko@128
   189
		}
pavolmarko@129
   190
pavolmarko@129
   191
		size_t size()
pavolmarko@129
   192
		{
pavolmarko@129
   193
			return m_UsedSize;
pavolmarko@129
   194
		}
pavolmarko@129
   195
		size_t capacity()
pavolmarko@129
   196
		{
pavolmarko@129
   197
			return m_AllocatedSize;
pavolmarko@129
   198
		}
pavolmarko@129
   199
		bool empty()
pavolmarko@129
   200
		{
pavolmarko@129
   201
			return m_UsedSize == 0 ? true : false;
pavolmarko@129
   202
		}
pavolmarko@129
   203
		bool reserve(size_t size)
pavolmarko@129
   204
		{
pavolmarko@129
   205
			if (size > m_AllocatedSize)
pavolmarko@129
   206
			{
pavolmarko@129
   207
				T *newElements = new T[size];
pavolmarko@129
   208
				if (!newElements)
pavolmarko@129
   209
					return false;
pavolmarko@129
   210
				if (m_Elements)
pavolmarko@129
   211
				{
pavolmarko@129
   212
					for (size_t i = 0; i < m_UsedSize; ++i)
pavolmarko@129
   213
						newElements[i] = m_Elements[i];
pavolmarko@129
   214
					delete [] m_Elements;
pavolmarko@129
   215
				}
pavolmarko@129
   216
				m_Elements = newElements;
pavolmarko@129
   217
				m_AllocatedSize = size;
pavolmarko@129
   218
			}
pavolmarko@129
   219
			return true;
pavolmarko@129
   220
		}
pavolmarko@128
   221
	};
pavolmarko@128
   222
};	//namespace SourceHook
pavolmarko@128
   223
pavolmarko@128
   224
#endif