// Copyright 2006 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 #include "../helpers/check_return_type.hpp" #include #include #include "../objects/minimal.hpp" template void sink(T const&) {} template void unordered_set_test(X& r, Key const& k) { typedef typename X::value_type value_type; typedef typename X::key_type key_type; BOOST_MPL_ASSERT((boost::is_same)); } template void unordered_map_test(X& r, Key const& k, T const& t) { typedef typename X::value_type value_type; typedef typename X::key_type key_type; BOOST_MPL_ASSERT((boost::is_same >)); } template void unordered_unique_test(X& r, T const& t) { typedef typename X::iterator iterator; test::check_return_type >::equals(r.insert(t)); } template void unordered_equivalent_test(X& r, T const& t) { typedef typename X::iterator iterator; test::check_return_type::equals(r.insert(t)); } template void unordered_test(X& ref, Key& k, T& t, Hash& hf, Pred& eq) { typedef typename X::key_type key_type; typedef typename X::hasher hasher; typedef typename X::key_equal key_equal; typedef typename X::size_type size_type; typedef typename X::iterator iterator; typedef typename X::const_iterator const_iterator; typedef typename X::local_iterator local_iterator; typedef typename X::const_local_iterator const_local_iterator; typedef typename boost::BOOST_ITERATOR_CATEGORY::type iterator_category; typedef typename boost::iterator_difference::type iterator_difference; typedef typename boost::iterator_pointer::type iterator_pointer; typedef typename boost::iterator_reference::type iterator_reference; typedef typename boost::BOOST_ITERATOR_CATEGORY::type local_iterator_category; typedef typename boost::iterator_difference::type local_iterator_difference; typedef typename boost::iterator_pointer::type local_iterator_pointer; typedef typename boost::iterator_reference::type local_iterator_reference; typedef typename boost::BOOST_ITERATOR_CATEGORY::type const_iterator_category; typedef typename boost::iterator_difference::type const_iterator_difference; typedef typename boost::iterator_pointer::type const_iterator_pointer; typedef typename boost::iterator_reference::type const_iterator_reference; typedef typename boost::BOOST_ITERATOR_CATEGORY::type const_local_iterator_category; typedef typename boost::iterator_difference::type const_local_iterator_difference; typedef typename boost::iterator_pointer::type const_local_iterator_pointer; typedef typename boost::iterator_reference::type const_local_iterator_reference; BOOST_MPL_ASSERT((boost::is_same)); boost::function_requires >(); boost::function_requires >(); BOOST_MPL_ASSERT((boost::is_same)); test::check_return_type::equals(hf(k)); BOOST_MPL_ASSERT((boost::is_same)); test::check_return_type::convertible(eq(k, k)); // TODO: Pred is an equivalence relation. Doesn't really matter for these // tests. boost::function_requires >(); BOOST_MPL_ASSERT((boost::is_same)); BOOST_MPL_ASSERT((boost::is_same)); BOOST_MPL_ASSERT((boost::is_same)); BOOST_MPL_ASSERT((boost::is_same)); boost::function_requires >(); BOOST_MPL_ASSERT((boost::is_same)); BOOST_MPL_ASSERT((boost::is_same)); BOOST_MPL_ASSERT((boost::is_same)); BOOST_MPL_ASSERT((boost::is_same)); X(10, hf, eq); X a(10, hf, eq); X(10, hf); X a2(10, hf); X(10); X a3(10); X(); X a4; typename X::value_type* i = 0; typename X::value_type* j = 0; X(i, j, 10, hf, eq); X a5(i, j, 10, hf, eq); X(i, j, 10, hf); X a6(i, j, 10, hf); X(i, j, 10); X a7(i, j, 10); X(i, j); X a8(i, j); X const b; sink(X(b)); X a9(b); a = b; test::check_return_type::equals(b.hash_function()); test::check_return_type::equals(b.key_eq()); iterator q = a.begin(); const_iterator r = a.begin(); test::check_return_type::equals(a.insert(q, t)); test::check_return_type::equals(a.insert(r, t)); // TODO: void return? a.insert(i, j); test::check_return_type::equals(a.erase(k)); BOOST_TEST(a.empty()); if(a.empty()) { a.insert(t); q = a.begin(); test::check_return_type::equals(a.erase(q)); } BOOST_TEST(a.empty()); if(a.empty()) { a.insert(t); r = a.begin(); test::check_return_type::equals(a.erase(r)); } iterator q1 = a.begin(), q2 = a.end(); test::check_return_type::equals(a.erase(q1, q2)); const_iterator r1 = a.begin(), r2 = a.end(); test::check_return_type::equals(a.erase(r1, r2)); // TODO: void return? a.clear(); test::check_return_type::equals(a.find(k)); test::check_return_type::equals(b.find(k)); test::check_return_type::equals(b.count(k)); test::check_return_type >::equals( a.equal_range(k)); test::check_return_type >::equals( b.equal_range(k)); test::check_return_type::equals(b.bucket_count()); test::check_return_type::equals(b.max_bucket_count()); test::check_return_type::equals(b.bucket(k)); test::check_return_type::equals(b.bucket_size(0)); test::check_return_type::equals(a.begin(0)); test::check_return_type::equals(b.begin(0)); test::check_return_type::equals(a.end(0)); test::check_return_type::equals(b.end(0)); test::check_return_type::equals(b.load_factor()); test::check_return_type::equals(b.max_load_factor()); a.max_load_factor((float) 2.0); a.rehash(100); } void test1() { boost::hash hash; std::equal_to equal_to; int value = 0; std::pair map_value(0, 0); std::cout<<"Test unordered_set.\n"; boost::unordered_set set; unordered_unique_test(set, value); unordered_set_test(set, value); unordered_test(set, value, value, hash, equal_to); std::cout<<"Test unordered_multiset.\n"; boost::unordered_multiset multiset; unordered_equivalent_test(multiset, value); unordered_set_test(multiset, value); unordered_test(multiset, value, value, hash, equal_to); std::cout<<"Test unordered_map.\n"; boost::unordered_map map; unordered_unique_test(map, map_value); unordered_map_test(map, value, value); unordered_test(map, value, map_value, hash, equal_to); std::cout<<"Test unordered_multimap.\n"; boost::unordered_multimap multimap; unordered_equivalent_test(multimap, map_value); unordered_map_test(multimap, value, value); unordered_test(multimap, value, map_value, hash, equal_to); } void test2() { test::minimal::assignable assignable = test::minimal::assignable::create(); test::minimal::copy_constructible copy_constructible = test::minimal::copy_constructible::create(); test::minimal::hash hash = test::minimal::hash::create(); test::minimal::equal_to equal_to = test::minimal::equal_to::create(); typedef std::pair map_value_type; map_value_type map_value(assignable, copy_constructible); std::cout<<"Test unordered_set.\n"; boost::unordered_set< test::minimal::assignable, test::minimal::hash, test::minimal::equal_to, test::minimal::allocator > set; unordered_unique_test(set, assignable); unordered_set_test(set, assignable); unordered_test(set, assignable, assignable, hash, equal_to); std::cout<<"Test unordered_multiset.\n"; boost::unordered_multiset< test::minimal::assignable, test::minimal::hash, test::minimal::equal_to, test::minimal::allocator > multiset; unordered_equivalent_test(multiset, assignable); unordered_set_test(multiset, assignable); unordered_test(multiset, assignable, assignable, hash, equal_to); std::cout<<"Test unordered_map.\n"; boost::unordered_map< test::minimal::assignable, test::minimal::copy_constructible, test::minimal::hash, test::minimal::equal_to, test::minimal::allocator > map; unordered_unique_test(map, map_value); unordered_map_test(map, assignable, copy_constructible); unordered_test(map, assignable, map_value, hash, equal_to); std::cout<<"Test unordered_multimap.\n"; boost::unordered_multimap< test::minimal::assignable, test::minimal::copy_constructible, test::minimal::hash, test::minimal::equal_to, test::minimal::allocator > multimap; unordered_equivalent_test(multimap, map_value); unordered_map_test(multimap, assignable, copy_constructible); unordered_test(multimap, assignable, map_value, hash, equal_to); } int main() { test1(); test2(); return boost::report_errors(); }