feedc0de/boost_functional
1
0
Fork 0
forked from boostorg/functional
Code Pull Requests Activity

Change tests so they can be used to test implementations of TR1 (maybe, eventually).

Browse Source 
[SVN r28052]
This commit is contained in:
Daniel James
2005-04-07 21:57:22 +00:00
parent 427b07ac6e
commit 2000b1aed8
17 changed files with 167 additions and 48 deletions
Download Patch File Download Diff File Expand all files Collapse all files
hash/test/hash_range_test.cpp
+31 -19
View File
@@ -3,11 +3,21 @@
// 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/functional/hash/hash.hpp>
#include "./config.hpp"
#ifdef TEST_EXTENSIONS
# ifdef TEST_STD_INCLUDES
# include <functional>
# else
# include <boost/functional/hash/hash.hpp>
# endif
#endif
#define BOOST_AUTO_TEST_MAIN
#include <boost/test/auto_unit_test.hpp>
#ifdef TEST_EXTENSIONS
#include <boost/limits.hpp>
#include <boost/mpl/assert.hpp>
#include <boost/type_traits/is_base_and_derived.hpp>
@@ -29,27 +39,29 @@ BOOST_AUTO_UNIT_TEST(hash_range_tests)
values5.push_back(20);
std::vector<int> x;
BOOST_CHECK(boost::hash_range(empty.begin(), empty.end())
== boost::hash_range(x.begin(), x.end()));
BOOST_CHECK(boost::hash_range(empty.begin(), empty.end())
!= boost::hash_range(values1.begin(), values1.end()));
BOOST_CHECK(HASH_NAMESPACE::hash_range(empty.begin(), empty.end())
== HASH_NAMESPACE::hash_range(x.begin(), x.end()));
BOOST_CHECK(HASH_NAMESPACE::hash_range(empty.begin(), empty.end())
!= HASH_NAMESPACE::hash_range(values1.begin(), values1.end()));
x.push_back(10);
BOOST_CHECK(boost::hash_range(empty.begin(), empty.end())
!= boost::hash_range(x.begin(), x.end()));
BOOST_CHECK(boost::hash_range(values2.begin(), values2.end())
== boost::hash_range(x.begin(), x.end()));
BOOST_CHECK(HASH_NAMESPACE::hash_range(empty.begin(), empty.end())
!= HASH_NAMESPACE::hash_range(x.begin(), x.end()));
BOOST_CHECK(HASH_NAMESPACE::hash_range(values2.begin(), values2.end())
== HASH_NAMESPACE::hash_range(x.begin(), x.end()));
x.push_back(20);
BOOST_CHECK(boost::hash_range(empty.begin(), empty.end())
!= boost::hash_range(x.begin(), x.end()));
BOOST_CHECK(boost::hash_range(values2.begin(), values2.end())
!= boost::hash_range(x.begin(), x.end()));
BOOST_CHECK(boost::hash_range(values3.begin(), values3.end())
== boost::hash_range(x.begin(), x.end()));
BOOST_CHECK(HASH_NAMESPACE::hash_range(empty.begin(), empty.end())
!= HASH_NAMESPACE::hash_range(x.begin(), x.end()));
BOOST_CHECK(HASH_NAMESPACE::hash_range(values2.begin(), values2.end())
!= HASH_NAMESPACE::hash_range(x.begin(), x.end()));
BOOST_CHECK(HASH_NAMESPACE::hash_range(values3.begin(), values3.end())
== HASH_NAMESPACE::hash_range(x.begin(), x.end()));
std::size_t seed = boost::hash_range(values3.begin(), values3.end());
boost::hash_range(seed, values4.begin(), values4.end());
boost::hash_range(seed, x.begin(), x.end());
BOOST_CHECK(seed == boost::hash_range(values5.begin(), values5.end()));
std::size_t seed = HASH_NAMESPACE::hash_range(values3.begin(), values3.end());
HASH_NAMESPACE::hash_range(seed, values4.begin(), values4.end());
HASH_NAMESPACE::hash_range(seed, x.begin(), x.end());
BOOST_CHECK(seed == HASH_NAMESPACE::hash_range(values5.begin(), values5.end()));
}
#endif