peisongxiao/yaml-cpp
1
0
Fork 0
mirror of https://github.com/jbeder/yaml-cpp.git synced 2025-09-09 12:41:17 +00:00
Code Issues Packages Projects Releases Wiki Activity

Renamed append -> push_back (to play nice with STL algorithms

Browse Source
This commit is contained in:
beder
2012-01-21 12:11:40 -06:00
parent 5647711578
commit 8d0ee05dbe
9 changed files with 18 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
include/yaml-cpp/node/convert.h
View File

@@ -149,7 +149,7 @@ namespace YAML
static Node encode(const std::vector<T>& rhs) {
Node node(NodeType::Sequence);
for(typename std::vector<T>::const_iterator it=rhs.begin();it!=rhs.end();++it)
node.append(*it);
node.push_back(*it);
return node;
}
@@ -170,7 +170,7 @@ namespace YAML
static Node encode(const std::list<T>& rhs) {
Node node(NodeType::Sequence);
for(typename std::list<T>::const_iterator it=rhs.begin();it!=rhs.end();++it)
node.append(*it);
node.push_back(*it);
return node;
}

4
include/yaml-cpp/node/detail/node.h
View File

@@ -87,8 +87,8 @@ namespace YAML
node_iterator end() { return m_pRef->end(); }
// sequence
void append(node& node, shared_memory_holder pMemory) {
m_pRef->append(node, pMemory);
void push_back(node& node, shared_memory_holder pMemory) {
m_pRef->push_back(node, pMemory);
node.add_dependency(*this);
}
void insert(node& key, node& value, shared_memory_holder pMemory) {

2
include/yaml-cpp/node/detail/node_data.h
View File

@@ -45,7 +45,7 @@ namespace YAML
node_iterator end();
// sequence
void append(node& node, shared_memory_holder pMemory);
void push_back(node& node, shared_memory_holder pMemory);
void insert(node& key, node& value, shared_memory_holder pMemory);
// indexing

2
include/yaml-cpp/node/detail/node_ref.h
View File

@@ -44,7 +44,7 @@ namespace YAML
node_iterator end() {return m_pData->end(); }
// sequence
void append(node& node, shared_memory_holder pMemory) { m_pData->append(node, pMemory); }
void push_back(node& node, shared_memory_holder pMemory) { m_pData->push_back(node, pMemory); }
void insert(node& key, node& value, shared_memory_holder pMemory) { m_pData->insert(key, value, pMemory); }
// indexing

8
include/yaml-cpp/node/impl.h
View File

@@ -252,17 +252,17 @@ namespace YAML
// sequence
template<typename T>
inline void Node::append(const T& rhs)
inline void Node::push_back(const T& rhs)
{
append(Node(rhs));
push_back(Node(rhs));
}
inline void Node::append(const Node& rhs)
inline void Node::push_back(const Node& rhs)
{
EnsureNodeExists();
rhs.EnsureNodeExists();
m_pNode->append(*rhs.m_pNode, m_pMemory);
m_pNode->push_back(*rhs.m_pNode, m_pMemory);
m_pMemory->merge(*rhs.m_pMemory);
}

4
include/yaml-cpp/node/node.h
View File

@@ -64,8 +64,8 @@ namespace YAML
iterator end();
// sequence
template<typename T> void append(const T& rhs);
void append(const Node& rhs);
template<typename T> void push_back(const T& rhs);
void push_back(const Node& rhs);
// indexing
template<typename Key> const Node operator[](const Key& key) const;