map.cpp 4.39 KB
Newer Older
1
2
#include "map.h"
#include "node.h"
3
4
#include "scanner.h"
#include "token.h"
Jesse Beder's avatar
Jesse Beder committed
5
#include "exceptions.h"
6
7
8
9
10
11
12
13

namespace YAML
{
	Map::Map()
	{
	}

	Map::~Map()
14
15
16
17
18
	{
		Clear();
	}

	void Map::Clear()
19
20
21
22
23
	{
		for(node_map::const_iterator it=m_data.begin();it!=m_data.end();++it) {
			delete it->first;
			delete it->second;
		}
24
		m_data.clear();
25
	}
26

27
	bool Map::GetBegin(std::map <Node *, Node *, ltnode>::const_iterator& it) const
28
29
30
31
32
	{
		it = m_data.begin();
		return true;
	}

33
	bool Map::GetEnd(std::map <Node *, Node *, ltnode>::const_iterator& it) const
34
35
36
37
38
	{
		it = m_data.end();
		return true;
	}

39
	void Map::Parse(Scanner *pScanner, const ParserState& state)
40
	{
41
42
43
44
		Clear();

		// split based on start token
		Token *pToken = pScanner->PeekNextToken();
45
46

		switch(pToken->type) {
47
48
			case TT_BLOCK_MAP_START: ParseBlock(pScanner, state); break;
			case TT_FLOW_MAP_START: ParseFlow(pScanner, state); break;
49
50
51
		}
	}

52
	void Map::ParseBlock(Scanner *pScanner, const ParserState& state)
53
	{
54
55
56
		// eat start token
		pScanner->EatNextToken();

57
58
59
		while(1) {
			Token *pToken = pScanner->PeekNextToken();
			if(!pToken)
60
				throw ParserException(-1, -1, ErrorMsg::END_OF_MAP);
61
62

			if(pToken->type != TT_KEY && pToken->type != TT_BLOCK_END)
63
				throw ParserException(pToken->line, pToken->column, ErrorMsg::END_OF_MAP);
64
65
66
67
68
69
70
71

			pScanner->PopNextToken();
			if(pToken->type == TT_BLOCK_END)
				break;

			Node *pKey = new Node;
			Node *pValue = new Node;

72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
			try {
				// grab key
				pKey->Parse(pScanner, state);

				// now grab value (optional)
				if(pScanner->PeekNextToken() && pScanner->PeekNextToken()->type == TT_VALUE) {
					pScanner->PopNextToken();
					pValue->Parse(pScanner, state);
				}

				m_data[pKey] = pValue;
			} catch(Exception& e) {
				delete pKey;
				delete pValue;
				throw e;
87
88
89
90
			}
		}
	}

91
	void Map::ParseFlow(Scanner *pScanner, const ParserState& state)
92
	{
93
94
95
		// eat start token
		pScanner->EatNextToken();

96
97
98
		while(1) {
			Token *pToken = pScanner->PeekNextToken();
			if(!pToken)
99
				throw ParserException(-1, -1, ErrorMsg::END_OF_MAP_FLOW);
100
101
102
103
104
105
106
107
108

			// first check for end
			if(pToken->type == TT_FLOW_MAP_END) {
				pScanner->EatNextToken();
				break;
			}

			// now it better be a key
			if(pToken->type != TT_KEY)
109
				throw ParserException(pToken->line, pToken->column, ErrorMsg::END_OF_MAP_FLOW);
110
111
112
113
114
115

			pScanner->PopNextToken();

			Node *pKey = new Node;
			Node *pValue = new Node;

116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
			try {
				// grab key
				pKey->Parse(pScanner, state);

				// now grab value (optional)
				if(pScanner->PeekNextToken() && pScanner->PeekNextToken()->type == TT_VALUE) {
					pScanner->PopNextToken();
					pValue->Parse(pScanner, state);
				}

				// now eat the separator (or could be a map end, which we ignore - but if it's neither, then it's a bad node)
				pToken = pScanner->PeekNextToken();
				if(pToken->type == TT_FLOW_ENTRY)
					pScanner->EatNextToken();
				else if(pToken->type != TT_FLOW_MAP_END)
131
					throw ParserException(pToken->line, pToken->column, ErrorMsg::END_OF_MAP_FLOW);
132
133
134
135
136
137
138

				m_data[pKey] = pValue;
			} catch(Exception& e) {
				// clean up and rethrow
				delete pKey;
				delete pValue;
				throw e;
139
140
141
142
			}
		}
	}

143
	void Map::Write(std::ostream& out, int indent, bool startedLine, bool onlyOneCharOnLine)
144
	{
145
146
		if(startedLine && !onlyOneCharOnLine)
			out << std::endl;
147
148

		for(node_map::const_iterator it=m_data.begin();it!=m_data.end();++it) {
149
150
151
152
			if((startedLine && !onlyOneCharOnLine) || it != m_data.begin()) {
				for(int i=0;i<indent;i++)
					out << "  ";
			}
153

154
155
156
157
			out << "? ";
			it->first->Write(out, indent + 1, true, it!= m_data.begin() || !startedLine || onlyOneCharOnLine);

			for(int i=0;i<indent;i++)
158
				out << "  ";
159
160
			out << ": ";
			it->second->Write(out, indent + 1, true, true);
161
		}
162
163
164

		if(m_data.empty())
			out << std::endl;
165
	}
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195

	int Map::Compare(Content *pContent)
	{
		return -pContent->Compare(this);
	}

	int Map::Compare(Map *pMap)
	{
		node_map::const_iterator it = m_data.begin(), jt = pMap->m_data.begin();
		while(1) {
			if(it == m_data.end()) {
				if(jt == pMap->m_data.end())
					return 0;
				else
					return -1;
			}
			if(jt == pMap->m_data.end())
				return 1;

			int cmp = it->first->Compare(*jt->first);
			if(cmp != 0)
				return cmp;

			cmp = it->second->Compare(*jt->second);
			if(cmp != 0)
				return cmp;
		}

		return 0;
	}
196
}