mirror of
				https://github.com/boostorg/unordered.git
				synced 2025-11-04 01:31:41 +01:00 
			
		
		
		
	hopefully better cross-platform support. Merged revisions 44778-44835,44837-44918 via svnmerge from https://svn.boost.org/svn/boost/branches/unordered/trunk ........ r44778 | danieljames | 2008-04-26 17:15:44 +0100 (Sat, 26 Apr 2008) | 2 lines Remove a trailing comma. ........ r44779 | danieljames | 2008-04-26 17:23:51 +0100 (Sat, 26 Apr 2008) | 1 line Merge in support for equality operators. ........ r44780 | danieljames | 2008-04-26 17:28:44 +0100 (Sat, 26 Apr 2008) | 1 line Use my own list container to avoid working around STL container bugs. ........ r44833 | danieljames | 2008-04-28 08:03:43 +0100 (Mon, 28 Apr 2008) | 1 line Better equality tests. ........ r44834 | danieljames | 2008-04-28 08:04:03 +0100 (Mon, 28 Apr 2008) | 1 line Remove a superfluous check. ........ r44835 | danieljames | 2008-04-28 08:04:21 +0100 (Mon, 28 Apr 2008) | 1 line Add equality reference documentation. ........ r44916 | danieljames | 2008-04-30 08:16:52 +0100 (Wed, 30 Apr 2008) | 1 line New version of list.hpp ........ r44917 | danieljames | 2008-04-30 08:18:31 +0100 (Wed, 30 Apr 2008) | 1 line Support compilers without ADL in the compile tests. ........ r44918 | danieljames | 2008-04-30 08:25:20 +0100 (Wed, 30 Apr 2008) | 7 lines Change the typedef of buffered functions as it was confusing MSVC 6.5 get_allocator wasn't compiling when the allocator workaround is used because it couldn't cast from the wrapped allocator to an allocator of another type. So use value_alloc_ when it's available (it's only unavailable on compilers with C++0x support, which don't require the workaround). ........ [SVN r44919]
		
			
				
	
	
		
			112 lines
		
	
	
		
			3.0 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			112 lines
		
	
	
		
			3.0 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
 | 
						|
// Copyright 2005-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)
 | 
						|
 | 
						|
#if !defined(BOOST_UNORDERED_TEST_HELPERS_RANDOM_VALUES_HEADER)
 | 
						|
#define BOOST_UNORDERED_TEST_HELPERS_RANDOM_VALUES_HEADER
 | 
						|
 | 
						|
#include "./list.hpp"
 | 
						|
#include <algorithm>
 | 
						|
#include <boost/mpl/if.hpp>
 | 
						|
#include "./generators.hpp"
 | 
						|
#include "./metafunctions.hpp"
 | 
						|
 | 
						|
namespace test
 | 
						|
{
 | 
						|
    typedef enum {
 | 
						|
        default_generator,
 | 
						|
        generate_collisions
 | 
						|
    } random_generator;
 | 
						|
 | 
						|
    template <class X>
 | 
						|
    struct unordered_generator_set
 | 
						|
    {
 | 
						|
        typedef BOOST_DEDUCED_TYPENAME X::value_type value_type;
 | 
						|
 | 
						|
        random_generator type_;
 | 
						|
 | 
						|
        unordered_generator_set(random_generator type)
 | 
						|
            : type_(type) {}
 | 
						|
 | 
						|
        template <class T>
 | 
						|
        void fill(T& x, std::size_t len) {
 | 
						|
            value_type* value_ptr = 0;
 | 
						|
            int* int_ptr = 0;
 | 
						|
 | 
						|
            for(std::size_t i = 0; i < len; ++i) {
 | 
						|
                value_type value = generate(value_ptr);
 | 
						|
 | 
						|
                for(int count =
 | 
						|
                    type_ == generate_collisions ?
 | 
						|
                    generate(int_ptr) % 10 : 1;
 | 
						|
                    count; --count) {
 | 
						|
                    x.push_back(value);
 | 
						|
                }
 | 
						|
            }
 | 
						|
        }
 | 
						|
    };
 | 
						|
 | 
						|
    template <class X>
 | 
						|
    struct unordered_generator_map
 | 
						|
    {
 | 
						|
        typedef BOOST_DEDUCED_TYPENAME X::key_type key_type;
 | 
						|
        typedef BOOST_DEDUCED_TYPENAME X::mapped_type mapped_type;
 | 
						|
 | 
						|
        random_generator type_;
 | 
						|
 | 
						|
        unordered_generator_map(random_generator type)
 | 
						|
            : type_(type) {}
 | 
						|
 | 
						|
        template <class T>
 | 
						|
        void fill(T& x, std::size_t len) {
 | 
						|
            key_type* key_ptr = 0;
 | 
						|
            mapped_type* mapped_ptr = 0;
 | 
						|
            int* int_ptr = 0;
 | 
						|
 | 
						|
            for(std::size_t i = 0; i < len; ++i) {
 | 
						|
                key_type key = generate(key_ptr);
 | 
						|
 | 
						|
                for(int count =
 | 
						|
                    type_ == generate_collisions ?
 | 
						|
                    generate(int_ptr) % 10 : 1;
 | 
						|
                    count; --count) {
 | 
						|
                    x.push_back(std::pair<key_type const, mapped_type>(key, generate(mapped_ptr)));
 | 
						|
                }
 | 
						|
            }
 | 
						|
        }
 | 
						|
    };
 | 
						|
 | 
						|
    template <class X>
 | 
						|
    struct unordered_generator_base
 | 
						|
        : public boost::mpl::if_<
 | 
						|
            test::is_set<X>,
 | 
						|
            test::unordered_generator_set<X>,
 | 
						|
            test::unordered_generator_map<X> >
 | 
						|
    {
 | 
						|
    };
 | 
						|
 | 
						|
    template <class X>
 | 
						|
    struct unordered_generator : public unordered_generator_base<X>::type
 | 
						|
    {
 | 
						|
        typedef BOOST_DEDUCED_TYPENAME unordered_generator_base<X>::type base;
 | 
						|
 | 
						|
        unordered_generator(random_generator const& type = default_generator)
 | 
						|
            : base(type) {}
 | 
						|
    };
 | 
						|
 | 
						|
    template <class X>
 | 
						|
    struct random_values
 | 
						|
        : public test::list<BOOST_DEDUCED_TYPENAME X::value_type>
 | 
						|
    {
 | 
						|
        random_values(int count, test::random_generator const& generator =
 | 
						|
            test::default_generator)
 | 
						|
        {
 | 
						|
            static test::unordered_generator<X> gen(generator);
 | 
						|
            gen.fill(*this, count);
 | 
						|
        }
 | 
						|
    };
 | 
						|
}
 | 
						|
 | 
						|
#endif
 |