forked from boostorg/unordered
ae09b0dd24
Merged revisions 53127,53253,53256,53311,53314,53316-53318 via svnmerge from https://svn.boost.org/svn/boost/trunk ........ r53127 | danieljames | 2009-05-20 07:43:38 +0100 (Wed, 20 May 2009) | 1 line Better configuration for boost.unordered. ........ r53253 | danieljames | 2009-05-25 20:14:07 +0100 (Mon, 25 May 2009) | 3 lines Add explicit destructors to the unordered containers. Refs #2908. Isn't really needed but it doesn't hurt. ........ r53256 | danieljames | 2009-05-25 20:45:23 +0100 (Mon, 25 May 2009) | 1 line Unordered change log for explicit destructors. ........ r53311 | danieljames | 2009-05-27 18:42:01 +0100 (Wed, 27 May 2009) | 1 line Missing changelog entry. ........ r53314 | danieljames | 2009-05-27 18:44:09 +0100 (Wed, 27 May 2009) | 1 line Use lightweight_test for unordered. ........ r53316 | danieljames | 2009-05-27 19:19:32 +0100 (Wed, 27 May 2009) | 1 line Some workarounds for old versions of Borland. ........ r53317 | danieljames | 2009-05-27 19:32:22 +0100 (Wed, 27 May 2009) | 1 line Fix a change accidentally included in the last commit. ........ r53318 | danieljames | 2009-05-27 19:32:38 +0100 (Wed, 27 May 2009) | 1 line Remove an unused function. ........ [SVN r53465]
100 lines
3.7 KiB
C++
100 lines
3.7 KiB
C++
|
|
// Copyright 2006-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)
|
|
|
|
#include <boost/unordered_set.hpp>
|
|
#include <boost/unordered_map.hpp>
|
|
#include "../helpers/test.hpp"
|
|
#include "../objects/test.hpp"
|
|
#include "../helpers/random_values.hpp"
|
|
#include "../helpers/tracker.hpp"
|
|
#include "../helpers/helpers.hpp"
|
|
|
|
namespace find_tests
|
|
{
|
|
|
|
test::seed_t seed(78937);
|
|
|
|
template <class X>
|
|
void find_tests1(X*, test::random_generator generator = test::default_generator)
|
|
{
|
|
typedef BOOST_DEDUCED_TYPENAME X::iterator iterator;
|
|
|
|
{
|
|
test::random_values<X> v(500, generator);
|
|
X x(v.begin(), v.end());
|
|
X const& x_const = x;
|
|
test::ordered<X> tracker = test::create_ordered(x);
|
|
tracker.insert_range(v.begin(), v.end());
|
|
|
|
for(BOOST_DEDUCED_TYPENAME test::ordered<X>::const_iterator it1 =
|
|
tracker.begin(); it1 != tracker.end(); ++it1)
|
|
{
|
|
BOOST_DEDUCED_TYPENAME X::key_type key = test::get_key<X>(*it1);
|
|
iterator pos = x.find(key);
|
|
BOOST_DEDUCED_TYPENAME X::const_iterator const_pos = x_const.find(key);
|
|
BOOST_TEST(pos != x.end() &&
|
|
x.key_eq()(key, test::get_key<X>(*pos)));
|
|
BOOST_TEST(const_pos != x_const.end() &&
|
|
x_const.key_eq()(key, test::get_key<X>(*const_pos)));
|
|
|
|
BOOST_TEST(x.count(key) == tracker.count(key));
|
|
|
|
test::compare_pairs(x.equal_range(key),
|
|
tracker.equal_range(key),
|
|
(BOOST_DEDUCED_TYPENAME X::value_type*) 0);
|
|
test::compare_pairs(x_const.equal_range(key),
|
|
tracker.equal_range(key),
|
|
(BOOST_DEDUCED_TYPENAME X::value_type*) 0);
|
|
}
|
|
|
|
test::random_values<X> v2(500, generator);
|
|
for(BOOST_DEDUCED_TYPENAME test::random_values<X>::const_iterator it2 =
|
|
v2.begin(); it2 != v2.end(); ++it2)
|
|
{
|
|
BOOST_DEDUCED_TYPENAME X::key_type key = test::get_key<X>(*it2);
|
|
if(tracker.find(test::get_key<X>(key)) == tracker.end())
|
|
{
|
|
BOOST_TEST(x.find(key) == x.end());
|
|
BOOST_TEST(x_const.find(key) == x_const.end());
|
|
BOOST_TEST(x.count(key) == 0);
|
|
std::pair<iterator, iterator> range = x.equal_range(key);
|
|
BOOST_TEST(range.first == range.second);
|
|
}
|
|
}
|
|
}
|
|
|
|
{
|
|
X x;
|
|
|
|
test::random_values<X> v2(5, generator);
|
|
for(BOOST_DEDUCED_TYPENAME test::random_values<X>::const_iterator it3 =
|
|
v2.begin(); it3 != v2.end(); ++it3)
|
|
{
|
|
BOOST_DEDUCED_TYPENAME X::key_type key = test::get_key<X>(*it3);
|
|
BOOST_TEST(x.find(key) == x.end());
|
|
BOOST_TEST(x.count(key) == 0);
|
|
std::pair<iterator, iterator> range = x.equal_range(key);
|
|
BOOST_TEST(range.first == range.second);
|
|
}
|
|
}
|
|
}
|
|
|
|
boost::unordered_set<test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_set;
|
|
boost::unordered_multiset<test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_multiset;
|
|
boost::unordered_map<test::object, test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_map;
|
|
boost::unordered_multimap<test::object, test::object, test::hash, test::equal_to, test::allocator<test::object> >* test_multimap;
|
|
|
|
using test::default_generator;
|
|
using test::generate_collisions;
|
|
|
|
UNORDERED_TEST(find_tests1,
|
|
((test_set)(test_multiset)(test_map)(test_multimap))
|
|
((default_generator)(generate_collisions))
|
|
)
|
|
|
|
}
|
|
|
|
RUN_TESTS()
|