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]
79 lines
2.4 KiB
C++
79 lines
2.4 KiB
C++
|
|
// Copyright 2007-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 <iostream>
|
|
|
|
namespace insert_stable
|
|
{
|
|
struct member {
|
|
int tag1_;
|
|
int tag2_;
|
|
|
|
member() : tag1_(0), tag2_(0) {}
|
|
member(int t1, int t2) : tag1_(t1), tag2_(t2) {}
|
|
|
|
friend bool operator==(member const& x, member const& y) {
|
|
return x.tag1_ == y.tag1_;
|
|
}
|
|
|
|
friend bool operator!=(member const& x, member const& y) {
|
|
return x.tag1_ != y.tag1_;
|
|
}
|
|
};
|
|
}
|
|
|
|
#ifdef BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP
|
|
namespace boost
|
|
#else
|
|
namespace insert_stable
|
|
#endif
|
|
{
|
|
std::size_t hash_value(insert_stable::member const& x) {
|
|
return static_cast<std::size_t>(x.tag1_);
|
|
}
|
|
}
|
|
|
|
UNORDERED_AUTO_TEST(stable_insert_test1) {
|
|
boost::unordered_multiset<insert_stable::member> x;
|
|
|
|
x.insert(insert_stable::member(1,1));
|
|
x.insert(insert_stable::member(1,2));
|
|
x.insert(insert_stable::member(1,3));
|
|
|
|
boost::unordered_multiset<insert_stable::member>::const_iterator it = x.begin(), end = x.end();
|
|
BOOST_TEST(it != end);
|
|
if(it != end) { BOOST_TEST(it->tag2_ == 1); ++it; }
|
|
BOOST_TEST(it != end);
|
|
if(it != end) { BOOST_TEST(it->tag2_ == 2); ++it; }
|
|
BOOST_TEST(it != end);
|
|
if(it != end) { BOOST_TEST(it->tag2_ == 3); ++it; }
|
|
BOOST_TEST(it == end);
|
|
}
|
|
|
|
UNORDERED_AUTO_TEST(stable_insert_test2) {
|
|
boost::unordered_multimap<insert_stable::member, int> x;
|
|
typedef boost::unordered_multimap<insert_stable::member, int>::const_iterator iterator;
|
|
|
|
iterator it = x.insert(x.end(), std::make_pair(insert_stable::member(1,1), 1));
|
|
it = x.insert(it, std::make_pair(insert_stable::member(1,2), 2));
|
|
it = x.insert(it, std::make_pair(insert_stable::member(1,3), 3));
|
|
|
|
it = x.begin();
|
|
iterator end = x.end();
|
|
BOOST_TEST(it != end);
|
|
if(it != end) { BOOST_TEST(it->first.tag2_ == 1 && it->second == 1); ++it; }
|
|
BOOST_TEST(it != end);
|
|
if(it != end) { BOOST_TEST(it->first.tag2_ == 2 && it->second == 2); ++it; }
|
|
BOOST_TEST(it != end);
|
|
if(it != end) { BOOST_TEST(it->first.tag2_ == 3 && it->second == 3); ++it; }
|
|
BOOST_TEST(it == end);
|
|
}
|
|
|
|
RUN_TESTS()
|