2006-05-21 17:14:11 +00:00
|
|
|
|
2009-03-09 20:56:23 +00:00
|
|
|
// Copyright 2006-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-21 17:14:11 +00:00
|
|
|
|
2017-02-19 13:05:17 +00:00
|
|
|
// clang-format off
|
2009-11-26 23:15:30 +00:00
|
|
|
#include "../helpers/prefix.hpp"
|
2006-05-21 17:14:11 +00:00
|
|
|
#include <boost/unordered_set.hpp>
|
|
|
|
#include <boost/unordered_map.hpp>
|
2012-04-08 15:29:15 +00:00
|
|
|
#include "../helpers/postfix.hpp"
|
2017-02-19 13:05:17 +00:00
|
|
|
// clang-format on
|
2012-04-08 15:29:15 +00:00
|
|
|
|
2008-03-24 17:03:15 +00:00
|
|
|
#include "../helpers/test.hpp"
|
2006-05-21 17:14:11 +00:00
|
|
|
#include <algorithm>
|
|
|
|
#include "../objects/test.hpp"
|
|
|
|
#include "../helpers/random_values.hpp"
|
|
|
|
#include "../helpers/helpers.hpp"
|
|
|
|
|
2009-11-26 23:14:53 +00:00
|
|
|
#if BOOST_WORKAROUND(BOOST_MSVC, < 1400)
|
2017-02-19 13:05:17 +00:00
|
|
|
#pragma warning(disable : 4267) // conversion from 'size_t' to 'unsigned int',
|
|
|
|
// possible loss of data.
|
2009-11-25 09:14:16 +00:00
|
|
|
#endif
|
|
|
|
|
2008-03-24 17:03:15 +00:00
|
|
|
namespace bucket_tests {
|
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
test::seed_t initialize_seed(54635);
|
2007-12-06 11:42:28 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
template <class X> void tests(X*, test::random_generator generator)
|
|
|
|
{
|
2011-08-14 18:52:43 +00:00
|
|
|
test::check_instances check_;
|
|
|
|
|
2018-01-27 09:39:59 +00:00
|
|
|
typedef typename X::size_type size_type;
|
|
|
|
typedef typename X::const_local_iterator const_local_iterator;
|
Merge test improvements, pdf documentation improvements, some implementation
tweaks.
Merged revisions 45747-46030 via svnmerge from
https://svn.boost.org/svn/boost/branches/unordered/trunk
................
r45747 | danieljames | 2008-05-25 18:03:30 +0100 (Sun, 25 May 2008) | 1 line
Remove /branches/unordered/dev from svnmerge tracking.
................
r45874 | danieljames | 2008-05-28 18:54:53 +0100 (Wed, 28 May 2008) | 1 line
Merge from trunk.
................
r45881 | danieljames | 2008-05-29 00:10:37 +0100 (Thu, 29 May 2008) | 2 lines
Make it possible to use a custom generator in more places.
................
r45882 | danieljames | 2008-05-29 00:10:56 +0100 (Thu, 29 May 2008) | 2 lines
Remove several unused parameters.
................
r45883 | danieljames | 2008-05-29 00:11:06 +0100 (Thu, 29 May 2008) | 2 lines
No need to run move_construct_tests1 from move_construct_tests2, already calling it directly.
................
r45884 | danieljames | 2008-05-29 00:11:15 +0100 (Thu, 29 May 2008) | 2 lines
Remove unused 'construct' as in trunk.
................
r45885 | danieljames | 2008-05-29 00:11:25 +0100 (Thu, 29 May 2008) | 2 lines
More consistent implementations of insert_impl.
................
r45886 | danieljames | 2008-05-29 00:11:34 +0100 (Thu, 29 May 2008) | 2 lines
No need to use the single argument version of methods when the variadic version is available. Frees up the non-variadic version for overloading to emulate variadic methods.
................
r45887 | danieljames | 2008-05-29 00:11:44 +0100 (Thu, 29 May 2008) | 2 lines
Add another test, mainly to avoid an unused parameter warning.
................
r45888 | danieljames | 2008-05-29 00:11:54 +0100 (Thu, 29 May 2008) | 2 lines
Adjust the pixels per inch of the buckets diagram so it'll fit on the page.
................
r45889 | danieljames | 2008-05-29 00:15:49 +0100 (Thu, 29 May 2008) | 1 line
Improve pdf output, thanks to John Maddock.
................
r45890 | danieljames | 2008-05-29 00:17:45 +0100 (Thu, 29 May 2008) | 1 line
Add an svg version of the bucket diagram.
................
r45891 | danieljames | 2008-05-29 00:18:11 +0100 (Thu, 29 May 2008) | 1 line
Remove the original dia buckets diagram, I'm not using it anymore.
................
r46025 | danieljames | 2008-06-01 18:39:51 +0100 (Sun, 01 Jun 2008) | 1 line
Initialise merging from doc.
................
r46030 | danieljames | 2008-06-01 18:54:36 +0100 (Sun, 01 Jun 2008) | 29 lines
Merge in documentation improvements from the doc branch.
Merged revisions 45892-46020 via svnmerge from
https://svn.boost.org/svn/boost/branches/doc
........
r45892 | danieljames | 2008-05-29 00:30:07 +0100 (Thu, 29 May 2008) | 1 line
Merge latest changes from unordered.
........
r46017 | danieljames | 2008-06-01 18:18:15 +0100 (Sun, 01 Jun 2008) | 2 lines
Use both PNG and SVG versions of the buckets diagram.
........
r46018 | danieljames | 2008-06-01 18:18:27 +0100 (Sun, 01 Jun 2008) | 2 lines
Improved function summary tables in unordered documenations.
........
r46019 | danieljames | 2008-06-01 18:18:39 +0100 (Sun, 01 Jun 2008) | 3 lines
I'd hacked the bibliography to avoid showing the title twice, but this was
causing problems when generating PDFs, so show the title twice.
........
r46020 | danieljames | 2008-06-01 18:18:52 +0100 (Sun, 01 Jun 2008) | 3 lines
Don't use the compact boostbook refernce style in the standalone documentation
as it is too wide for printing out.
........
................
[SVN r46031]
2008-06-01 18:00:53 +00:00
|
|
|
test::random_values<X> v(1000, generator);
|
2006-05-21 17:14:11 +00:00
|
|
|
|
|
|
|
X x(v.begin(), v.end());
|
|
|
|
|
2016-09-18 12:22:48 +01:00
|
|
|
BOOST_TEST(x.bucket_count() <= x.max_bucket_count());
|
|
|
|
if (!(x.bucket_count() <= x.max_bucket_count())) {
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_LIGHTWEIGHT_TEST_OSTREAM << x.bucket_count()
|
|
|
|
<< "<=" << x.max_bucket_count() << "\n";
|
2016-09-18 12:22:48 +01:00
|
|
|
}
|
2006-05-21 17:14:11 +00:00
|
|
|
|
2018-01-27 09:39:59 +00:00
|
|
|
for (typename test::random_values<X>::const_iterator it = v.begin(),
|
|
|
|
end = v.end();
|
2017-02-19 13:05:17 +00:00
|
|
|
it != end; ++it) {
|
2017-06-11 20:55:59 +01:00
|
|
|
size_type bucket = x.bucket(test::get_key<X>(*it));
|
|
|
|
|
|
|
|
BOOST_TEST(bucket < x.bucket_count());
|
|
|
|
if (bucket < x.bucket_count()) {
|
|
|
|
// lit? lend?? I need a new naming scheme.
|
|
|
|
const_local_iterator lit = x.begin(bucket), lend = x.end(bucket);
|
|
|
|
while (lit != lend && test::get_key<X>(*it) != test::get_key<X>(*lit)) {
|
|
|
|
++lit;
|
2006-05-21 17:14:11 +00:00
|
|
|
}
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_TEST(lit != lend);
|
|
|
|
}
|
2006-05-21 17:14:11 +00:00
|
|
|
}
|
|
|
|
|
2017-02-19 13:05:17 +00:00
|
|
|
for (size_type i = 0; i < x.bucket_count(); ++i) {
|
2017-06-11 20:55:59 +01:00
|
|
|
BOOST_TEST(x.bucket_size(i) ==
|
|
|
|
static_cast<size_type>(std::distance(x.begin(i), x.end(i))));
|
|
|
|
BOOST_TEST(x.bucket_size(i) ==
|
|
|
|
static_cast<size_type>(std::distance(x.cbegin(i), x.cend(i))));
|
|
|
|
X const& x_ref = x;
|
|
|
|
BOOST_TEST(x.bucket_size(i) == static_cast<size_type>(std::distance(
|
|
|
|
x_ref.begin(i), x_ref.end(i))));
|
|
|
|
BOOST_TEST(x.bucket_size(i) == static_cast<size_type>(std::distance(
|
|
|
|
x_ref.cbegin(i), x_ref.cend(i))));
|
2006-05-21 17:14:11 +00:00
|
|
|
}
|
2017-06-11 20:55:59 +01:00
|
|
|
}
|
2006-05-21 17:14:11 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_multimap<test::object, test::object, test::hash,
|
2017-02-19 13:05:17 +00:00
|
|
|
test::equal_to, std::allocator<test::object> >* test_multimap_std_alloc;
|
2012-07-08 11:55:35 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_set<test::object, test::hash, test::equal_to,
|
2012-07-08 11:55:35 +00:00
|
|
|
test::allocator2<test::object> >* test_set;
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_multiset<test::object, test::hash, test::equal_to,
|
2012-07-08 11:55:35 +00:00
|
|
|
test::allocator1<test::object> >* test_multiset;
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_map<test::object, test::object, test::hash, test::equal_to,
|
2012-07-08 11:55:35 +00:00
|
|
|
test::allocator1<test::object> >* test_map;
|
2017-06-11 20:55:59 +01:00
|
|
|
boost::unordered_multimap<test::object, test::object, test::hash,
|
2017-02-19 13:05:17 +00:00
|
|
|
test::equal_to, test::allocator2<test::object> >* test_multimap;
|
2008-03-24 17:03:15 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
using test::default_generator;
|
|
|
|
using test::generate_collisions;
|
|
|
|
using test::limited_range;
|
2012-09-05 23:33:22 +00:00
|
|
|
|
2017-06-11 20:55:59 +01:00
|
|
|
UNORDERED_TEST(tests,
|
|
|
|
((test_multimap_std_alloc)(test_set)(test_multiset)(test_map)(
|
|
|
|
test_multimap))((default_generator)(generate_collisions)(limited_range)))
|
2006-05-21 17:14:11 +00:00
|
|
|
}
|
2008-03-24 17:03:15 +00:00
|
|
|
|
|
|
|
RUN_TESTS()
|