// 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 #include #include #include #include "../objects/test.hpp" #include "../helpers/random_values.hpp" #include "../helpers/helpers.hpp" test::seed_t seed(54635); template 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 v(1000); X x(v.begin(), v.end()); BOOST_TEST(x.bucket_count() < x.max_bucket_count()); std::cerr<::const_iterator it = v.begin(), end = v.end(); it != end; ++it) { size_type bucket = x.bucket(test::get_key(*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(*it) != test::get_key(*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 >*) 0); bucket_tests((boost::unordered_multiset >*) 0); bucket_tests((boost::unordered_map >*) 0); bucket_tests((boost::unordered_multimap >*) 0); return boost::report_errors(); }