forked from boostorg/unordered
b1ba0f65c8
https://svn.boost.org/svn/boost/branches/unordered/trunk ........ r42880 | danieljames | 2008-01-20 16:10:43 +0000 (Sun, 20 Jan 2008) | 17 lines Simplify the tests a little: Add a parameter to random_values to control what sort of values it generates. This means that instead of using equivalent_object to test collisions (which was a total hack) we now just need another parameter. This requires some meta programming to act differently for maps and sets. Because of this pairs no longer need to be generated so remove the code for doing that (which doesn't work on some compilers). Remove the generator object, just call generate directly. Remove some of the tests using int containers, they didn't really add to anthing other than the compile time (some tests are timing out). ........ [SVN r42882]
60 lines
2.4 KiB
C++
60 lines
2.4 KiB
C++
|
|
// Copyright 2006-2007 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 <boost/unordered_set.hpp>
|
|
#include <boost/unordered_map.hpp>
|
|
#include <boost/detail/lightweight_test.hpp>
|
|
#include <algorithm>
|
|
#include "../objects/test.hpp"
|
|
#include "../helpers/random_values.hpp"
|
|
#include "../helpers/helpers.hpp"
|
|
|
|
test::seed_t seed(54635);
|
|
|
|
template <class X>
|
|
void bucket_tests(X* = 0)
|
|
{
|
|
typedef BOOST_DEDUCED_TYPENAME X::size_type size_type;
|
|
typedef BOOST_DEDUCED_TYPENAME X::const_local_iterator const_local_iterator;
|
|
test::random_values<X> v(1000);
|
|
|
|
X x(v.begin(), v.end());
|
|
|
|
BOOST_TEST(x.bucket_count() < x.max_bucket_count());
|
|
std::cerr<<x.bucket_count()<<"<"<<x.max_bucket_count()<<"\n";
|
|
|
|
for(BOOST_DEDUCED_TYPENAME test::random_values<X>::const_iterator
|
|
it = v.begin(), end = v.end(); it != end; ++it)
|
|
{
|
|
size_type bucket = x.bucket(test::get_key<X>(*it));
|
|
|
|
BOOST_TEST(bucket < x.bucket_count());
|
|
if(bucket < x.max_bucket_count()) {
|
|
// lit? lend?? I need a new naming scheme.
|
|
const_local_iterator lit = x.begin(bucket), lend = x.end(bucket);
|
|
while(lit != lend && test::get_key<X>(*it) != test::get_key<X>(*lit)) ++lit;
|
|
BOOST_TEST(lit != lend);
|
|
}
|
|
}
|
|
|
|
for(size_type i = 0; i < x.bucket_count(); ++i) {
|
|
BOOST_TEST(x.bucket_size(i) == (size_type) std::distance(x.begin(i), x.end(i)));
|
|
BOOST_TEST(x.bucket_size(i) == (size_type) std::distance(x.cbegin(i), x.cend(i)));
|
|
X const& x_ref = x;
|
|
BOOST_TEST(x.bucket_size(i) == (size_type) std::distance(x_ref.begin(i), x_ref.end(i)));
|
|
BOOST_TEST(x.bucket_size(i) == (size_type) std::distance(x_ref.cbegin(i), x_ref.cend(i)));
|
|
}
|
|
}
|
|
|
|
int main()
|
|
{
|
|
bucket_tests((boost::unordered_set<test::object, test::hash, test::equal_to, test::allocator<test::object> >*) 0);
|
|
bucket_tests((boost::unordered_multiset<test::object, test::hash, test::equal_to, test::allocator<test::object> >*) 0);
|
|
bucket_tests((boost::unordered_map<test::object, test::object, test::hash, test::equal_to, test::allocator<test::object> >*) 0);
|
|
bucket_tests((boost::unordered_multimap<test::object, test::object, test::hash, test::equal_to, test::allocator<test::object> >*) 0);
|
|
|
|
return boost::report_errors();
|
|
}
|