forked from boostorg/unordered
6aa582a90e
https://svn.boost.org/svn/boost/branches/unordered/trunk ........ r43840 | danieljames | 2008-03-24 17:25:07 +0000 (Mon, 24 Mar 2008) | 1 line Fix a g++ warning. ........ r43844 | danieljames | 2008-03-24 17:56:28 +0000 (Mon, 24 Mar 2008) | 1 line It's a new-ish year. ........ r43885 | danieljames | 2008-03-27 20:36:10 +0000 (Thu, 27 Mar 2008) | 1 line The release script doesn't need to copy images and css - because that's now done in the jamfiles. Also tweak the shell script a tad bit. ........ r43890 | danieljames | 2008-03-27 23:01:40 +0000 (Thu, 27 Mar 2008) | 1 line Starting to add a docbook bibliography. ........ r43894 | danieljames | 2008-03-27 23:24:18 +0000 (Thu, 27 Mar 2008) | 1 line Redeclare 'data' in iterator_base to help compilers which have trouble with accessing the nested typedef. ........ [SVN r43895]
63 lines
2.4 KiB
C++
63 lines
2.4 KiB
C++
|
|
// Copyright 2006-2008 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 "../helpers/test.hpp"
|
|
#include <algorithm>
|
|
#include "../objects/test.hpp"
|
|
#include "../helpers/random_values.hpp"
|
|
#include "../helpers/helpers.hpp"
|
|
|
|
namespace bucket_tests {
|
|
|
|
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)));
|
|
}
|
|
}
|
|
|
|
boost::unordered_set<test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_set;
|
|
boost::unordered_multiset<test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_multiset;
|
|
boost::unordered_map<test::object, test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_map;
|
|
boost::unordered_multimap<test::object, test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_multimap;
|
|
|
|
UNORDERED_TEST(bucket_tests, ((test_set)(test_multiset)(test_map)(test_multimap)))
|
|
|
|
}
|
|
|
|
RUN_TESTS()
|