forked from boostorg/unordered
Merged revisions 53127,53253,53256,53311,53314,53316-53318 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r53127 | danieljames | 2009-05-20 07:43:38 +0100 (Wed, 20 May 2009) | 1 line Better configuration for boost.unordered. ........ r53253 | danieljames | 2009-05-25 20:14:07 +0100 (Mon, 25 May 2009) | 3 lines Add explicit destructors to the unordered containers. Refs #2908. Isn't really needed but it doesn't hurt. ........ r53256 | danieljames | 2009-05-25 20:45:23 +0100 (Mon, 25 May 2009) | 1 line Unordered change log for explicit destructors. ........ r53311 | danieljames | 2009-05-27 18:42:01 +0100 (Wed, 27 May 2009) | 1 line Missing changelog entry. ........ r53314 | danieljames | 2009-05-27 18:44:09 +0100 (Wed, 27 May 2009) | 1 line Use lightweight_test for unordered. ........ r53316 | danieljames | 2009-05-27 19:19:32 +0100 (Wed, 27 May 2009) | 1 line Some workarounds for old versions of Borland. ........ r53317 | danieljames | 2009-05-27 19:32:22 +0100 (Wed, 27 May 2009) | 1 line Fix a change accidentally included in the last commit. ........ r53318 | danieljames | 2009-05-27 19:32:38 +0100 (Wed, 27 May 2009) | 1 line Remove an unused function. ........ [SVN r53465]
85 lines
2.0 KiB
C++
85 lines
2.0 KiB
C++
|
|
// Copyright 2008-2009 Daniel James.
|
|
// 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)
|
|
|
|
#include <boost/unordered/unordered_set_fwd.hpp>
|
|
|
|
struct true_type { char x[100]; };
|
|
struct false_type { char x; };
|
|
|
|
false_type is_unordered_set_impl(void*);
|
|
|
|
template <class Value, class Hash, class Pred, class Alloc>
|
|
true_type is_unordered_set_impl(
|
|
boost::unordered_set<Value, Hash, Pred, Alloc>*);
|
|
|
|
typedef boost::unordered_set<int> int_set;
|
|
|
|
void call_swap(int_set& x, int_set& y) {
|
|
swap(x,y);
|
|
}
|
|
|
|
bool call_equals(int_set& x, int_set& y) {
|
|
return x == y;
|
|
}
|
|
|
|
bool call_not_equals(int_set& x, int_set& y) {
|
|
return x != y;
|
|
}
|
|
|
|
typedef boost::unordered_multiset<int> int_multiset;
|
|
|
|
void call_swap(int_multiset& x, int_multiset& y) {
|
|
swap(x,y);
|
|
}
|
|
|
|
bool call_equals(int_multiset& x, int_multiset& y) {
|
|
return x == y;
|
|
}
|
|
|
|
bool call_not_equals(int_multiset& x, int_multiset& y) {
|
|
return x != y;
|
|
}
|
|
|
|
#include "../helpers/test.hpp"
|
|
|
|
UNORDERED_AUTO_TEST(use_fwd_declared_trait_without_definition) {
|
|
BOOST_TEST(sizeof(is_unordered_set_impl((int_set*) 0)) == sizeof(true_type));
|
|
}
|
|
|
|
#include <boost/unordered_set.hpp>
|
|
|
|
UNORDERED_AUTO_TEST(use_fwd_declared_trait) {
|
|
boost::unordered_set<int> x;
|
|
BOOST_TEST(sizeof(is_unordered_set_impl(&x)) == sizeof(true_type));
|
|
|
|
int dummy;
|
|
BOOST_TEST(sizeof(is_unordered_set_impl(&dummy)) == sizeof(false_type));
|
|
}
|
|
|
|
UNORDERED_AUTO_TEST(use_set_fwd_declared_function) {
|
|
int_set x, y;
|
|
x.insert(1);
|
|
y.insert(2);
|
|
call_swap(x, y);
|
|
|
|
BOOST_TEST(y.find(1) != y.end());
|
|
BOOST_TEST(y.find(2) == y.end());
|
|
|
|
BOOST_TEST(x.find(1) == x.end());
|
|
BOOST_TEST(x.find(2) != x.end());
|
|
|
|
BOOST_TEST(!call_equals(x, y));
|
|
BOOST_TEST(call_not_equals(x, y));
|
|
}
|
|
|
|
UNORDERED_AUTO_TEST(use_multiset_fwd_declared_function) {
|
|
int_multiset x, y;
|
|
call_swap(x, y);
|
|
BOOST_TEST(call_equals(x, y));
|
|
BOOST_TEST(!call_not_equals(x, y));
|
|
}
|
|
|
|
RUN_TESTS()
|