s4g_stack.h

См. документацию.

/*
Copyright © Vitaliy Buturlin, Evgeny Danilovich, 2017
license MIT see in LICENSE or
https://s4g.su/
*/

#ifndef __S4G_STACK_H
#define __S4G_STACK_H

#include <common/array.h>

template <typename T, int BlockSize = 16>
class s4g_Stack
{
public:
    s4g_Stack(){ m_iCount = 0; m_Arr.resize(BlockSize); }

    int getSize()
    {
        return m_iCount;
    }

    void setStartSize(int iCount)
    {
        if (iCount > m_Arr.size())
            m_Arr.resize(iCount);
        else
            m_iCount = iCount;
    }

    void clear()
    {
        m_Arr.clear();
        m_iCount = 0;
    }

    void reserve(int iCount)
    {
        m_Arr.reserve(iCount);
    }

    void push(T val)
    {
        m_Arr[m_iCount] = val;
        ++m_iCount;
    }

    void pushReplaceTop(T val)
    {
        if (m_iCount > 0)
        {
            m_Arr[m_iCount - 1] = val;
        }
        else
            push(val);
    }

    void push_back(T val)
    {
        push(val);
    }

    void pop(int iCount=1)
    {
        if (iCount > m_iCount)
            m_iCount = 0;
        else
            m_iCount -= iCount;
    }

    T& get(int id)
    {
        if (id >= 0 && id < m_iCount)
        {
            return m_Arr[id];
        }
        else if (id < 0)
        {
            if ((m_iCount + id) >= 0 && (m_iCount + id) < m_iCount)
                return m_Arr[m_iCount + id];
            else if (m_iCount == 0 && id == -1)
                return m_Arr[0];
            else
            {
                DBG_BREAK;
            }
        }
        else if (id >= m_iCount)
        {
            m_iCount = id+1;
            return m_Arr[id];
        }
    }

    T& operator[](int id)
    {
        return get(id);
    }

    T& getTop()
    {
        return get(-1);
    }

protected:
    int m_iCount;
    Array<T, BlockSize> m_Arr;
};

#endif