forked from boostorg/functional
Daniel James
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]
103 lines
2.5 KiB
C++
103 lines
2.5 KiB
C++
|
|
// Copyright 2006-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"
|
|
|
|
#if defined(TEST_EXTENSIONS) && !defined(TEST_STD_INCLUDES)
|
|
#include <boost/functional/hash_fwd.hpp>
|
|
|
|
#include <boost/config.hpp>
|
|
#include <cstddef>
|
|
#include <vector>
|
|
|
|
namespace test {
|
|
|
|
template <class T>
|
|
struct test_type1
|
|
{
|
|
T value;
|
|
test_type1(T const& x) : value(x) {}
|
|
};
|
|
|
|
#if !defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
|
|
template <class T>
|
|
std::size_t hash_value(test_type1<T> const& x)
|
|
{
|
|
HASH_NAMESPACE::hash<T> hasher;
|
|
return hasher(x.value);
|
|
}
|
|
#endif
|
|
|
|
template <class T>
|
|
struct test_type2
|
|
{
|
|
T value1, value2;
|
|
test_type2(T const& x, T const& y) : value1(x), value2(y) {}
|
|
};
|
|
|
|
#if !defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
|
|
template <class T>
|
|
std::size_t hash_value(test_type2<T> const& x)
|
|
{
|
|
std::size_t seed = 0;
|
|
HASH_NAMESPACE::hash_combine(seed, x.value1);
|
|
HASH_NAMESPACE::hash_combine(seed, x.value2);
|
|
return seed;
|
|
}
|
|
#endif
|
|
|
|
template <class T>
|
|
struct test_type3
|
|
{
|
|
std::vector<T> values;
|
|
test_type3(typename std::vector<T>::iterator x,
|
|
typename std::vector<T>::iterator y) : values(x, y) {}
|
|
};
|
|
|
|
#if !defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
|
|
template <class T>
|
|
std::size_t hash_value(test_type3<T> const& x)
|
|
{
|
|
std::size_t seed = HASH_NAMESPACE::hash_range(x.values.begin(), x.values.end());
|
|
HASH_NAMESPACE::hash_range(seed, x.values.begin(), x.values.end());
|
|
return seed;
|
|
}
|
|
#endif
|
|
|
|
}
|
|
|
|
#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
|
|
|
|
namespace boost
|
|
{
|
|
template <class T>
|
|
std::size_t hash_value(test::test_type1<T> const& x)
|
|
{
|
|
HASH_NAMESPACE::hash<T> hasher;
|
|
return hasher(x.value);
|
|
}
|
|
|
|
template <class T>
|
|
std::size_t hash_value(test::test_type2<T> const& x)
|
|
{
|
|
std::size_t seed = 0;
|
|
HASH_NAMESPACE::hash_combine(seed, x.value1);
|
|
HASH_NAMESPACE::hash_combine(seed, x.value2);
|
|
return seed;
|
|
}
|
|
|
|
template <class T>
|
|
std::size_t hash_value(test::test_type3<T> const& x)
|
|
{
|
|
std::size_t seed = HASH_NAMESPACE::hash_range(x.values.begin(), x.values.end());
|
|
HASH_NAMESPACE::hash_range(seed, x.values.begin(), x.values.end());
|
|
return seed;
|
|
}
|
|
}
|
|
|
|
#endif
|
|
|
|
#endif
|