forked from boostorg/unordered
		
	tweaks. Merged revisions 45747-46030 via svnmerge from https://svn.boost.org/svn/boost/branches/unordered/trunk ................ r45747 | danieljames | 2008-05-25 18:03:30 +0100 (Sun, 25 May 2008) | 1 line Remove /branches/unordered/dev from svnmerge tracking. ................ r45874 | danieljames | 2008-05-28 18:54:53 +0100 (Wed, 28 May 2008) | 1 line Merge from trunk. ................ r45881 | danieljames | 2008-05-29 00:10:37 +0100 (Thu, 29 May 2008) | 2 lines Make it possible to use a custom generator in more places. ................ r45882 | danieljames | 2008-05-29 00:10:56 +0100 (Thu, 29 May 2008) | 2 lines Remove several unused parameters. ................ r45883 | danieljames | 2008-05-29 00:11:06 +0100 (Thu, 29 May 2008) | 2 lines No need to run move_construct_tests1 from move_construct_tests2, already calling it directly. ................ r45884 | danieljames | 2008-05-29 00:11:15 +0100 (Thu, 29 May 2008) | 2 lines Remove unused 'construct' as in trunk. ................ r45885 | danieljames | 2008-05-29 00:11:25 +0100 (Thu, 29 May 2008) | 2 lines More consistent implementations of insert_impl. ................ r45886 | danieljames | 2008-05-29 00:11:34 +0100 (Thu, 29 May 2008) | 2 lines No need to use the single argument version of methods when the variadic version is available. Frees up the non-variadic version for overloading to emulate variadic methods. ................ r45887 | danieljames | 2008-05-29 00:11:44 +0100 (Thu, 29 May 2008) | 2 lines Add another test, mainly to avoid an unused parameter warning. ................ r45888 | danieljames | 2008-05-29 00:11:54 +0100 (Thu, 29 May 2008) | 2 lines Adjust the pixels per inch of the buckets diagram so it'll fit on the page. ................ r45889 | danieljames | 2008-05-29 00:15:49 +0100 (Thu, 29 May 2008) | 1 line Improve pdf output, thanks to John Maddock. ................ r45890 | danieljames | 2008-05-29 00:17:45 +0100 (Thu, 29 May 2008) | 1 line Add an svg version of the bucket diagram. ................ r45891 | danieljames | 2008-05-29 00:18:11 +0100 (Thu, 29 May 2008) | 1 line Remove the original dia buckets diagram, I'm not using it anymore. ................ r46025 | danieljames | 2008-06-01 18:39:51 +0100 (Sun, 01 Jun 2008) | 1 line Initialise merging from doc. ................ r46030 | danieljames | 2008-06-01 18:54:36 +0100 (Sun, 01 Jun 2008) | 29 lines Merge in documentation improvements from the doc branch. Merged revisions 45892-46020 via svnmerge from https://svn.boost.org/svn/boost/branches/doc ........ r45892 | danieljames | 2008-05-29 00:30:07 +0100 (Thu, 29 May 2008) | 1 line Merge latest changes from unordered. ........ r46017 | danieljames | 2008-06-01 18:18:15 +0100 (Sun, 01 Jun 2008) | 2 lines Use both PNG and SVG versions of the buckets diagram. ........ r46018 | danieljames | 2008-06-01 18:18:27 +0100 (Sun, 01 Jun 2008) | 2 lines Improved function summary tables in unordered documenations. ........ r46019 | danieljames | 2008-06-01 18:18:39 +0100 (Sun, 01 Jun 2008) | 3 lines I'd hacked the bibliography to avoid showing the title twice, but this was causing problems when generating PDFs, so show the title twice. ........ r46020 | danieljames | 2008-06-01 18:18:52 +0100 (Sun, 01 Jun 2008) | 3 lines Don't use the compact boostbook refernce style in the standalone documentation as it is too wide for printing out. ........ ................ [SVN r46031]
		
			
				
	
	
		
			140 lines
		
	
	
		
			4.5 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			140 lines
		
	
	
		
			4.5 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 "../objects/test.hpp"
 | |
| #include "../helpers/random_values.hpp"
 | |
| #include "../helpers/tracker.hpp"
 | |
| #include "../helpers/equivalent.hpp"
 | |
| #include "../helpers/invariants.hpp"
 | |
| 
 | |
| test::seed_t seed(9063);
 | |
| 
 | |
| namespace copy_tests
 | |
| {
 | |
| 
 | |
| template <class T>
 | |
| void copy_construct_tests1(T*, test::random_generator const& generator = test::default_generator)
 | |
| {
 | |
|     BOOST_DEDUCED_TYPENAME T::hasher hf;
 | |
|     BOOST_DEDUCED_TYPENAME T::key_equal eq;
 | |
|     BOOST_DEDUCED_TYPENAME T::allocator_type al;
 | |
| 
 | |
|     {
 | |
|         T x;
 | |
|         T y(x);
 | |
|         BOOST_CHECK(y.empty());
 | |
|         BOOST_CHECK(test::equivalent(y.hash_function(), hf));
 | |
|         BOOST_CHECK(test::equivalent(y.key_eq(), eq));
 | |
|         BOOST_CHECK(test::equivalent(y.get_allocator(), al));
 | |
|         BOOST_CHECK(x.max_load_factor() == y.max_load_factor());
 | |
|         test::check_equivalent_keys(y);
 | |
|     }
 | |
| 
 | |
|     {
 | |
|         test::random_values<T> v(1000, generator);
 | |
| 
 | |
|         T x(v.begin(), v.end());
 | |
|         T y(x);
 | |
|         test::unordered_equivalence_tester<T> equivalent(x);
 | |
|         equivalent(y);
 | |
|         test::check_equivalent_keys(y);
 | |
|     }
 | |
| 
 | |
|     {
 | |
|         // In this test I drop the original containers max load factor, so it
 | |
|         // is much lower than the load factor. The hash table is not allowed
 | |
|         // to rehash, but the destination container should probably allocate
 | |
|         // enough buckets to decrease the load factor appropriately.
 | |
|         test::random_values<T> v(1000, generator);
 | |
|         T x(v.begin(), v.end());
 | |
|         x.max_load_factor(x.load_factor() / 4);
 | |
|         T y(x);
 | |
|         test::unordered_equivalence_tester<T> equivalent(x);
 | |
|         equivalent(y);
 | |
|         // This isn't guaranteed:
 | |
|         BOOST_CHECK(y.load_factor() < y.max_load_factor());
 | |
|         test::check_equivalent_keys(y);
 | |
|     }
 | |
| }
 | |
| 
 | |
| template <class T>
 | |
| void copy_construct_tests2(T* ptr, test::random_generator const& generator = test::default_generator)
 | |
| {
 | |
|     copy_construct_tests1(ptr);
 | |
| 
 | |
|     BOOST_DEDUCED_TYPENAME T::hasher hf(1);
 | |
|     BOOST_DEDUCED_TYPENAME T::key_equal eq(1);
 | |
|     BOOST_DEDUCED_TYPENAME T::allocator_type al(1);
 | |
|     BOOST_DEDUCED_TYPENAME T::allocator_type al2(2);
 | |
| 
 | |
|     {
 | |
|         T x(10000, hf, eq, al);
 | |
|         T y(x);
 | |
|         BOOST_CHECK(y.empty());
 | |
|         BOOST_CHECK(test::equivalent(y.hash_function(), hf));
 | |
|         BOOST_CHECK(test::equivalent(y.key_eq(), eq));
 | |
|         BOOST_CHECK(test::equivalent(y.get_allocator(), al));
 | |
|         BOOST_CHECK(x.max_load_factor() == y.max_load_factor());
 | |
|         test::check_equivalent_keys(y);
 | |
|     }
 | |
| 
 | |
|     {
 | |
|         T x(1000, hf, eq, al);
 | |
|         T y(x, al2);
 | |
|         BOOST_CHECK(y.empty());
 | |
|         BOOST_CHECK(test::equivalent(y.hash_function(), hf));
 | |
|         BOOST_CHECK(test::equivalent(y.key_eq(), eq));
 | |
|         BOOST_CHECK(test::equivalent(y.get_allocator(), al2));
 | |
|         BOOST_CHECK(x.max_load_factor() == y.max_load_factor());
 | |
|         test::check_equivalent_keys(y);
 | |
|     }
 | |
| 
 | |
|     {
 | |
|         test::random_values<T> v(1000, generator);
 | |
| 
 | |
|         T x(v.begin(), v.end(), 0, hf, eq, al);
 | |
|         T y(x);
 | |
|         test::unordered_equivalence_tester<T> equivalent(x);
 | |
|         equivalent(y);
 | |
|         test::check_equivalent_keys(y);
 | |
|         BOOST_CHECK(test::equivalent(y.get_allocator(), al));
 | |
|     }
 | |
| 
 | |
|     {
 | |
|         test::random_values<T> v(500, generator);
 | |
| 
 | |
|         T x(v.begin(), v.end(), 0, hf, eq, al);
 | |
|         T y(x, al2);
 | |
|         test::unordered_equivalence_tester<T> equivalent(x);
 | |
|         equivalent(y);
 | |
|         test::check_equivalent_keys(y);
 | |
|         BOOST_CHECK(test::equivalent(y.get_allocator(), al2));
 | |
|     }
 | |
| }
 | |
| 
 | |
| 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;
 | |
| 
 | |
| using test::default_generator;
 | |
| using test::generate_collisions;
 | |
| 
 | |
| UNORDERED_TEST(copy_construct_tests1,
 | |
|     ((test_set)(test_multiset)(test_map)(test_multimap))
 | |
| )
 | |
| 
 | |
| UNORDERED_TEST(copy_construct_tests2,
 | |
|     ((test_set)(test_multiset)(test_map)(test_multimap))
 | |
|     ((default_generator)(generate_collisions))
 | |
| )
 | |
| 
 | |
| }
 | |
| 
 | |
| RUN_TESTS()
 |