node.cpp 4.85 KB
Newer Older
beder's avatar
beder committed
1
#include "node.h"
2
3
#include "token.h"
#include "scanner.h"
4
#include "content.h"
beder's avatar
beder committed
5
6
7
#include "parser.h"
#include "scalar.h"
#include "sequence.h"
8
#include "map.h"
beder's avatar
beder committed
9
10
11

namespace YAML
{
12
	Node::Node(): m_pContent(0), m_alias(false)
beder's avatar
beder committed
13
14
15
16
	{
	}

	Node::~Node()
17
18
19
20
21
22
23
24
	{
		Clear();
	}

	void Node::Clear()
	{
		delete m_pContent;
		m_pContent = 0;
25
		m_alias = false;
26
	}
27

28
	void Node::Parse(Scanner *pScanner, const ParserState& state)
29
	{
30
31
		Clear();

32
		ParseHeader(pScanner, state);
33

34
35
36
37
		// is this an alias? if so, it can have no content
		if(m_alias)
			return;

38
39
40
41
42
43
44
45
		// now split based on what kind of node we should be
		Token *pToken = pScanner->PeekNextToken();
		if(pToken->type == TT_DOC_END)
			return;

		switch(pToken->type) {
			case TT_SCALAR:
				m_pContent = new Scalar;
46
				m_pContent->Parse(pScanner, state);
47
48
49
50
51
				break;
			case TT_FLOW_SEQ_START:
			case TT_BLOCK_SEQ_START:
			case TT_BLOCK_ENTRY:
				m_pContent = new Sequence;
52
				m_pContent->Parse(pScanner, state);
53
54
55
56
				break;
			case TT_FLOW_MAP_START:
			case TT_BLOCK_MAP_START:
				m_pContent = new Map;
57
				m_pContent->Parse(pScanner, state);
58
59
60
61
62
		}
	}

	// ParseHeader
	// . Grabs any tag, alias, or anchor tokens and deals with them.
63
	void Node::ParseHeader(Scanner *pScanner, const ParserState& state)
64
65
66
	{
		while(1) {
			Token *pToken = pScanner->PeekNextToken();
67
			if(!pToken || (pToken->type != TT_TAG && pToken->type != TT_ANCHOR && pToken->type != TT_ALIAS))
68
69
70
				break;

			switch(pToken->type) {
71
72
73
				case TT_TAG: ParseTag(pScanner, state); break;
				case TT_ANCHOR: ParseAnchor(pScanner, state); break;
				case TT_ALIAS: ParseAlias(pScanner, state); break;
74
75
76
77
			}
		}
	}

78
	void Node::ParseTag(Scanner *pScanner, const ParserState& state)
79
80
81
82
83
	{
		if(m_tag != "")
			return;  // TODO: throw

		Token *pToken = pScanner->PeekNextToken();
84
85
		m_tag = state.TranslateTag(pToken->value);

86
87
88
89
90
		for(unsigned i=0;i<pToken->params.size();i++)
			m_tag += pToken->params[i];
		pScanner->PopNextToken();
	}
	
91
	void Node::ParseAnchor(Scanner *pScanner, const ParserState& state)
92
93
94
95
96
97
98
99
100
101
	{
		if(m_anchor != "")
			return;  // TODO: throw

		Token *pToken = pScanner->PeekNextToken();
		m_anchor = pToken->value;
		m_alias = false;
		pScanner->PopNextToken();
	}

102
	void Node::ParseAlias(Scanner *pScanner, const ParserState& state)
103
104
105
106
107
108
109
110
111
112
113
114
	{
		if(m_anchor != "")
			return;  // TODO: throw
		if(m_tag != "")
			return;  // TODO: throw (aliases can't have any content, *including* tags)

		Token *pToken = pScanner->PeekNextToken();
		m_anchor = pToken->value;
		m_alias = true;
		pScanner->PopNextToken();
	}

115
116
	void Node::Write(std::ostream& out, int indent)
	{
117
118
119
120
121
122
123
124
125
126
127
128
129
130
		if(m_tag != "") {
			for(int i=0;i<indent;i++)
				out << "  ";
			out << "{tag: " << m_tag << "}\n";
		}
		if(m_anchor != "") {
			for(int i=0;i<indent;i++)
				out << "  ";
			if(m_alias)
				out << "{alias: " << m_anchor << "}\n";
			else
				out << "{anchor: " << m_anchor << "}\n";
		}

131
132
133
134
		if(!m_pContent) {
			for(int i=0;i<indent;i++)
				out << "  ";
			out << "{no content}\n";
135
		} else {
136
			m_pContent->Write(out, indent);
137
		}
138
	}
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233

	// begin
	// Returns an iterator to the beginning of this (sequence or map).
	Node::Iterator Node::begin() const
	{
		if(!m_pContent)
			return Iterator();

		std::vector <Node *>::const_iterator seqIter;
		if(m_pContent->GetBegin(seqIter))
			return Iterator(seqIter);

		std::map <Node *, Node *>::const_iterator mapIter;
		if(m_pContent->GetBegin(mapIter))
			return Iterator(mapIter);

		return Iterator();
	}

	// end
	// . Returns an iterator to the end of this (sequence or map).
	Node::Iterator Node::end() const
	{
		if(!m_pContent)
			return Iterator();

		std::vector <Node *>::const_iterator seqIter;
		if(m_pContent->GetEnd(seqIter))
			return Iterator(seqIter);

		std::map <Node *, Node *>::const_iterator mapIter;
		if(m_pContent->GetEnd(mapIter))
			return Iterator(mapIter);

		return Iterator();
	}

	///////////////////////////////////////////////////////
	// Extraction

	void operator >> (const Node& node, std::string& s)
	{
		if(!node.m_pContent)
			throw;

		node.m_pContent->Read(s);
	}

	void operator >> (const Node& node, int& i)
	{
		if(!node.m_pContent)
			throw;

		node.m_pContent->Read(i);
	}

	void operator >> (const Node& node, unsigned& u)
	{
		if(!node.m_pContent)
			throw;

		node.m_pContent->Read(u);
	}

	void operator >> (const Node& node, long& l)
	{
		if(!node.m_pContent)
			throw;

		node.m_pContent->Read(l);
	}

	void operator >> (const Node& node, float& f)
	{
		if(!node.m_pContent)
			throw;

		node.m_pContent->Read(f);
	}

	void operator >> (const Node& node, double& d)
	{
		if(!node.m_pContent)
			throw;

		node.m_pContent->Read(d);
	}

	void operator >> (const Node& node, char& c)
	{
		if(!node.m_pContent)
			throw;

		node.m_pContent->Read(c);
	}
beder's avatar
beder committed
234
}