mirror of
https://github.com/jbeder/yaml-cpp.git
synced 2025-09-09 04:41:16 +00:00
[clang-tidy] convert several functions to use references (#894)
Found with performance-unnecessary-value-param Signed-off-by: Rosen Penev <rosenp@gmail.com>
This commit is contained in:
@@ -60,8 +60,8 @@ class YAML_CPP_API node_data {
|
|||||||
node_iterator end();
|
node_iterator end();
|
||||||
|
|
||||||
// sequence
|
// sequence
|
||||||
void push_back(node& node, shared_memory_holder pMemory);
|
void push_back(node& node, const shared_memory_holder& pMemory);
|
||||||
void insert(node& key, node& value, shared_memory_holder pMemory);
|
void insert(node& key, node& value, const shared_memory_holder& pMemory);
|
||||||
|
|
||||||
// indexing
|
// indexing
|
||||||
template <typename Key>
|
template <typename Key>
|
||||||
@@ -71,9 +71,9 @@ class YAML_CPP_API node_data {
|
|||||||
template <typename Key>
|
template <typename Key>
|
||||||
bool remove(const Key& key, shared_memory_holder pMemory);
|
bool remove(const Key& key, shared_memory_holder pMemory);
|
||||||
|
|
||||||
node* get(node& key, shared_memory_holder pMemory) const;
|
node* get(node& key, const shared_memory_holder& pMemory) const;
|
||||||
node& get(node& key, shared_memory_holder pMemory);
|
node& get(node& key, const shared_memory_holder& pMemory);
|
||||||
bool remove(node& key, shared_memory_holder pMemory);
|
bool remove(node& key, const shared_memory_holder& pMemory);
|
||||||
|
|
||||||
// map
|
// map
|
||||||
template <typename Key, typename Value>
|
template <typename Key, typename Value>
|
||||||
@@ -91,8 +91,8 @@ class YAML_CPP_API node_data {
|
|||||||
void reset_map();
|
void reset_map();
|
||||||
|
|
||||||
void insert_map_pair(node& key, node& value);
|
void insert_map_pair(node& key, node& value);
|
||||||
void convert_to_map(shared_memory_holder pMemory);
|
void convert_to_map(const shared_memory_holder& pMemory);
|
||||||
void convert_sequence_to_map(shared_memory_holder pMemory);
|
void convert_sequence_to_map(const shared_memory_holder& pMemory);
|
||||||
|
|
||||||
template <typename T>
|
template <typename T>
|
||||||
static node& convert_to_node(const T& rhs, shared_memory_holder pMemory);
|
static node& convert_to_node(const T& rhs, shared_memory_holder pMemory);
|
||||||
|
@@ -176,7 +176,8 @@ node_iterator node_data::end() {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// sequence
|
// sequence
|
||||||
void node_data::push_back(node& node, shared_memory_holder /* pMemory */) {
|
void node_data::push_back(node& node,
|
||||||
|
const shared_memory_holder& /* pMemory */) {
|
||||||
if (m_type == NodeType::Undefined || m_type == NodeType::Null) {
|
if (m_type == NodeType::Undefined || m_type == NodeType::Null) {
|
||||||
m_type = NodeType::Sequence;
|
m_type = NodeType::Sequence;
|
||||||
reset_sequence();
|
reset_sequence();
|
||||||
@@ -188,7 +189,8 @@ void node_data::push_back(node& node, shared_memory_holder /* pMemory */) {
|
|||||||
m_sequence.push_back(&node);
|
m_sequence.push_back(&node);
|
||||||
}
|
}
|
||||||
|
|
||||||
void node_data::insert(node& key, node& value, shared_memory_holder pMemory) {
|
void node_data::insert(node& key, node& value,
|
||||||
|
const shared_memory_holder& pMemory) {
|
||||||
switch (m_type) {
|
switch (m_type) {
|
||||||
case NodeType::Map:
|
case NodeType::Map:
|
||||||
break;
|
break;
|
||||||
@@ -205,7 +207,8 @@ void node_data::insert(node& key, node& value, shared_memory_holder pMemory) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// indexing
|
// indexing
|
||||||
node* node_data::get(node& key, shared_memory_holder /* pMemory */) const {
|
node* node_data::get(node& key,
|
||||||
|
const shared_memory_holder& /* pMemory */) const {
|
||||||
if (m_type != NodeType::Map) {
|
if (m_type != NodeType::Map) {
|
||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
@@ -218,7 +221,7 @@ node* node_data::get(node& key, shared_memory_holder /* pMemory */) const {
|
|||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
node& node_data::get(node& key, shared_memory_holder pMemory) {
|
node& node_data::get(node& key, const shared_memory_holder& pMemory) {
|
||||||
switch (m_type) {
|
switch (m_type) {
|
||||||
case NodeType::Map:
|
case NodeType::Map:
|
||||||
break;
|
break;
|
||||||
@@ -241,7 +244,7 @@ node& node_data::get(node& key, shared_memory_holder pMemory) {
|
|||||||
return value;
|
return value;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool node_data::remove(node& key, shared_memory_holder /* pMemory */) {
|
bool node_data::remove(node& key, const shared_memory_holder& /* pMemory */) {
|
||||||
if (m_type != NodeType::Map)
|
if (m_type != NodeType::Map)
|
||||||
return false;
|
return false;
|
||||||
|
|
||||||
@@ -284,7 +287,7 @@ void node_data::insert_map_pair(node& key, node& value) {
|
|||||||
m_undefinedPairs.emplace_back(&key, &value);
|
m_undefinedPairs.emplace_back(&key, &value);
|
||||||
}
|
}
|
||||||
|
|
||||||
void node_data::convert_to_map(shared_memory_holder pMemory) {
|
void node_data::convert_to_map(const shared_memory_holder& pMemory) {
|
||||||
switch (m_type) {
|
switch (m_type) {
|
||||||
case NodeType::Undefined:
|
case NodeType::Undefined:
|
||||||
case NodeType::Null:
|
case NodeType::Null:
|
||||||
@@ -302,7 +305,7 @@ void node_data::convert_to_map(shared_memory_holder pMemory) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
void node_data::convert_sequence_to_map(shared_memory_holder pMemory) {
|
void node_data::convert_sequence_to_map(const shared_memory_holder& pMemory) {
|
||||||
assert(m_type == NodeType::Sequence);
|
assert(m_type == NodeType::Sequence);
|
||||||
|
|
||||||
reset_map();
|
reset_map();
|
||||||
|
Reference in New Issue
Block a user