VMEngine/DataStack.cpp at master · tt-jsr/VMEngine · 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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include "stdafx.h"
#include "DataStack.h"
#include "Data.h"

namespace vm
{
    DataStack::DataStack(void)
    {
    }


    DataStack::~DataStack(void)
    {
    }

    void DataStack::Dump(std::ostream& strm)
    {
        if (stack.size() == 0)
		{
            strm << "Empty" << std::endl;
            return;
		}
        for (int idx = (int)stack.size()-1; idx >= 0; --idx)
        {
            stack[idx]->Dump(strm) << std::endl;
        }
    }

    int DataStack::Size()
    {
        return (int)stack.size();
    }

    void DataStack::Clear()
	{
        stack.clear();
	}

    int DataStack::Tos()
    {
        return (int)stack.size();
    }

    void DataStack::Push(Data d)
    {
        stack.push_back(d);
    }

    void DataStack::Push(const std::string& s)
    {
        stack.push_back(DataObj::CreateString(s));
    }

    void DataStack::Push(int n)
    {
        stack.push_back(DataObj::CreateInt(n));
    }

    void DataStack::Push(const std::vector<Data>& v)
    {
        stack.push_back(DataObj::CreateArray(v));
	}

    Data DataStack::Pop()
    {
        if (stack.size() == 0)
        {
            return nullptr;
        }
        Data p = stack[stack.size()-1];
        stack.pop_back();
        return p;
    }

    Data DataStack::Peek(int n)
    {
        if (n < 0)
        {
            return nullptr;
        }
        int idx = (int)stack.size()-n-1;
        if (idx < 0)
        {
            return nullptr;
        }
        return stack[idx];
    }
}