boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-29 19:07:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #90 from cmazakas/contains-c4800-warning-fixes

Browse Source 
Fix C4800 warnings in msvc by manually comparing pointers to 0
This commit is contained in:
Peter Dimov
2022-02-10 22:28:37 +02:00
committed by GitHub
parent bdfb0e3e25 e2b6865938
commit 672a97cb34
2 changed files with 24 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
include/boost/unordered/unordered_map.hpp
View File

@ -798,9 +798,9 @@ namespace boost {
bool contains(const key_type& k) const
{
return table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
return 0 != table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
}
template <class Key>
@ -808,9 +808,9 @@ namespace boost {
bool>::type
contains(const Key& k) const
{
return table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
return 0 != table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
}
size_type count(const key_type&) const;
@ -1504,9 +1504,9 @@ namespace boost {
bool contains(key_type const& k) const
{
return table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
return 0 != table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
}
template <class Key>
@ -1514,9 +1514,9 @@ namespace boost {
bool>::type
contains(const Key& k) const
{
return table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
return 0 != table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
}
size_type count(const key_type&) const;

24
include/boost/unordered/unordered_set.hpp
View File

@ -509,9 +509,9 @@ namespace boost {
bool contains(key_type const& k) const
{
return table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
return 0 != table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
}
template <class Key>
@ -519,9 +519,9 @@ namespace boost {
bool>::type
contains(const Key& k) const
{
return table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
return 0 != table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
}
size_type count(const key_type&) const;
@ -1127,9 +1127,9 @@ namespace boost {
bool contains(const key_type& k) const
{
return table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
return 0 != table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
}
template <class Key>
@ -1137,9 +1137,9 @@ namespace boost {
bool>::type
contains(const Key& k) const
{
return table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
return 0 != table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
}
size_type count(const key_type&) const;