feedc0de/boost_unordered
1
0 Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

made operator[==|!=] non-templated

Browse Source
This commit is contained in:
joaquintides committed 2023-05-12 11:41:50 +02:00
1 parent 511e2b3272
commit dacc1c8234
5 files changed
+10 -30
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

include/boost/unordered/concurrent_flat_map.hpp
+2 -6
View File
@@ -770,18 +770,14 @@ namespace boost {
/// Equality
///
template <class Key, class Hash, class KeyEqual, class Allocator>
friend bool operator==(
concurrent_flat_map<Key, Hash, KeyEqual, Allocator> const& lhs,
concurrent_flat_map<Key, Hash, KeyEqual, Allocator> const& rhs)
concurrent_flat_map const& lhs, concurrent_flat_map const& rhs)
{
return lhs.table_ == rhs.table_;
}
template <class Key, class Hash, class KeyEqual, class Allocator>
friend bool operator!=(
concurrent_flat_map<Key, Hash, KeyEqual, Allocator> const& lhs,
concurrent_flat_map<Key, Hash, KeyEqual, Allocator> const& rhs)
concurrent_flat_map const& lhs, concurrent_flat_map const& rhs)
{
return !(lhs == rhs);
}
include/boost/unordered/unordered_flat_map.hpp
+2 -6
View File
@@ -699,18 +699,14 @@ namespace boost {
/// Equality
///
template <class Key, class T, class Hash, class KeyEqual, class Allocator>
friend bool operator==(
unordered_flat_map<Key, T, Hash, KeyEqual, Allocator> const& lhs,
unordered_flat_map<Key, T, Hash, KeyEqual, Allocator> const& rhs)
unordered_flat_map const& lhs, unordered_flat_map const& rhs)
{
return lhs.table_ == rhs.table_;
}
template <class Key, class T, class Hash, class KeyEqual, class Allocator>
friend bool operator!=(
unordered_flat_map<Key, T, Hash, KeyEqual, Allocator> const& lhs,
unordered_flat_map<Key, T, Hash, KeyEqual, Allocator> const& rhs)
unordered_flat_map const& lhs, unordered_flat_map const& rhs)
{
return !(lhs == rhs);
}
include/boost/unordered/unordered_flat_set.hpp
+2 -6
View File
@@ -496,18 +496,14 @@ namespace boost {
/// Equality
///
template <class Key, class Hash, class KeyEqual, class Allocator>
friend bool operator==(
unordered_flat_set<Key, Hash, KeyEqual, Allocator> const& lhs,
unordered_flat_set<Key, Hash, KeyEqual, Allocator> const& rhs)
unordered_flat_set const& lhs, unordered_flat_set const& rhs)
{
return lhs.table_ == rhs.table_;
}
template <class Key, class Hash, class KeyEqual, class Allocator>
friend bool operator!=(
unordered_flat_set<Key, Hash, KeyEqual, Allocator> const& lhs,
unordered_flat_set<Key, Hash, KeyEqual, Allocator> const& rhs)
unordered_flat_set const& lhs, unordered_flat_set const& rhs)
{
return !(lhs == rhs);
}
include/boost/unordered/unordered_node_map.hpp
+2 -6
View File
@@ -851,18 +851,14 @@ namespace boost {
/// Equality
///
template <class Key, class T, class Hash, class KeyEqual, class Allocator>
friend bool operator==(
unordered_node_map<Key, T, Hash, KeyEqual, Allocator> const& lhs,
unordered_node_map<Key, T, Hash, KeyEqual, Allocator> const& rhs)
unordered_node_map const& lhs, unordered_node_map const& rhs)
{
return lhs.table_ == rhs.table_;
}
template <class Key, class T, class Hash, class KeyEqual, class Allocator>
friend bool operator!=(
unordered_node_map<Key, T, Hash, KeyEqual, Allocator> const& lhs,
unordered_node_map<Key, T, Hash, KeyEqual, Allocator> const& rhs)
unordered_node_map const& lhs, unordered_node_map const& rhs)
{
return !(lhs == rhs);
}
include/boost/unordered/unordered_node_set.hpp
+2 -6
View File
@@ -635,18 +635,14 @@ namespace boost {
/// Equality
///
template <class Key, class Hash, class KeyEqual, class Allocator>
friend bool operator==(
unordered_node_set<Key, Hash, KeyEqual, Allocator> const& lhs,
unordered_node_set<Key, Hash, KeyEqual, Allocator> const& rhs)
unordered_node_set const& lhs, unordered_node_set const& rhs)
{
return lhs.table_ == rhs.table_;
}
template <class Key, class Hash, class KeyEqual, class Allocator>
friend bool operator!=(
unordered_node_set<Key, Hash, KeyEqual, Allocator> const& lhs,
unordered_node_set<Key, Hash, KeyEqual, Allocator> const& rhs)
unordered_node_set const& lhs, unordered_node_set const& rhs)
{
return !(lhs == rhs);
}