Revert changes to unordered, as the test fails on most compilers.

[SVN r52673]
This commit is contained in:
Daniel James
2009-04-30 05:08:40 +00:00
parent 24091f8bd8
commit f8e1ec8d2b
3 changed files with 1 additions and 34 deletions

View File

@ -83,7 +83,7 @@ namespace boost {
1610612741ul, 3221225473ul, 4294967291ul };
template<typename T>
std::ptrdiff_t const prime_list_template<T>::length = 40;
std::ptrdiff_t const prime_list_template<T>::length = 28;
typedef prime_list_template<std::size_t> prime_list;

View File

@ -37,5 +37,4 @@ test-suite unordered
[ run rehash_tests.cpp ]
[ run equality_tests.cpp ]
[ run swap_tests.cpp : : : <define>BOOST_UNORDERED_SWAP_METHOD=2 ]
[ run detail_tests.cpp ]
;

View File

@ -1,32 +0,0 @@
// Copyright 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)
// Test some of the library's implementation details.
#include <boost/unordered_set.hpp>
#include <boost/unordered_map.hpp>
#include <boost/detail/lightweight_test.hpp>
#include <boost/range.hpp>
int main() {
// Test that the prime list has the right length.
//
// It would have been better to automatically set the length in the header
// but that doesn't work on some compilers. It's okay that this isn't tested
// on all compilers, as it really only needs to be checked on one.
#if !defined(BOOST_MSVC)
BOOST_TEST_EQ(
boost::end(boost::unordered_detail::prime_list::value) -
boost::begin(boost::unordered_detail::prime_list::value),
boost::unordered_detail::prime_list::length);
#endif
return boost::report_errors();
}