forked from boostorg/unordered
b5db48b6a4
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]
100 lines
3.7 KiB
C++
100 lines
3.7 KiB
C++
|
|
// Copyright 2006-2008 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_CHECK(pos != x.end() &&
|
|
x.key_eq()(key, test::get_key<X>(*pos)));
|
|
BOOST_CHECK(const_pos != x_const.end() &&
|
|
x_const.key_eq()(key, test::get_key<X>(*const_pos)));
|
|
|
|
BOOST_CHECK(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_CHECK(x.find(key) == x.end());
|
|
BOOST_CHECK(x_const.find(key) == x_const.end());
|
|
BOOST_CHECK(x.count(key) == 0);
|
|
std::pair<iterator, iterator> range = x.equal_range(key);
|
|
BOOST_CHECK(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_CHECK(x.find(key) == x.end());
|
|
BOOST_CHECK(x.count(key) == 0);
|
|
std::pair<iterator, iterator> range = x.equal_range(key);
|
|
BOOST_CHECK(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()
|