mirror of
https://github.com/boostorg/functional.git
synced 2026-01-26 00:42:27 +01: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]
209 lines
8.1 KiB
C++
209 lines
8.1 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_STD_INCLUDES
|
|
# include <functional>
|
|
#else
|
|
# include <boost/functional/hash.hpp>
|
|
#endif
|
|
|
|
#include <boost/detail/lightweight_test.hpp>
|
|
|
|
#include <cmath>
|
|
#include <boost/limits.hpp>
|
|
|
|
#include <iostream>
|
|
|
|
#if defined(BOOST_MSVC)
|
|
#pragma warning(push)
|
|
#pragma warning(disable:4127) // conditional expression is constant
|
|
#endif
|
|
|
|
template <class T>
|
|
void float_tests(char const* name, T* = 0)
|
|
{
|
|
std::cerr<<"\n"
|
|
<<"Testing " BOOST_STRINGIZE(HASH_NAMESPACE) "::hash<"<<name<<">\n"
|
|
<<"\n"
|
|
<<"boost::hash_detail::limits<T>::digits = "
|
|
<<boost::hash_detail::limits<T>::digits<<"\n"
|
|
<<"boost::hash_detail::limits<int>::digits = "
|
|
<<boost::hash_detail::limits<int>::digits<<"\n"
|
|
<<"boost::hash_detail::limits<std::size_t>::digits = "
|
|
<<boost::hash_detail::limits<std::size_t>::digits<<"\n"
|
|
<<"\n"
|
|
;
|
|
|
|
HASH_NAMESPACE::hash<T> x1;
|
|
|
|
T zero = 0;
|
|
T minus_zero = (T) -1 * zero;
|
|
|
|
BOOST_TEST(zero == minus_zero);
|
|
BOOST_TEST(x1(zero) == x1(minus_zero));
|
|
|
|
BOOST_TEST(x1(zero) == HASH_NAMESPACE::hash_value(zero));
|
|
BOOST_TEST(x1(minus_zero) == HASH_NAMESPACE::hash_value(minus_zero));
|
|
|
|
using namespace std;
|
|
|
|
// Doing anything with infinity causes borland to crash.
|
|
#if defined(__BORLANDC__)
|
|
std::cerr<<"Not running infinity checks on Borland, as it causes it to crash.\n";
|
|
#else
|
|
if(boost::hash_detail::limits<T>::has_infinity) {
|
|
T infinity = -log(zero);
|
|
T infinity2 = (T) 1. / zero;
|
|
T infinity3 = (T) -1. / minus_zero;
|
|
T infinity4 = boost::hash_detail::limits<T>::infinity();
|
|
|
|
T minus_infinity = log(zero);
|
|
T minus_infinity2 = (T) -1. / zero;
|
|
T minus_infinity3 = (T) 1. / minus_zero;
|
|
|
|
BOOST_TEST(x1(infinity) == HASH_NAMESPACE::hash_value(infinity));
|
|
BOOST_TEST(x1(minus_infinity)
|
|
== HASH_NAMESPACE::hash_value(minus_infinity));
|
|
|
|
if(infinity == infinity2)
|
|
BOOST_TEST(x1(infinity) == x1(infinity2));
|
|
if(infinity == infinity3)
|
|
BOOST_TEST(x1(infinity) == x1(infinity3));
|
|
if(infinity == infinity4)
|
|
BOOST_TEST(x1(infinity) == x1(infinity4));
|
|
|
|
if(minus_infinity == minus_infinity2)
|
|
BOOST_TEST(x1(minus_infinity) == x1(minus_infinity2));
|
|
if(minus_infinity == minus_infinity3)
|
|
BOOST_TEST(x1(minus_infinity) == x1(minus_infinity3));
|
|
|
|
BOOST_TEST(infinity != minus_infinity);
|
|
|
|
if(x1(infinity) == x1(minus_infinity)) {
|
|
std::cerr<<"x1(infinity) == x1(-infinity) == "<<x1(infinity)<<"\n";
|
|
}
|
|
|
|
// This should really be 'has_denorm == denorm_present' but some
|
|
// compilers don't have 'denorm_present'. See also a later use.
|
|
if(boost::hash_detail::limits<T>::has_denorm) {
|
|
if(x1(boost::hash_detail::limits<T>::denorm_min()) == x1(infinity)) {
|
|
std::cerr<<"x1(denorm_min) == x1(infinity) == "<<x1(infinity)<<"\n";
|
|
}
|
|
if(x1(boost::hash_detail::limits<T>::denorm_min()) == x1(minus_infinity)) {
|
|
std::cerr<<"x1(denorm_min) == x1(-infinity) == "<<x1(minus_infinity)<<"\n";
|
|
}
|
|
}
|
|
if(boost::hash_detail::limits<T>::has_quiet_NaN) {
|
|
if(x1(boost::hash_detail::limits<T>::quiet_NaN()) == x1(infinity)) {
|
|
std::cerr<<"x1(quiet_NaN) == x1(infinity) == "<<x1(infinity)<<"\n";
|
|
}
|
|
if(x1(boost::hash_detail::limits<T>::quiet_NaN()) == x1(minus_infinity)) {
|
|
std::cerr<<"x1(quiet_NaN) == x1(-infinity) == "<<x1(minus_infinity)<<"\n";
|
|
}
|
|
}
|
|
}
|
|
#endif
|
|
|
|
T max = (boost::hash_detail::limits<T>::max)();
|
|
T half_max = max / 2;
|
|
T quarter_max = max / 4;
|
|
T three_quarter_max = max - quarter_max;
|
|
|
|
BOOST_TEST(x1(max) == HASH_NAMESPACE::hash_value(max));
|
|
BOOST_TEST(x1(half_max) == HASH_NAMESPACE::hash_value(half_max));
|
|
BOOST_TEST(x1(quarter_max) == HASH_NAMESPACE::hash_value(quarter_max));
|
|
BOOST_TEST(x1(three_quarter_max) == HASH_NAMESPACE::hash_value(three_quarter_max));
|
|
|
|
// The '!=' tests could legitimately fail, but with my hash it indicates a bug.
|
|
BOOST_TEST(x1(max) == x1(max));
|
|
BOOST_TEST(x1(max) != x1(quarter_max));
|
|
BOOST_TEST(x1(max) != x1(half_max));
|
|
BOOST_TEST(x1(max) != x1(three_quarter_max));
|
|
BOOST_TEST(x1(quarter_max) == x1(quarter_max));
|
|
BOOST_TEST(x1(quarter_max) != x1(half_max));
|
|
BOOST_TEST(x1(quarter_max) != x1(three_quarter_max));
|
|
BOOST_TEST(x1(half_max) == x1(half_max));
|
|
BOOST_TEST(x1(half_max) != x1(three_quarter_max));
|
|
BOOST_TEST(x1(three_quarter_max) == x1(three_quarter_max));
|
|
|
|
// Intel with gcc stdlib sometimes segfaults on calls to asin and acos.
|
|
#if !((defined(__INTEL_COMPILER) || defined(__ICL) || \
|
|
defined(__ICC) || defined(__ECC)) && \
|
|
(defined(__GLIBCPP__) || defined(__GLIBCXX__)))
|
|
T v1 = asin((T) 1);
|
|
T v2 = acos((T) 0);
|
|
if(v1 == v2)
|
|
BOOST_TEST(x1(v1) == x1(v2));
|
|
BOOST_TEST(x1(v1) == HASH_NAMESPACE::hash_value(v1));
|
|
BOOST_TEST(x1(v2) == HASH_NAMESPACE::hash_value(v2));
|
|
#endif
|
|
|
|
BOOST_TEST(x1(boost::hash_detail::limits<T>::epsilon()) ==
|
|
HASH_NAMESPACE::hash_value(boost::hash_detail::limits<T>::epsilon()));
|
|
|
|
BOOST_TEST(boost::hash_detail::limits<T>::epsilon() != (T) 0);
|
|
if(x1(boost::hash_detail::limits<T>::epsilon()) == x1((T) 0))
|
|
std::cerr<<"x1(epsilon) == x1(0) == "<<x1((T) 0)<<"\n";
|
|
|
|
BOOST_TEST(-boost::hash_detail::limits<T>::epsilon() != (T) 0);
|
|
if(x1(-boost::hash_detail::limits<T>::epsilon()) == x1((T) 0))
|
|
std::cerr<<"x1(-epsilon) == x1(0) == "<<x1((T) 0)<<"\n";
|
|
|
|
BOOST_TEST((T) 1 + boost::hash_detail::limits<T>::epsilon() != (T) 1);
|
|
if(x1((T) 1 + boost::hash_detail::limits<T>::epsilon()) == x1((T) 1))
|
|
std::cerr<<"x1(1 + epsilon) == x1(1) == "<<x1((T) 1)<<"\n";
|
|
|
|
BOOST_TEST((T) 1 - boost::hash_detail::limits<T>::epsilon() != (T) 1);
|
|
if(x1((T) 1 - boost::hash_detail::limits<T>::epsilon()) == x1((T) 1))
|
|
std::cerr<<"x1(1 - epsilon) == x1(1) == "<<x1((T) 1)<<"\n";
|
|
|
|
BOOST_TEST((T) -1 + boost::hash_detail::limits<T>::epsilon() != (T) -1);
|
|
if(x1((T) -1 + boost::hash_detail::limits<T>::epsilon()) == x1((T) -1))
|
|
std::cerr<<"x1(-1 + epsilon) == x1(-1) == "<<x1((T) -1)<<"\n";
|
|
|
|
BOOST_TEST((T) -1 - boost::hash_detail::limits<T>::epsilon() != (T) -1);
|
|
if(x1((T) -1 - boost::hash_detail::limits<T>::epsilon()) == x1((T) -1))
|
|
std::cerr<<"x1(-1 - epsilon) == x1(-1) == "<<x1((T) -1)<<"\n";
|
|
|
|
// As before.
|
|
if(boost::hash_detail::limits<T>::has_denorm) {
|
|
if(x1(boost::hash_detail::limits<T>::denorm_min()) == x1(zero)) {
|
|
std::cerr<<"x1(denorm_min) == x1(zero) == "<<x1(zero)<<"\n";
|
|
}
|
|
#if !BOOST_WORKAROUND(__DECCXX_VER,<70190006)
|
|
// The Tru64/CXX standard library prior to 7.1 contains a bug in the
|
|
// specialization of boost::hash_detail::limits::denorm_min() for long
|
|
// doubles which causes this test to fail.
|
|
if(x1(boost::hash_detail::limits<T>::denorm_min()) !=
|
|
HASH_NAMESPACE::hash_value(boost::hash_detail::limits<T>::denorm_min()))
|
|
{
|
|
std::cerr<<"x1(boost::hash_detail::limits<T>::denorm_min()) = "
|
|
<< x1(boost::hash_detail::limits<T>::denorm_min())
|
|
<< "\nhash_value(boost::hash_detail::limits<T>::denorm_min()) = "
|
|
<< HASH_NAMESPACE::hash_value(
|
|
boost::hash_detail::limits<T>::denorm_min())
|
|
<< "\nx1(0) = "<<x1(0)<<"\n";
|
|
}
|
|
#endif
|
|
}
|
|
|
|
// NaN also causes borland to crash.
|
|
#if !defined(__BORLANDC__)
|
|
if(boost::hash_detail::limits<T>::has_quiet_NaN) {
|
|
if(x1(boost::hash_detail::limits<T>::quiet_NaN()) == x1(1.0)) {
|
|
std::cerr<<"x1(quiet_NaN) == x1(1.0) == "<<x1(1.0)<<"\n";
|
|
}
|
|
BOOST_TEST(x1(boost::hash_detail::limits<T>::quiet_NaN()) ==
|
|
HASH_NAMESPACE::hash_value(boost::hash_detail::limits<T>::quiet_NaN()));
|
|
}
|
|
#endif
|
|
}
|
|
|
|
#if defined(BOOST_MSVC)
|
|
#pragma warning(pop)
|
|
#endif
|