mirror of
				https://github.com/boostorg/unordered.git
				synced 2025-11-04 01:31:41 +01:00 
			
		
		
		
	Merged revisions 53127,53253,53256,53311,53314,53316-53318 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r53127 | danieljames | 2009-05-20 07:43:38 +0100 (Wed, 20 May 2009) | 1 line Better configuration for boost.unordered. ........ r53253 | danieljames | 2009-05-25 20:14:07 +0100 (Mon, 25 May 2009) | 3 lines Add explicit destructors to the unordered containers. Refs #2908. Isn't really needed but it doesn't hurt. ........ r53256 | danieljames | 2009-05-25 20:45:23 +0100 (Mon, 25 May 2009) | 1 line Unordered change log for explicit destructors. ........ r53311 | danieljames | 2009-05-27 18:42:01 +0100 (Wed, 27 May 2009) | 1 line Missing changelog entry. ........ r53314 | danieljames | 2009-05-27 18:44:09 +0100 (Wed, 27 May 2009) | 1 line Use lightweight_test for unordered. ........ r53316 | danieljames | 2009-05-27 19:19:32 +0100 (Wed, 27 May 2009) | 1 line Some workarounds for old versions of Borland. ........ r53317 | danieljames | 2009-05-27 19:32:22 +0100 (Wed, 27 May 2009) | 1 line Fix a change accidentally included in the last commit. ........ r53318 | danieljames | 2009-05-27 19:32:38 +0100 (Wed, 27 May 2009) | 1 line Remove an unused function. ........ [SVN r53465]
		
			
				
	
	
		
			54 lines
		
	
	
		
			1.4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			54 lines
		
	
	
		
			1.4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
 | 
						|
// Copyright 2006-2009 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 "./containers.hpp"
 | 
						|
#include "../helpers/random_values.hpp"
 | 
						|
#include "../helpers/invariants.hpp"
 | 
						|
#include "../helpers/helpers.hpp"
 | 
						|
 | 
						|
test::seed_t seed(835193);
 | 
						|
 | 
						|
template <class T>
 | 
						|
struct erase_test_base : public test::exception_base
 | 
						|
{
 | 
						|
    test::random_values<T> values;
 | 
						|
    erase_test_base(unsigned int count = 5) : values(count) {}
 | 
						|
 | 
						|
    typedef T data_type;
 | 
						|
 | 
						|
    data_type init() const {
 | 
						|
        return T(values.begin(), values.end());
 | 
						|
    }
 | 
						|
 | 
						|
    void check(T const& x) const {
 | 
						|
        std::string scope(test::scope);
 | 
						|
 | 
						|
        BOOST_TEST(scope.find("hash::") != std::string::npos ||
 | 
						|
                scope.find("equal_to::") != std::string::npos ||
 | 
						|
                scope == "operator==(object, object)");
 | 
						|
 | 
						|
        test::check_equivalent_keys(x);
 | 
						|
    }
 | 
						|
};
 | 
						|
 | 
						|
template <class T>
 | 
						|
struct erase_by_key_test1 : public erase_test_base<T>
 | 
						|
{
 | 
						|
    void run(T& x) const
 | 
						|
    {
 | 
						|
        typedef BOOST_DEDUCED_TYPENAME test::random_values<T>::const_iterator iterator;
 | 
						|
 | 
						|
        for(iterator it = this->values.begin(), end = this->values.end();
 | 
						|
                it != end; ++it)
 | 
						|
        {
 | 
						|
            x.erase(test::get_key<T>(*it));
 | 
						|
        }
 | 
						|
    }
 | 
						|
};
 | 
						|
 | 
						|
RUN_EXCEPTION_TESTS(
 | 
						|
    (erase_by_key_test1),
 | 
						|
    CONTAINER_SEQ)
 |