mirror of
https://github.com/jbeder/yaml-cpp.git
synced 2025-09-10 04:51:17 +00:00
0d5c57150c
* Add compilation flags: -Wshadow -Weffc++ -pedantic -pedantic-errors * Delete implicit copy & move constructors & assignment operators in classes with pointer data members. * An exception to the above: Add default copy & move constructors & assignment operators for the Binary class. * Convert boolean RegEx operators to binary operators. * Initialize all members in all classes in ctors. * Let default ctor delegate to the converting ctor in Binary and RegEx * Don't change any tests except regex_test (as a result of the change to binary operators). Note: https://bugzilla.redhat.com/show_bug.cgi?id=1544675 makes -Weffc++ report a false positive in "include/yaml-cpp/node/impl.h".
136 lines
3.2 KiB
C++
136 lines
3.2 KiB
C++
#include <assert.h>
|
|
#include <cassert>
|
|
|
|
#include "nodebuilder.h"
|
|
#include "yaml-cpp/node/detail/node.h"
|
|
#include "yaml-cpp/node/impl.h"
|
|
#include "yaml-cpp/node/node.h"
|
|
#include "yaml-cpp/node/type.h"
|
|
|
|
namespace YAML {
|
|
struct Mark;
|
|
|
|
NodeBuilder::NodeBuilder()
|
|
: m_pMemory(new detail::memory_holder),
|
|
m_pRoot(nullptr),
|
|
m_stack{},
|
|
m_anchors{},
|
|
m_keys{},
|
|
m_mapDepth(0) {
|
|
m_anchors.push_back(nullptr); // since the anchors start at 1
|
|
}
|
|
|
|
NodeBuilder::~NodeBuilder() {}
|
|
|
|
Node NodeBuilder::Root() {
|
|
if (!m_pRoot)
|
|
return Node();
|
|
|
|
return Node(*m_pRoot, m_pMemory);
|
|
}
|
|
|
|
void NodeBuilder::OnDocumentStart(const Mark&) {}
|
|
|
|
void NodeBuilder::OnDocumentEnd() {}
|
|
|
|
void NodeBuilder::OnNull(const Mark& mark, anchor_t anchor) {
|
|
detail::node& node = Push(mark, anchor);
|
|
node.set_null();
|
|
Pop();
|
|
}
|
|
|
|
void NodeBuilder::OnAlias(const Mark& /* mark */, anchor_t anchor) {
|
|
detail::node& node = *m_anchors[anchor];
|
|
Push(node);
|
|
Pop();
|
|
}
|
|
|
|
void NodeBuilder::OnScalar(const Mark& mark, const std::string& tag,
|
|
anchor_t anchor, const std::string& value) {
|
|
detail::node& node = Push(mark, anchor);
|
|
node.set_scalar(value);
|
|
node.set_tag(tag);
|
|
Pop();
|
|
}
|
|
|
|
void NodeBuilder::OnSequenceStart(const Mark& mark, const std::string& tag,
|
|
anchor_t anchor, EmitterStyle::value style) {
|
|
detail::node& node = Push(mark, anchor);
|
|
node.set_tag(tag);
|
|
node.set_type(NodeType::Sequence);
|
|
node.set_style(style);
|
|
}
|
|
|
|
void NodeBuilder::OnSequenceEnd() { Pop(); }
|
|
|
|
void NodeBuilder::OnMapStart(const Mark& mark, const std::string& tag,
|
|
anchor_t anchor, EmitterStyle::value style) {
|
|
detail::node& node = Push(mark, anchor);
|
|
node.set_type(NodeType::Map);
|
|
node.set_tag(tag);
|
|
node.set_style(style);
|
|
m_mapDepth++;
|
|
}
|
|
|
|
void NodeBuilder::OnMapEnd() {
|
|
assert(m_mapDepth > 0);
|
|
m_mapDepth--;
|
|
Pop();
|
|
}
|
|
|
|
detail::node& NodeBuilder::Push(const Mark& mark, anchor_t anchor) {
|
|
detail::node& node = m_pMemory->create_node();
|
|
node.set_mark(mark);
|
|
RegisterAnchor(anchor, node);
|
|
Push(node);
|
|
return node;
|
|
}
|
|
|
|
void NodeBuilder::Push(detail::node& node) {
|
|
const bool needsKey =
|
|
(!m_stack.empty() && m_stack.back()->type() == NodeType::Map &&
|
|
m_keys.size() < m_mapDepth);
|
|
|
|
m_stack.push_back(&node);
|
|
if (needsKey)
|
|
m_keys.push_back(PushedKey(&node, false));
|
|
}
|
|
|
|
void NodeBuilder::Pop() {
|
|
assert(!m_stack.empty());
|
|
if (m_stack.size() == 1) {
|
|
m_pRoot = m_stack[0];
|
|
m_stack.pop_back();
|
|
return;
|
|
}
|
|
|
|
detail::node& node = *m_stack.back();
|
|
m_stack.pop_back();
|
|
|
|
detail::node& collection = *m_stack.back();
|
|
|
|
if (collection.type() == NodeType::Sequence) {
|
|
collection.push_back(node, m_pMemory);
|
|
} else if (collection.type() == NodeType::Map) {
|
|
assert(!m_keys.empty());
|
|
PushedKey& key = m_keys.back();
|
|
if (key.second) {
|
|
collection.insert(*key.first, node, m_pMemory);
|
|
m_keys.pop_back();
|
|
} else {
|
|
key.second = true;
|
|
}
|
|
} else {
|
|
assert(false);
|
|
m_stack.clear();
|
|
}
|
|
}
|
|
|
|
void NodeBuilder::RegisterAnchor(anchor_t anchor, detail::node& node) {
|
|
if (anchor) {
|
|
assert(anchor == m_anchors.size());
|
|
m_anchors.push_back(&node);
|
|
}
|
|
}
|
|
} // namespace YAML
|