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