mirror of
https://github.com/boostorg/unordered.git
synced 2025-08-01 04:14:29 +02:00
Add node-based foa containers to fwd_map_test
This commit is contained in:
@@ -1,6 +1,6 @@
|
|||||||
|
|
||||||
// Copyright 2008-2009 Daniel James.
|
// Copyright 2008-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)
|
||||||
|
|
||||||
@@ -8,6 +8,7 @@
|
|||||||
#include "../helpers/prefix.hpp"
|
#include "../helpers/prefix.hpp"
|
||||||
#ifdef BOOST_UNORDERED_FOA_TESTS
|
#ifdef BOOST_UNORDERED_FOA_TESTS
|
||||||
#include <boost/unordered/unordered_flat_map_fwd.hpp>
|
#include <boost/unordered/unordered_flat_map_fwd.hpp>
|
||||||
|
#include <boost/unordered/unordered_node_map_fwd.hpp>
|
||||||
#include <boost/unordered/detail/implementation.hpp>
|
#include <boost/unordered/detail/implementation.hpp>
|
||||||
#else
|
#else
|
||||||
#include <boost/unordered/unordered_map_fwd.hpp>
|
#include <boost/unordered/unordered_map_fwd.hpp>
|
||||||
@@ -23,6 +24,13 @@ void call_swap(
|
|||||||
swap(x, y);
|
swap(x, y);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
template <typename T>
|
||||||
|
void call_swap(
|
||||||
|
boost::unordered_node_map<T, T>& x, boost::unordered_node_map<T, T>& y)
|
||||||
|
{
|
||||||
|
swap(x, y);
|
||||||
|
}
|
||||||
|
|
||||||
template <typename T>
|
template <typename T>
|
||||||
bool call_equals(
|
bool call_equals(
|
||||||
boost::unordered_flat_map<T, T>& x, boost::unordered_flat_map<T, T>& y)
|
boost::unordered_flat_map<T, T>& x, boost::unordered_flat_map<T, T>& y)
|
||||||
@@ -30,6 +38,13 @@ bool call_equals(
|
|||||||
return x == y;
|
return x == y;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
template <typename T>
|
||||||
|
bool call_equals(
|
||||||
|
boost::unordered_node_map<T, T>& x, boost::unordered_node_map<T, T>& y)
|
||||||
|
{
|
||||||
|
return x == y;
|
||||||
|
}
|
||||||
|
|
||||||
template <typename T>
|
template <typename T>
|
||||||
bool call_not_equals(
|
bool call_not_equals(
|
||||||
boost::unordered_flat_map<T, T>& x, boost::unordered_flat_map<T, T>& y)
|
boost::unordered_flat_map<T, T>& x, boost::unordered_flat_map<T, T>& y)
|
||||||
@@ -37,7 +52,15 @@ bool call_not_equals(
|
|||||||
return x != y;
|
return x != y;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
template <typename T>
|
||||||
|
bool call_not_equals(
|
||||||
|
boost::unordered_node_map<T, T>& x, boost::unordered_node_map<T, T>& y)
|
||||||
|
{
|
||||||
|
return x != y;
|
||||||
|
}
|
||||||
|
|
||||||
#include <boost/unordered/unordered_flat_map.hpp>
|
#include <boost/unordered/unordered_flat_map.hpp>
|
||||||
|
#include <boost/unordered/unordered_node_map.hpp>
|
||||||
#else
|
#else
|
||||||
template <typename T>
|
template <typename T>
|
||||||
void call_swap(boost::unordered_map<T, T>& x, boost::unordered_map<T, T>& y)
|
void call_swap(boost::unordered_map<T, T>& x, boost::unordered_map<T, T>& y)
|
||||||
@@ -85,6 +108,7 @@ bool call_not_equals(
|
|||||||
|
|
||||||
#ifdef BOOST_UNORDERED_FOA_TESTS
|
#ifdef BOOST_UNORDERED_FOA_TESTS
|
||||||
typedef boost::unordered_flat_map<int, int> int_map;
|
typedef boost::unordered_flat_map<int, int> int_map;
|
||||||
|
typedef boost::unordered_node_map<int, int> int_node_map;
|
||||||
#else
|
#else
|
||||||
typedef boost::unordered_map<int, int> int_map;
|
typedef boost::unordered_map<int, int> int_map;
|
||||||
typedef boost::unordered_multimap<int, int> int_multimap;
|
typedef boost::unordered_multimap<int, int> int_multimap;
|
||||||
@@ -106,6 +130,24 @@ UNORDERED_AUTO_TEST (use_map_fwd_declared_function) {
|
|||||||
BOOST_TEST(call_not_equals(x, y));
|
BOOST_TEST(call_not_equals(x, y));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#ifdef BOOST_UNORDERED_FOA_TESTS
|
||||||
|
UNORDERED_AUTO_TEST (use_node_map_fwd_declared_function) {
|
||||||
|
int_node_map x, y;
|
||||||
|
x[1] = 2;
|
||||||
|
y[2] = 1;
|
||||||
|
call_swap(x, y);
|
||||||
|
|
||||||
|
BOOST_TEST(y.find(1) != y.end() && y.find(1)->second == 2);
|
||||||
|
BOOST_TEST(y.find(2) == y.end());
|
||||||
|
|
||||||
|
BOOST_TEST(x.find(1) == x.end());
|
||||||
|
BOOST_TEST(x.find(2) != x.end() && x.find(2)->second == 1);
|
||||||
|
|
||||||
|
BOOST_TEST(!call_equals(x, y));
|
||||||
|
BOOST_TEST(call_not_equals(x, y));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
#ifndef BOOST_UNORDERED_FOA_TESTS
|
#ifndef BOOST_UNORDERED_FOA_TESTS
|
||||||
UNORDERED_AUTO_TEST (use_multimap_fwd_declared_function) {
|
UNORDERED_AUTO_TEST (use_multimap_fwd_declared_function) {
|
||||||
int_multimap x, y;
|
int_multimap x, y;
|
||||||
|
Reference in New Issue
Block a user