mirror of
https://github.com/boostorg/unordered.git
synced 2025-05-11 13:34:06 +00:00
https://svn.boost.org/svn/boost/branches/unordered/trunk ................ r42887 | danieljames | 2008-01-20 21:32:04 +0000 (Sun, 20 Jan 2008) | 10 lines Merged revisions 42590-42664,42667-42697,42699-42723,42725-42855,42857-42881 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r42881 | danieljames | 2008-01-20 17:37:21 +0000 (Sun, 20 Jan 2008) | 1 line Include <new> to get std::bad_alloc. ........ ................ r42892 | danieljames | 2008-01-21 13:03:16 +0000 (Mon, 21 Jan 2008) | 1 line On some compilers the Rogue Wave/Apache stdcxx library doesn't have the normal std::distance, but instead has a variant that takes the result as the third parameter so it doesn't have to work out the type from the iterator. ................ r42893 | danieljames | 2008-01-21 13:07:58 +0000 (Mon, 21 Jan 2008) | 1 line Fix a typo in the last commit. ................ r42895 | danieljames | 2008-01-21 13:33:29 +0000 (Mon, 21 Jan 2008) | 1 line Remove tabs from the last checkin. ................ r42896 | danieljames | 2008-01-21 15:51:40 +0000 (Mon, 21 Jan 2008) | 1 line Use Boost config to tell when we have a std::distance function. Also, no need for a macro. ................ r42908 | danieljames | 2008-01-21 21:37:04 +0000 (Mon, 21 Jan 2008) | 1 line Use boost::long_long_type and boost::ulong_long_type. ................ r42921 | danieljames | 2008-01-23 11:43:35 +0000 (Wed, 23 Jan 2008) | 1 line Remove some tabs. ................ r42922 | danieljames | 2008-01-23 11:46:28 +0000 (Wed, 23 Jan 2008) | 2 lines Add missing include. Refs #1596 ................ r42923 | danieljames | 2008-01-23 11:52:47 +0000 (Wed, 23 Jan 2008) | 2 lines Always use void const* for the second parameter of allocate. Refs #1596. ................ r42936 | danieljames | 2008-01-23 22:22:16 +0000 (Wed, 23 Jan 2008) | 1 line Use Boost style library name in the documentation. ................ r42937 | danieljames | 2008-01-23 22:22:32 +0000 (Wed, 23 Jan 2008) | 1 line More tabs. ................ r42941 | danieljames | 2008-01-23 23:35:01 +0000 (Wed, 23 Jan 2008) | 1 line Fix all the allocators. ................ [SVN r42943]
112 lines
3.0 KiB
C++
112 lines
3.0 KiB
C++
|
|
// Copyright 2005-2007 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>
|
|
#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 std::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
|