mirror of
https://github.com/boostorg/unordered.git
synced 2025-10-30 15:21:36 +01:00
6f45d36d97
Remove deprecated headers, move hash_fwd.hpp into hash subdirectory. And several minor internal changes. Mostly minor internal details. Merged revisions 51262-51263,51407-51409,51504-51505,51644-51646,51667 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r51262 | danieljames | 2009-02-15 19:32:04 +0000 (Sun, 15 Feb 2009) | 1 line Use the new 'boost:' links for the hash, unordered and quickbook documentation. ........ r51263 | danieljames | 2009-02-15 19:32:19 +0000 (Sun, 15 Feb 2009) | 2 lines Don't copy images for the standalone hash and unordered documentation, was only really required before the libraries were integrated into boost. ........ r51407 | danieljames | 2009-02-22 23:49:51 +0000 (Sun, 22 Feb 2009) | 1 line Fix the hash dirname. ........ r51408 | danieljames | 2009-02-22 23:50:04 +0000 (Sun, 22 Feb 2009) | 1 line Make copy_buckets and move_buckets member functions - so that calling them is a bit simpler. ........ r51409 | danieljames | 2009-02-22 23:50:20 +0000 (Sun, 22 Feb 2009) | 1 line Move some of the data structure classes out of hash table data. ........ r51504 | danieljames | 2009-03-01 14:15:09 +0000 (Sun, 01 Mar 2009) | 1 line Add missing return for operator=. ........ r51505 | danieljames | 2009-03-01 14:15:39 +0000 (Sun, 01 Mar 2009) | 3 lines Make the sort stable. Doesn't really matter, but it might as well be. ........ r51644 | danieljames | 2009-03-08 09:44:51 +0000 (Sun, 08 Mar 2009) | 1 line Detab. ........ r51645 | danieljames | 2009-03-08 09:45:11 +0000 (Sun, 08 Mar 2009) | 4 lines Move hash_fwd into the hash subdirectory. I should have done this in the last release. But now all of the hash implementation is in the hash subdirectory. ........ r51646 | danieljames | 2009-03-08 09:45:30 +0000 (Sun, 08 Mar 2009) | 3 lines Remove deprecated headers. Fixes #2412. ........ r51667 | danieljames | 2009-03-09 20:56:23 +0000 (Mon, 09 Mar 2009) | 1 line Update copyright dates in hash and unordered. ........ [SVN r51729]
112 lines
3.0 KiB
C++
112 lines
3.0 KiB
C++
|
|
// 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
|
|
|
|
#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
|