Files
boost_container_hash/test/hash_fwd_test.hpp
T
2006-02-05 16:06:31 +00:00

95 lines
2.2 KiB
C++

// (C) Copyright Daniel James 2005.
// Use, modification and distribution are subject to 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 <vector>
template <class T>
struct test_type1
{
T value;
test_type1(T const& x) : value(x) {}
#if !defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP)
friend 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)
friend std::size_t hash_value(test_type2<T> const& x)
{
std::size_t seed = 0;
boost::hash_combine(seed, x.value1);
boost::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)
friend std::size_t hash_value(test_type3<T> const& x)
{
std::size_t seed = boost::hash_range(x.values.begin(), x.values.end());
boost::hash_range(seed, x.values.begin(), x.values.end());
return seed;
}
#endif
};
#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOPUP)
namespace boost
{
template <class T>
std::size_t hash_value(test_type1<T> const& x)
{
HASH_NAMESPACE::hash<T> hasher;
return hasher(x.value);
}
template <class T>
std::size_t hash_value(test_type2<T> const& x)
{
std::size_t seed = 0;
boost::hash_combine(seed, x.value1);
boost::hash_combine(seed, x.value2);
return seed;
}
template <class T>
std::size_t hash_value(test_type3<T> const& x)
{
std::size_t seed = boost::hash_range(x.values.begin(), x.values.end());
boost::hash_range(seed, x.values.begin(), x.values.end());
return seed;
}
}
#endif
#endif