Dev/stack.cpp at master · vladimir454/Dev · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include <iostream>
#include <map>
#include <string>
#include <algorithm>
#include <memory>
#include <unordered_map>

using namespace std;
//IDL

template <typename T, int MAXVALUE>
class Stack
{
    int m_top;
    T data[MAXVALUE];

    public:

    Stack():m_top(-1){}

    void push(T value )
    {
        if (m_top>MAXVALUE)
        {
            throw "its full";
        }
        data[++m_top]=value;
    }

    T pop()
    {

        if (empty())
        {
            throw "empty";
        }

        --m_top;
    }
    int top()
    {

        return data[m_top];
    }
    bool empty()
    {

        return m_top<0;
    }


};

int main()
{
    Stack<int, 10> s;
    s.push(4);
    s.push(5);
    s.push(10);
    s.push(6);

    while (!s.empty())
    {
        std::cout << s.top() << '\n';
        s.pop();
    }

}