node.h 3.11 KB
Newer Older
1
2
3
4
5
6
7
8
9
#pragma once

#include <string>
#include <ios>
#include <vector>
#include <map>
#include "parserstate.h"
#include "exceptions.h"
#include "iterator.h"
10
#include "conversion.h"
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

namespace YAML
{
	class Content;
	class Scanner;

	enum CONTENT_TYPE { CT_NONE, CT_SCALAR, CT_SEQUENCE, CT_MAP };

	class Node
	{
	public:
		Node();
		~Node();

		void Clear();
		void Parse(Scanner *pScanner, const ParserState& state);
		void Write(std::ostream& out, int indent, bool startedLine, bool onlyOneCharOnLine) const;

		CONTENT_TYPE GetType() const;

31
32
33
34
		// file location of start of this node
		int GetLine() const { return m_line; }
		int GetColumn() const { return m_column; }

35
36
37
38
39
		// accessors
		Iterator begin() const;
		Iterator end() const;
		unsigned size() const;

40
		// extraction of scalars
41
42
43
		bool GetScalar(std::string& s) const;

		// we can specialize this for other values
44
		template <typename T>
45
		bool Read(T& value) const;
46

47
48
		template <typename T>
		friend void operator >> (const Node& node, T& value);
49

50
		// just for maps
51
		template <typename T>
52
		const Node& GetValue(const T& key) const;
53

54
55
56
57
		template <typename T>
		const Node& operator [] (const T& key) const;

		const Node& operator [] (const char *key) const;
58

59
		// just for sequences
60
61
62
		const Node& operator [] (unsigned u) const;
		const Node& operator [] (int i) const;

63
64
65
66
67
		// for anchors/aliases
		const Node *Identity() const { return m_pIdentity; }
		bool IsAlias() const { return m_alias; }
		bool IsReferenced() const { return m_referenced; }

68
69
70
71
72
73
74
		// insertion
		friend std::ostream& operator << (std::ostream& out, const Node& node);

		// ordering
		int Compare(const Node& rhs) const;
		friend bool operator < (const Node& n1, const Node& n2);

jbeder's avatar
jbeder committed
75
76
77
78
79
	private:
		// shouldn't be copyable! (at least for now)
		Node(const Node& rhs);
		Node& operator = (const Node& rhs);

80
81
82
83
84
85
86
	private:
		void ParseHeader(Scanner *pScanner, const ParserState& state);
		void ParseTag(Scanner *pScanner, const ParserState& state);
		void ParseAnchor(Scanner *pScanner, const ParserState& state);
		void ParseAlias(Scanner *pScanner, const ParserState& state);

	private:
87
		int m_line, m_column;
88
89
90
		std::string m_anchor, m_tag;
		Content *m_pContent;
		bool m_alias;
91
92
		const Node *m_pIdentity;
		mutable bool m_referenced;
93
	};
94
95
96

	// templated things we need to keep inline in the header
	template <typename T>
97
98
99
100
101
102
	inline bool Node::Read(T& value) const {
		std::string scalar;
		if(!GetScalar(scalar))
			return false;

		return Convert(scalar, value);
103
104
105
106
107
	}

	template <typename T>
	inline void operator >> (const Node& node, T& value)
	{
108
		if(!node.Read(value))
109
			throw InvalidScalar(node.m_line, node.m_column);
110
111
112
113
114
115
116
117
118
119
	}

	template <typename T>
	inline const Node& Node::GetValue(const T& key) const
	{
		if(!m_pContent)
			throw BadDereference();

		for(Iterator it=begin();it!=end();++it) {
			T t;
120
			if(it.first().Read(t)) {
121
122
123
124
125
				if(key == t)
					return it.second();
			}
		}

126
		throw MakeTypedKeyNotFound(m_line, m_column, key);
127
128
129
130
131
132
133
134
135
136
137
138
	}

	template <typename T>
	inline const Node& Node::operator [] (const T& key) const
	{
		return GetValue(key);
	}

	inline const Node& Node::operator [] (const char *key) const
	{
		return GetValue(std::string(key));
	}
139
}