378 lines
8.8 KiB
C++
378 lines
8.8 KiB
C++
#ifndef NODE_IMPL_H_62B23520_7C8E_11DE_8A39_0800200C9A66
|
|
#define NODE_IMPL_H_62B23520_7C8E_11DE_8A39_0800200C9A66
|
|
|
|
#if defined(_MSC_VER) || (defined(__GNUC__) && (__GNUC__ == 3 && __GNUC_MINOR__ >= 4) || (__GNUC__ >= 4)) // GCC supports "pragma once" correctly since 3.4
|
|
#pragma once
|
|
#endif
|
|
|
|
|
|
#include "yaml-cpp/node/node.h"
|
|
#include "yaml-cpp/node/iterator.h"
|
|
#include "yaml-cpp/node/detail/memory.h"
|
|
#include "yaml-cpp/node/detail/node.h"
|
|
#include "yaml-cpp/exceptions.h"
|
|
#include <string>
|
|
|
|
namespace YAML
|
|
{
|
|
inline Node::Node(): m_pNode(0)
|
|
{
|
|
}
|
|
|
|
inline Node::Node(NodeType::value type): m_pMemory(new detail::memory_holder), m_pNode(&m_pMemory->create_node())
|
|
{
|
|
m_pNode->set_type(type);
|
|
}
|
|
|
|
template<typename T>
|
|
inline Node::Node(const T& rhs): m_pMemory(new detail::memory_holder), m_pNode(&m_pMemory->create_node())
|
|
{
|
|
Assign(rhs);
|
|
}
|
|
|
|
inline Node::Node(const detail::iterator_value& rhs): m_pMemory(rhs.m_pMemory), m_pNode(rhs.m_pNode)
|
|
{
|
|
}
|
|
|
|
inline Node::Node(const Node& rhs): m_pMemory(rhs.m_pMemory), m_pNode(rhs.m_pNode)
|
|
{
|
|
}
|
|
|
|
inline Node::Node(detail::node& node, detail::shared_memory_holder pMemory): m_pMemory(pMemory), m_pNode(&node)
|
|
{
|
|
}
|
|
|
|
inline Node::~Node()
|
|
{
|
|
}
|
|
|
|
inline void Node::EnsureNodeExists() const
|
|
{
|
|
if(!m_pNode) {
|
|
m_pMemory.reset(new detail::memory_holder);
|
|
m_pNode = &m_pMemory->create_node();
|
|
m_pNode->set_null();
|
|
}
|
|
}
|
|
|
|
inline bool Node::IsDefined() const
|
|
{
|
|
return m_pNode ? m_pNode->is_defined() : true;
|
|
}
|
|
|
|
inline NodeType::value Node::Type() const
|
|
{
|
|
return m_pNode ? m_pNode->type() : NodeType::Null;
|
|
}
|
|
|
|
// access
|
|
|
|
// template helpers
|
|
template<typename T, typename S>
|
|
struct as_if {
|
|
explicit as_if(const Node& node_): node(node_) {}
|
|
const Node& node;
|
|
|
|
const T operator()(const S& fallback) const {
|
|
if(!node.m_pNode)
|
|
return fallback;
|
|
|
|
T t;
|
|
if(convert<T>::decode(node, t))
|
|
return t;
|
|
return fallback;
|
|
}
|
|
};
|
|
|
|
template<typename S>
|
|
struct as_if<std::string, S> {
|
|
explicit as_if(const Node& node_): node(node_) {}
|
|
const Node& node;
|
|
|
|
const std::string operator()(const S& fallback) const {
|
|
if(node.Type() != NodeType::Scalar)
|
|
return fallback;
|
|
return node.Scalar();
|
|
}
|
|
};
|
|
|
|
template<typename T>
|
|
struct as_if<T, void> {
|
|
explicit as_if(const Node& node_): node(node_) {}
|
|
const Node& node;
|
|
|
|
const T operator()() const {
|
|
if(!node.m_pNode)
|
|
throw TypedBadConversion<T>();
|
|
|
|
T t;
|
|
if(convert<T>::decode(node, t))
|
|
return t;
|
|
throw TypedBadConversion<T>();
|
|
}
|
|
};
|
|
|
|
template<>
|
|
struct as_if<std::string, void> {
|
|
explicit as_if(const Node& node_): node(node_) {}
|
|
const Node& node;
|
|
|
|
const std::string operator()() const {
|
|
if(node.Type() != NodeType::Scalar)
|
|
throw TypedBadConversion<std::string>();
|
|
return node.Scalar();
|
|
}
|
|
};
|
|
|
|
// access functions
|
|
template<typename T>
|
|
inline const T Node::as() const
|
|
{
|
|
return as_if<T, void>(*this)();
|
|
}
|
|
|
|
template<typename T, typename S>
|
|
inline const T Node::as(const S& fallback) const
|
|
{
|
|
return as_if<T, S>(*this)(fallback);
|
|
}
|
|
|
|
inline const std::string& Node::Scalar() const
|
|
{
|
|
return m_pNode ? m_pNode->scalar() : detail::node_data::empty_scalar;
|
|
}
|
|
|
|
inline const std::string& Node::Tag() const
|
|
{
|
|
return m_pNode ? m_pNode->tag() : detail::node_data::empty_scalar;
|
|
}
|
|
|
|
inline void Node::SetTag(const std::string& tag)
|
|
{
|
|
EnsureNodeExists();
|
|
m_pNode->set_tag(tag);
|
|
}
|
|
|
|
// assignment
|
|
inline bool Node::is(const Node& rhs) const
|
|
{
|
|
if(!m_pNode || !rhs.m_pNode)
|
|
return false;
|
|
return m_pNode->is(*rhs.m_pNode);
|
|
}
|
|
|
|
template<typename T>
|
|
inline Node& Node::operator=(const T& rhs)
|
|
{
|
|
Assign(rhs);
|
|
return *this;
|
|
}
|
|
|
|
template<typename T>
|
|
inline void Node::Assign(const T& rhs)
|
|
{
|
|
AssignData(convert<T>::encode(rhs));
|
|
}
|
|
|
|
template<>
|
|
inline void Node::Assign(const std::string& rhs)
|
|
{
|
|
EnsureNodeExists();
|
|
m_pNode->set_scalar(rhs);
|
|
}
|
|
|
|
inline void Node::Assign(const char *rhs)
|
|
{
|
|
EnsureNodeExists();
|
|
m_pNode->set_scalar(rhs);
|
|
}
|
|
|
|
inline void Node::Assign(char *rhs)
|
|
{
|
|
EnsureNodeExists();
|
|
m_pNode->set_scalar(rhs);
|
|
}
|
|
|
|
inline Node& Node::operator=(const Node& rhs)
|
|
{
|
|
if(is(rhs))
|
|
return *this;
|
|
AssignNode(rhs);
|
|
return *this;
|
|
}
|
|
|
|
inline void Node::AssignData(const Node& rhs)
|
|
{
|
|
EnsureNodeExists();
|
|
rhs.EnsureNodeExists();
|
|
|
|
m_pNode->set_data(*rhs.m_pNode);
|
|
m_pMemory->merge(*rhs.m_pMemory);
|
|
}
|
|
|
|
inline void Node::AssignNode(const Node& rhs)
|
|
{
|
|
rhs.EnsureNodeExists();
|
|
|
|
if(!m_pNode) {
|
|
m_pNode = rhs.m_pNode;
|
|
m_pMemory = rhs.m_pMemory;
|
|
return;
|
|
}
|
|
|
|
m_pNode->set_ref(*rhs.m_pNode);
|
|
m_pMemory->merge(*rhs.m_pMemory);
|
|
m_pNode = rhs.m_pNode;
|
|
}
|
|
|
|
// size/iterator
|
|
inline std::size_t Node::size() const
|
|
{
|
|
return m_pNode ? m_pNode->size() : 0;
|
|
}
|
|
|
|
inline const_iterator Node::begin() const
|
|
{
|
|
return m_pNode ? const_iterator(m_pNode->begin(), m_pMemory) : const_iterator();
|
|
}
|
|
|
|
inline iterator Node::begin()
|
|
{
|
|
return m_pNode ? iterator(m_pNode->begin(), m_pMemory) : iterator();
|
|
}
|
|
|
|
inline const_iterator Node::end() const
|
|
{
|
|
return m_pNode ? const_iterator(m_pNode->end(), m_pMemory) : const_iterator();
|
|
}
|
|
|
|
inline iterator Node::end()
|
|
{
|
|
return m_pNode ? iterator(m_pNode->end(), m_pMemory) : iterator();
|
|
}
|
|
|
|
// sequence
|
|
template<typename T>
|
|
inline void Node::push_back(const T& rhs)
|
|
{
|
|
push_back(Node(rhs));
|
|
}
|
|
|
|
inline void Node::push_back(const Node& rhs)
|
|
{
|
|
EnsureNodeExists();
|
|
rhs.EnsureNodeExists();
|
|
|
|
m_pNode->push_back(*rhs.m_pNode, m_pMemory);
|
|
m_pMemory->merge(*rhs.m_pMemory);
|
|
}
|
|
|
|
// helpers for indexing
|
|
namespace detail {
|
|
template<typename T>
|
|
struct to_value_t {
|
|
explicit to_value_t(const T& t_): t(t_) {}
|
|
const T& t;
|
|
typedef const T& return_type;
|
|
|
|
const T& operator()() const { return t; }
|
|
};
|
|
|
|
template<>
|
|
struct to_value_t<const char*> {
|
|
explicit to_value_t(const char *t_): t(t_) {}
|
|
const char *t;
|
|
typedef std::string return_type;
|
|
|
|
const std::string operator()() const { return t; }
|
|
};
|
|
|
|
template<>
|
|
struct to_value_t<char*> {
|
|
explicit to_value_t(char *t_): t(t_) {}
|
|
const char *t;
|
|
typedef std::string return_type;
|
|
|
|
const std::string operator()() const { return t; }
|
|
};
|
|
|
|
template<std::size_t N>
|
|
struct to_value_t<char [N]> {
|
|
explicit to_value_t(const char *t_): t(t_) {}
|
|
const char *t;
|
|
typedef std::string return_type;
|
|
|
|
const std::string operator()() const { return t; }
|
|
};
|
|
|
|
// converts C-strings to std::strings so they can be copied
|
|
template<typename T>
|
|
inline typename to_value_t<T>::return_type to_value(const T& t) {
|
|
return to_value_t<T>(t)();
|
|
}
|
|
}
|
|
|
|
// indexing
|
|
template<typename Key>
|
|
inline const Node Node::operator[](const Key& key) const
|
|
{
|
|
EnsureNodeExists();
|
|
detail::node& value = static_cast<const detail::node&>(*m_pNode).get(detail::to_value(key), m_pMemory);
|
|
return Node(value, m_pMemory);
|
|
}
|
|
|
|
template<typename Key>
|
|
inline Node Node::operator[](const Key& key)
|
|
{
|
|
EnsureNodeExists();
|
|
detail::node& value = m_pNode->get(detail::to_value(key), m_pMemory);
|
|
return Node(value, m_pMemory);
|
|
}
|
|
|
|
template<typename Key>
|
|
inline bool Node::remove(const Key& key)
|
|
{
|
|
EnsureNodeExists();
|
|
return m_pNode->remove(detail::to_value(key), m_pMemory);
|
|
}
|
|
|
|
inline const Node Node::operator[](const Node& key) const
|
|
{
|
|
EnsureNodeExists();
|
|
key.EnsureNodeExists();
|
|
detail::node& value = static_cast<const detail::node&>(*m_pNode).get(*key.m_pNode, m_pMemory);
|
|
return Node(value, m_pMemory);
|
|
}
|
|
|
|
inline Node Node::operator[](const Node& key)
|
|
{
|
|
EnsureNodeExists();
|
|
key.EnsureNodeExists();
|
|
detail::node& value = m_pNode->get(*key.m_pNode, m_pMemory);
|
|
return Node(value, m_pMemory);
|
|
}
|
|
|
|
inline bool Node::remove(const Node& key)
|
|
{
|
|
EnsureNodeExists();
|
|
key.EnsureNodeExists();
|
|
return m_pNode->remove(*key.m_pNode, m_pMemory);
|
|
}
|
|
|
|
// map
|
|
template<typename Key, typename Value>
|
|
inline void Node::force_insert(const Key& key, const Value& value)
|
|
{
|
|
EnsureNodeExists();
|
|
m_pNode->force_insert(detail::to_value(key), detail::to_value(value), m_pMemory);
|
|
}
|
|
|
|
// free functions
|
|
inline bool operator==(const Node& lhs, const Node& rhs)
|
|
{
|
|
return lhs.is(rhs);
|
|
}
|
|
}
|
|
|
|
#endif // NODE_IMPL_H_62B23520_7C8E_11DE_8A39_0800200C9A66
|