2006-05-17 17:19:16 +00:00
|
|
|
|
2009-03-09 20:56:23 +00:00
|
|
|
// Copyright 2005-2009 Daniel James.
|
2006-07-01 22:31:26 +00:00
|
|
|
// 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)
|
2006-05-17 17:19:16 +00:00
|
|
|
|
|
|
|
#if !defined(BOOST_UNORDERED_TEST_HELPERS_RANDOM_VALUES_HEADER)
|
|
|
|
#define BOOST_UNORDERED_TEST_HELPERS_RANDOM_VALUES_HEADER
|
|
|
|
|
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"
|
2006-05-17 17:19:16 +00:00
|
|
|
#include <algorithm>
|
2012-07-08 11:55:10 +00:00
|
|
|
#include <boost/detail/select_type.hpp>
|
2006-05-17 17:19:16 +00:00
|
|
|
#include "./generators.hpp"
|
2008-01-20 18:55:57 +00:00
|
|
|
#include "./metafunctions.hpp"
|
2006-05-17 17:19:16 +00:00
|
|
|
|
|
|
|
namespace test
|
|
|
|
{
|
2008-01-20 18:55:57 +00:00
|
|
|
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;
|
2012-09-05 23:33:22 +00:00
|
|
|
len += x.size();
|
2008-01-20 18:55:57 +00:00
|
|
|
|
2012-09-05 23:33:22 +00:00
|
|
|
while(x.size() < len) {
|
2008-01-20 18:55:57 +00:00
|
|
|
value_type value = generate(value_ptr);
|
|
|
|
|
2012-09-05 23:33:22 +00:00
|
|
|
int count = type_ == generate_collisions ?
|
|
|
|
1 + (generate(int_ptr) % 10) : 1;
|
|
|
|
|
|
|
|
for(int i = 0; i < count; ++i) {
|
2008-01-20 18:55:57 +00:00
|
|
|
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;
|
2012-09-05 23:33:22 +00:00
|
|
|
len += x.size();
|
2008-01-20 18:55:57 +00:00
|
|
|
|
2012-09-05 23:33:22 +00:00
|
|
|
while(x.size() < len) {
|
2008-01-20 18:55:57 +00:00
|
|
|
key_type key = generate(key_ptr);
|
|
|
|
|
2012-09-05 23:33:22 +00:00
|
|
|
int count = type_ == generate_collisions ?
|
|
|
|
1 + (generate(int_ptr) % 10) : 1;
|
|
|
|
|
|
|
|
for(int i = 0; i < count; ++i) {
|
|
|
|
x.push_back(std::pair<key_type const, mapped_type>(
|
|
|
|
key, generate(mapped_ptr)));
|
2008-01-20 18:55:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <class X>
|
|
|
|
struct unordered_generator_base
|
2012-07-08 11:55:10 +00:00
|
|
|
: public boost::detail::if_true<
|
|
|
|
test::is_set<X>::value
|
|
|
|
>::BOOST_NESTED_TEMPLATE then<
|
2008-01-20 18:55:57 +00:00
|
|
|
test::unordered_generator_set<X>,
|
2012-07-08 11:55:10 +00:00
|
|
|
test::unordered_generator_map<X>
|
|
|
|
>
|
2008-01-20 18:55:57 +00:00
|
|
|
{
|
|
|
|
};
|
|
|
|
|
|
|
|
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) {}
|
|
|
|
};
|
|
|
|
|
2006-05-17 17:19:16 +00:00
|
|
|
template <class X>
|
|
|
|
struct random_values
|
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
|
|
|
: public test::list<BOOST_DEDUCED_TYPENAME X::value_type>
|
2006-05-17 17:19:16 +00:00
|
|
|
{
|
2008-01-20 18:55:57 +00:00
|
|
|
random_values(int count, test::random_generator const& generator =
|
Merged revisions 42882-42941 via svnmerge from
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]
2008-01-23 23:39:59 +00:00
|
|
|
test::default_generator)
|
2008-01-20 18:55:57 +00:00
|
|
|
{
|
2012-09-05 23:33:22 +00:00
|
|
|
test::unordered_generator<X> gen(generator);
|
2008-01-20 18:55:57 +00:00
|
|
|
gen.fill(*this, count);
|
2006-05-17 17:19:16 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|