pavolmarko@128: /* ======== SourceMM ======== ds@294: * Copyright (C) 2004-2007 Metamod:Source Development Team ds@294: * No warranties of any kind ds@294: * ds@294: * License: zlib/libpng ds@294: * ds@294: * Author(s): Pavol "PM OnoTo" Marko ds@294: * ============================ ds@294: */ pavolmarko@128: pavolmarko@128: #ifndef __SH_STACK_H__ pavolmarko@128: #define __SH_STACK_H__ pavolmarko@128: dvander@264: #include dvander@264: pavolmarko@128: #define SH_STACK_DEFAULT_SIZE 4 pavolmarko@128: pavolmarko@128: namespace SourceHook pavolmarko@128: { pavolmarko@128: // Vector pavolmarko@128: template class CStack pavolmarko@128: { pavolmarko@128: T *m_Elements; pavolmarko@128: size_t m_AllocatedSize; pavolmarko@128: size_t m_UsedSize; pavolmarko@128: public: pavolmarko@128: friend class iterator; pavolmarko@128: class iterator pavolmarko@128: { pavolmarko@128: CStack *m_pParent; pavolmarko@128: size_t m_Index; pavolmarko@128: public: pavolmarko@128: iterator(CStack *pParent, size_t id) : m_pParent(pParent), m_Index(id) pavolmarko@128: { pavolmarko@128: } pavolmarko@128: pavolmarko@128: iterator(CStack *pParent) : m_pParent(pParent), m_Index(0) pavolmarko@128: { pavolmarko@128: } pavolmarko@128: pavolmarko@128: iterator() : m_pParent(NULL), m_Index(0) pavolmarko@128: { pavolmarko@128: } pavolmarko@128: pavolmarko@128: T &operator *() pavolmarko@128: { pavolmarko@128: return m_pParent->m_Elements[m_Index]; pavolmarko@128: } pavolmarko@128: const T &operator *() const pavolmarko@128: { pavolmarko@128: return m_pParent->m_Elements[m_Index]; pavolmarko@128: } pavolmarko@128: pavolmarko@128: T * operator->() pavolmarko@128: { pavolmarko@128: return m_pParent->m_Elements + m_Index; pavolmarko@128: } pavolmarko@128: pavolmarko@128: const T * operator->() const pavolmarko@128: { pavolmarko@128: return m_pParent->m_Elements + m_Index; pavolmarko@128: } pavolmarko@128: pavolmarko@128: iterator & operator++() // preincrement pavolmarko@128: { pavolmarko@128: ++m_Index; pavolmarko@128: return (*this); pavolmarko@128: } pavolmarko@128: pavolmarko@128: iterator operator++(int) // postincrement pavolmarko@128: { pavolmarko@128: iterator tmp = *this; pavolmarko@129: ++m_Index; pavolmarko@128: return tmp; pavolmarko@128: } pavolmarko@128: pavolmarko@128: iterator & operator--() // predecrement pavolmarko@128: { pavolmarko@128: --m_Index; pavolmarko@128: return (*this); pavolmarko@128: } pavolmarko@128: pavolmarko@128: iterator operator--(int) // postdecrememnt pavolmarko@128: { pavolmarko@128: iterator tmp = *this; pavolmarko@129: --m_Index; pavolmarko@128: return tmp; pavolmarko@128: } pavolmarko@128: pavolmarko@128: bool operator==(const iterator & right) const pavolmarko@128: { pavolmarko@128: return (m_pParent == right.m_pParent && m_Index == right.m_Index); pavolmarko@128: } pavolmarko@128: pavolmarko@128: bool operator!=(const iterator & right) const pavolmarko@128: { pavolmarko@128: return !(*this == right); pavolmarko@128: } pavolmarko@128: }; pavolmarko@128: CStack() : m_Elements(new T[SH_STACK_DEFAULT_SIZE]), pavolmarko@128: m_AllocatedSize(SH_STACK_DEFAULT_SIZE), pavolmarko@128: m_UsedSize(0) pavolmarko@128: { pavolmarko@128: } pavolmarko@128: CStack(size_t size) : m_Elements(new T[size]), pavolmarko@128: m_AllocatedSize(size), pavolmarko@128: m_UsedSize(0) pavolmarko@128: { pavolmarko@128: } pavolmarko@128: pavolmarko@129: CStack(const CStack &other) : m_Elements(NULL), pavolmarko@129: m_AllocatedSize(0), pavolmarko@129: m_UsedSize(0) pavolmarko@129: { pavolmarko@133: reserve(other.m_AllocatedSize); pavolmarko@129: m_UsedSize = other.m_UsedSize; pavolmarko@129: for (size_t i = 0; i < m_UsedSize; ++i) pavolmarko@129: m_Elements[i] = other.m_Elements[i]; pavolmarko@129: } pavolmarko@129: pavolmarko@128: ~CStack() pavolmarko@128: { pavolmarko@128: if (m_Elements) pavolmarko@128: delete [] m_Elements; pavolmarko@128: } pavolmarko@128: pavolmarko@129: void operator=(const CStack &other) pavolmarko@129: { pavolmarko@129: if (m_AllocatedSize < other.m_AllocatedSize) pavolmarko@129: { pavolmarko@129: if (m_Elements) pavolmarko@129: delete [] m_Elements; pavolmarko@129: m_Elements = new T[other.m_AllocatedSize]; pavolmarko@129: m_AllocatedSize = other.m_AllocatedSize; pavolmarko@129: } pavolmarko@129: m_UsedSize = other.m_UsedSize; pavolmarko@129: for (size_t i = 0; i < m_UsedSize; ++i) pavolmarko@129: m_Elements[i] = other.m_Elements[i]; pavolmarko@129: } pavolmarko@129: pavolmarko@128: bool push(const T &val) pavolmarko@128: { pavolmarko@128: if (m_UsedSize + 1 == m_AllocatedSize) pavolmarko@128: { pavolmarko@128: // zOHNOES! REALLOCATE! pavolmarko@128: m_AllocatedSize *= 2; pavolmarko@128: T *newElements = new T[m_AllocatedSize]; pavolmarko@128: if (!newElements) pavolmarko@128: { pavolmarko@128: m_AllocatedSize /= 2; pavolmarko@128: return false; pavolmarko@128: } pavolmarko@129: if (m_Elements) pavolmarko@129: { pavolmarko@129: for (size_t i = 0; i < m_UsedSize; ++i) pavolmarko@129: newElements[i] = m_Elements[i]; pavolmarko@129: delete [] m_Elements; pavolmarko@129: } pavolmarko@128: m_Elements = newElements; pavolmarko@128: } pavolmarko@128: m_Elements[m_UsedSize++] = val; pavolmarko@128: return true; pavolmarko@128: } dvander@252: pavolmarko@128: void pop() pavolmarko@128: { pavolmarko@128: --m_UsedSize; pavolmarko@128: } pavolmarko@128: dvander@252: void popall() dvander@252: { dvander@252: m_UsedSize = 0; dvander@252: } dvander@252: pavolmarko@128: T &front() pavolmarko@128: { pavolmarko@128: return m_Elements[m_UsedSize - 1]; pavolmarko@128: } pavolmarko@128: pavolmarko@128: const T &front() const pavolmarko@128: { pavolmarko@128: return m_Elements[m_UsedSize - 1]; pavolmarko@128: } pavolmarko@128: pavolmarko@162: T &second() pavolmarko@162: { pavolmarko@162: return m_Elements[m_UsedSize - 2]; pavolmarko@162: } pavolmarko@162: pavolmarko@162: const T &second() const pavolmarko@162: { pavolmarko@162: return m_Elements[m_UsedSize - 2]; pavolmarko@162: } pavolmarko@162: pavolmarko@128: iterator begin() pavolmarko@128: { pavolmarko@128: return iterator(this, 0); pavolmarko@128: } pavolmarko@128: iterator end() pavolmarko@128: { pavolmarko@128: return iterator(this, m_UsedSize); pavolmarko@128: } pavolmarko@129: pavolmarko@129: size_t size() pavolmarko@129: { pavolmarko@129: return m_UsedSize; pavolmarko@129: } pavolmarko@129: size_t capacity() pavolmarko@129: { pavolmarko@129: return m_AllocatedSize; pavolmarko@129: } pavolmarko@129: bool empty() pavolmarko@129: { pavolmarko@129: return m_UsedSize == 0 ? true : false; pavolmarko@129: } pavolmarko@129: bool reserve(size_t size) pavolmarko@129: { pavolmarko@129: if (size > m_AllocatedSize) pavolmarko@129: { pavolmarko@129: T *newElements = new T[size]; pavolmarko@129: if (!newElements) pavolmarko@129: return false; pavolmarko@129: if (m_Elements) pavolmarko@129: { pavolmarko@129: for (size_t i = 0; i < m_UsedSize; ++i) pavolmarko@129: newElements[i] = m_Elements[i]; pavolmarko@129: delete [] m_Elements; pavolmarko@129: } pavolmarko@129: m_Elements = newElements; pavolmarko@129: m_AllocatedSize = size; pavolmarko@129: } pavolmarko@129: return true; pavolmarko@129: } pavolmarko@128: }; pavolmarko@128: }; //namespace SourceHook pavolmarko@128: pavolmarko@128: #endif