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

removed lifting of swap and ==/!= operations

Browse Source
This commit is contained in:
joaquintides
2023-10-22 20:16:05 +02:00
committed by GitHub
parent dbe93c765c
commit 42df4f2749
11 changed files with 1 additions and 35 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
include/boost/unordered/concurrent_flat_map.hpp
View File

@@ -855,8 +855,6 @@ namespace boost {
#endif #endif
} // namespace unordered } // namespace unordered
using unordered::concurrent_flat_map;
} // namespace boost } // namespace boost
#endif // BOOST_UNORDERED_CONCURRENT_FLAT_MAP_HPP #endif // BOOST_UNORDERED_CONCURRENT_FLAT_MAP_HPP

3
include/boost/unordered/concurrent_flat_map_fwd.hpp
View File

@@ -46,9 +46,6 @@ namespace boost {
} // namespace unordered } // namespace unordered
using boost::unordered::concurrent_flat_map; using boost::unordered::concurrent_flat_map;
using boost::unordered::swap;
using boost::unordered::operator==;
using boost::unordered::operator!=;
} // namespace boost } // namespace boost
#endif // BOOST_UNORDERED_CONCURRENT_FLAT_MAP_HPP #endif // BOOST_UNORDERED_CONCURRENT_FLAT_MAP_HPP

2
include/boost/unordered/concurrent_flat_set.hpp
View File

@@ -711,8 +711,6 @@ namespace boost {
#endif #endif
} // namespace unordered } // namespace unordered
using unordered::concurrent_flat_set;
} // namespace boost } // namespace boost
#endif // BOOST_UNORDERED_CONCURRENT_FLAT_SET_HPP #endif // BOOST_UNORDERED_CONCURRENT_FLAT_SET_HPP

3
include/boost/unordered/concurrent_flat_set_fwd.hpp
View File

@@ -47,9 +47,6 @@ namespace boost {
} // namespace unordered } // namespace unordered
using boost::unordered::concurrent_flat_set; using boost::unordered::concurrent_flat_set;
using boost::unordered::swap;
using boost::unordered::operator==;
using boost::unordered::operator!=;
} // namespace boost } // namespace boost
#endif // BOOST_UNORDERED_CONCURRENT_FLAT_SET_FWD_HPP #endif // BOOST_UNORDERED_CONCURRENT_FLAT_SET_FWD_HPP

4
include/boost/unordered/unordered_flat_map_fwd.hpp
View File

@@ -39,10 +39,6 @@ namespace boost {
} // namespace unordered } // namespace unordered
using boost::unordered::unordered_flat_map; using boost::unordered::unordered_flat_map;
using boost::unordered::swap;
using boost::unordered::operator==;
using boost::unordered::operator!=;
} // namespace boost } // namespace boost
#endif #endif

4
include/boost/unordered/unordered_flat_set_fwd.hpp
View File

@@ -39,10 +39,6 @@ namespace boost {
} // namespace unordered } // namespace unordered
using boost::unordered::unordered_flat_set; using boost::unordered::unordered_flat_set;
using boost::unordered::swap;
using boost::unordered::operator==;
using boost::unordered::operator!=;
} // namespace boost } // namespace boost
#endif #endif

3
include/boost/unordered/unordered_map_fwd.hpp
View File

@@ -60,11 +60,8 @@ namespace boost {
template <class Iter, class NodeType> struct insert_return_type_map; template <class Iter, class NodeType> struct insert_return_type_map;
} // namespace unordered } // namespace unordered
using boost::unordered::swap;
using boost::unordered::unordered_map; using boost::unordered::unordered_map;
using boost::unordered::unordered_multimap; using boost::unordered::unordered_multimap;
using boost::unordered::operator==;
using boost::unordered::operator!=;
} // namespace boost } // namespace boost
#endif #endif

4
include/boost/unordered/unordered_node_map_fwd.hpp
View File

@@ -39,10 +39,6 @@ namespace boost {
} // namespace unordered } // namespace unordered
using boost::unordered::unordered_node_map; using boost::unordered::unordered_node_map;
using boost::unordered::swap;
using boost::unordered::operator==;
using boost::unordered::operator!=;
} // namespace boost } // namespace boost
#endif #endif

4
include/boost/unordered/unordered_node_set_fwd.hpp
View File

@@ -39,10 +39,6 @@ namespace boost {
} // namespace unordered } // namespace unordered
using boost::unordered::unordered_node_set; using boost::unordered::unordered_node_set;
using boost::unordered::swap;
using boost::unordered::operator==;
using boost::unordered::operator!=;
} // namespace boost } // namespace boost
#endif #endif

3
include/boost/unordered/unordered_set_fwd.hpp
View File

@@ -58,11 +58,8 @@ namespace boost {
template <class Iter, class NodeType> struct insert_return_type_set; template <class Iter, class NodeType> struct insert_return_type_set;
} // namespace unordered } // namespace unordered
using boost::unordered::swap;
using boost::unordered::unordered_multiset; using boost::unordered::unordered_multiset;
using boost::unordered::unordered_set; using boost::unordered::unordered_set;
using boost::unordered::operator==;
using boost::unordered::operator!=;
} // namespace boost } // namespace boost
#endif #endif

4
test/unordered/compile_tests.hpp
View File

@@ -1,6 +1,6 @@
// Copyright 2005-2009 Daniel James. // Copyright 2005-2009 Daniel James.
// Copyright 2022 Christian Mazakas. // Copyright 2022-2023 Christian Mazakas.
// Distributed under the Boost Software License, Version 1.0. (See accompanying // Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -496,8 +496,6 @@ template <class X> void equality_test(X& r)
test::check_return_type<bool>::equals(a == b); test::check_return_type<bool>::equals(a == b);
test::check_return_type<bool>::equals(a != b); test::check_return_type<bool>::equals(a != b);
test::check_return_type<bool>::equals(boost::operator==(a, b));
test::check_return_type<bool>::equals(boost::operator!=(a, b));
} }
template <class X, class T> void unordered_unique_test(X& r, T const& t) template <class X, class T> void unordered_unique_test(X& r, T const& t)