Files
unordered/test/helpers/random_values.hpp

110 lines
2.8 KiB
C++
Raw Normal View History

// Copyright 2005-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)
#if !defined(BOOST_UNORDERED_TEST_HELPERS_RANDOM_VALUES_HEADER)
#define BOOST_UNORDERED_TEST_HELPERS_RANDOM_VALUES_HEADER
2017-02-19 13:05:17 +00:00
#include "./generators.hpp"
Merge in support for equality operators for the unordered containers and 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]
2008-04-30 07:57:04 +00:00
#include "./list.hpp"
2017-02-19 13:05:17 +00:00
#include "./metafunctions.hpp"
#include <algorithm>
#include <boost/detail/select_type.hpp>
2017-02-19 13:05:17 +00:00
namespace test {
template <class X> struct unordered_generator_set
{
typedef typename X::value_type value_type;
2017-02-19 13:05:17 +00:00
random_generator type_;
2017-02-19 13:05:17 +00:00
unordered_generator_set(random_generator type) : type_(type) {}
2017-02-19 13:05:17 +00:00
template <class T> void fill(T& x, std::size_t len)
{
value_type* value_ptr = 0;
len += x.size();
for (std::size_t i = 0; i < len; ++i) {
value_type value = generate(value_ptr, type_);
std::size_t count =
type_ == generate_collisions ? random_value(5) + 1 : 1;
for (std::size_t j = 0; j < count; ++j) {
x.push_back(value);
}
}
2017-02-19 13:05:17 +00:00
}
};
template <class X> struct unordered_generator_map
{
typedef typename X::key_type key_type;
typedef typename X::mapped_type mapped_type;
2017-02-19 13:05:17 +00:00
random_generator type_;
2017-02-19 13:05:17 +00:00
unordered_generator_map(random_generator type) : type_(type) {}
2017-02-19 13:05:17 +00:00
template <class T> void fill(T& x, std::size_t len)
{
key_type* key_ptr = 0;
mapped_type* mapped_ptr = 0;
for (std::size_t i = 0; i < len; ++i) {
key_type key = generate(key_ptr, type_);
std::size_t count =
type_ == generate_collisions ? random_value(5) + 1 : 1;
for (std::size_t j = 0; j < count; ++j) {
x.push_back(std::pair<key_type const, mapped_type>(
key, generate(mapped_ptr, type_)));
}
}
2017-02-19 13:05:17 +00:00
}
};
2017-02-19 13:05:17 +00:00
template <class X>
struct unordered_generator_base
2017-02-19 13:05:17 +00:00
: public boost::detail::if_true<test::is_set<X>::value>::
BOOST_NESTED_TEMPLATE then<test::unordered_generator_set<X>,
test::unordered_generator_map<X> >
{
};
template <class X>
struct unordered_generator : public unordered_generator_base<X>::type
{
typedef typename unordered_generator_base<X>::type base;
2017-02-19 13:05:17 +00:00
unordered_generator(random_generator const& type = default_generator)
: base(type)
{
2017-02-19 13:05:17 +00:00
}
};
template <class X>
struct random_values : public test::list<typename X::value_type>
{
2017-02-19 13:05:17 +00:00
random_values() {}
2017-02-19 13:05:17 +00:00
explicit random_values(std::size_t count,
test::random_generator const& generator = test::default_generator)
{
fill(count, generator);
2017-02-19 13:05:17 +00:00
}
2017-02-19 13:05:17 +00:00
void fill(std::size_t count,
test::random_generator const& generator = test::default_generator)
2017-02-19 13:05:17 +00:00
{
test::unordered_generator<X> gen(generator);
gen.fill(*this, count);
2017-02-19 13:05:17 +00:00
}
};
}
#endif