mirror of
https://github.com/boostorg/functional.git
synced 2026-01-24 18:02:16 +00:00
60e877acc5
Remove deprecated headers, move hash_fwd.hpp into hash subdirectory. And several minor internal changes. Mostly minor internal details. Merged revisions 51262-51263,51407-51409,51504-51505,51644-51646,51667 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r51262 | danieljames | 2009-02-15 19:32:04 +0000 (Sun, 15 Feb 2009) | 1 line Use the new 'boost:' links for the hash, unordered and quickbook documentation. ........ r51263 | danieljames | 2009-02-15 19:32:19 +0000 (Sun, 15 Feb 2009) | 2 lines Don't copy images for the standalone hash and unordered documentation, was only really required before the libraries were integrated into boost. ........ r51407 | danieljames | 2009-02-22 23:49:51 +0000 (Sun, 22 Feb 2009) | 1 line Fix the hash dirname. ........ r51408 | danieljames | 2009-02-22 23:50:04 +0000 (Sun, 22 Feb 2009) | 1 line Make copy_buckets and move_buckets member functions - so that calling them is a bit simpler. ........ r51409 | danieljames | 2009-02-22 23:50:20 +0000 (Sun, 22 Feb 2009) | 1 line Move some of the data structure classes out of hash table data. ........ r51504 | danieljames | 2009-03-01 14:15:09 +0000 (Sun, 01 Mar 2009) | 1 line Add missing return for operator=. ........ r51505 | danieljames | 2009-03-01 14:15:39 +0000 (Sun, 01 Mar 2009) | 3 lines Make the sort stable. Doesn't really matter, but it might as well be. ........ r51644 | danieljames | 2009-03-08 09:44:51 +0000 (Sun, 08 Mar 2009) | 1 line Detab. ........ r51645 | danieljames | 2009-03-08 09:45:11 +0000 (Sun, 08 Mar 2009) | 4 lines Move hash_fwd into the hash subdirectory. I should have done this in the last release. But now all of the hash implementation is in the hash subdirectory. ........ r51646 | danieljames | 2009-03-08 09:45:30 +0000 (Sun, 08 Mar 2009) | 3 lines Remove deprecated headers. Fixes #2412. ........ r51667 | danieljames | 2009-03-09 20:56:23 +0000 (Mon, 09 Mar 2009) | 1 line Update copyright dates in hash and unordered. ........ [SVN r51729]
86 lines
2.7 KiB
C++
86 lines
2.7 KiB
C++
|
|
// Copyright 2005-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 "./config.hpp"
|
|
|
|
#ifdef TEST_EXTENSIONS
|
|
# ifdef TEST_STD_INCLUDES
|
|
# include <functional>
|
|
# else
|
|
# include <boost/functional/hash.hpp>
|
|
# endif
|
|
#endif
|
|
|
|
#include <boost/detail/lightweight_test.hpp>
|
|
|
|
#ifdef TEST_EXTENSIONS
|
|
|
|
#include <boost/limits.hpp>
|
|
#include <boost/mpl/assert.hpp>
|
|
#include <boost/type_traits/is_base_and_derived.hpp>
|
|
#include <vector>
|
|
|
|
void hash_range_tests()
|
|
{
|
|
std::vector<int> empty, values1, values2, values3, values4, values5;
|
|
values1.push_back(0);
|
|
values2.push_back(10);
|
|
values3.push_back(10);
|
|
values3.push_back(20);
|
|
values4.push_back(15);
|
|
values4.push_back(75);
|
|
values5.push_back(10);
|
|
values5.push_back(20);
|
|
values5.push_back(15);
|
|
values5.push_back(75);
|
|
values5.push_back(10);
|
|
values5.push_back(20);
|
|
|
|
std::vector<int> x;
|
|
|
|
std::size_t x_seed = 0;
|
|
BOOST_TEST(x_seed == HASH_NAMESPACE::hash_range(x.begin(), x.end()));
|
|
|
|
BOOST_TEST(HASH_NAMESPACE::hash_range(empty.begin(), empty.end())
|
|
== HASH_NAMESPACE::hash_range(x.begin(), x.end()));
|
|
BOOST_TEST(HASH_NAMESPACE::hash_range(empty.begin(), empty.end())
|
|
!= HASH_NAMESPACE::hash_range(values1.begin(), values1.end()));
|
|
|
|
x.push_back(10);
|
|
HASH_NAMESPACE::hash_combine(x_seed, 10);
|
|
BOOST_TEST(x_seed == HASH_NAMESPACE::hash_range(x.begin(), x.end()));
|
|
|
|
BOOST_TEST(HASH_NAMESPACE::hash_range(empty.begin(), empty.end())
|
|
!= HASH_NAMESPACE::hash_range(x.begin(), x.end()));
|
|
BOOST_TEST(HASH_NAMESPACE::hash_range(values2.begin(), values2.end())
|
|
== HASH_NAMESPACE::hash_range(x.begin(), x.end()));
|
|
|
|
x.push_back(20);
|
|
HASH_NAMESPACE::hash_combine(x_seed, 20);
|
|
BOOST_TEST(x_seed == HASH_NAMESPACE::hash_range(x.begin(), x.end()));
|
|
|
|
BOOST_TEST(HASH_NAMESPACE::hash_range(empty.begin(), empty.end())
|
|
!= HASH_NAMESPACE::hash_range(x.begin(), x.end()));
|
|
BOOST_TEST(HASH_NAMESPACE::hash_range(values2.begin(), values2.end())
|
|
!= HASH_NAMESPACE::hash_range(x.begin(), x.end()));
|
|
BOOST_TEST(HASH_NAMESPACE::hash_range(values3.begin(), values3.end())
|
|
== HASH_NAMESPACE::hash_range(x.begin(), x.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_TEST(seed == HASH_NAMESPACE::hash_range(values5.begin(), values5.end()));
|
|
}
|
|
|
|
#endif
|
|
|
|
int main()
|
|
{
|
|
hash_range_tests();
|
|
|
|
return boost::report_errors();
|
|
}
|
|
|