forked from boostorg/unordered
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]
129 lines
2.9 KiB
C++
129 lines
2.9 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)
|
|
|
|
// This test checks the runtime requirements of containers.
|
|
|
|
#include <boost/unordered_set.hpp>
|
|
#include <boost/unordered_map.hpp>
|
|
#include "../helpers/test.hpp"
|
|
#include <cstdlib>
|
|
#include <algorithm>
|
|
#include "../helpers/equivalent.hpp"
|
|
|
|
template <class X>
|
|
void simple_test(X const& a)
|
|
{
|
|
test::unordered_equivalence_tester<X> equivalent(a);
|
|
|
|
{
|
|
X u;
|
|
BOOST_CHECK(u.size() == 0);
|
|
BOOST_CHECK(X().size() == 0);
|
|
}
|
|
|
|
{
|
|
BOOST_CHECK(equivalent(X(a)));
|
|
}
|
|
|
|
{
|
|
X u(a);
|
|
BOOST_CHECK(equivalent(u));
|
|
}
|
|
|
|
{
|
|
X u = a;
|
|
BOOST_CHECK(equivalent(u));
|
|
}
|
|
|
|
{
|
|
X b(a);
|
|
BOOST_CHECK(b.begin() == const_cast<X const&>(b).cbegin());
|
|
BOOST_CHECK(b.end() == const_cast<X const&>(b).cend());
|
|
}
|
|
|
|
{
|
|
X b(a);
|
|
X c;
|
|
BOOST_CHECK(equivalent(b));
|
|
BOOST_CHECK(c.empty());
|
|
b.swap(c);
|
|
BOOST_CHECK(b.empty());
|
|
BOOST_CHECK(equivalent(c));
|
|
b.swap(c);
|
|
BOOST_CHECK(c.empty());
|
|
BOOST_CHECK(equivalent(b));
|
|
}
|
|
|
|
{
|
|
X u;
|
|
X& r = u;
|
|
BOOST_CHECK(&(r = r) == &r);
|
|
BOOST_CHECK(r.empty());
|
|
BOOST_CHECK(&(r = a) == &r);
|
|
BOOST_CHECK(equivalent(r));
|
|
BOOST_CHECK(&(r = r) == &r);
|
|
BOOST_CHECK(equivalent(r));
|
|
}
|
|
|
|
{
|
|
BOOST_CHECK(a.size() ==
|
|
(BOOST_DEDUCED_TYPENAME X::size_type) std::distance(a.begin(), a.end()));
|
|
}
|
|
|
|
{
|
|
BOOST_CHECK(a.empty() == (a.size() == 0));
|
|
}
|
|
|
|
{
|
|
BOOST_CHECK(a.empty() == (a.begin() == a.end()));
|
|
X u;
|
|
BOOST_CHECK(u.begin() == u.end());
|
|
}
|
|
}
|
|
|
|
UNORDERED_AUTO_TEST(simple_tests)
|
|
{
|
|
using namespace std;
|
|
srand(14878);
|
|
|
|
std::cout<<"Test unordered_set.\n";
|
|
boost::unordered_set<int> set;
|
|
simple_test(set);
|
|
|
|
set.insert(1); set.insert(2); set.insert(1456);
|
|
simple_test(set);
|
|
|
|
std::cout<<"Test unordered_multiset.\n";
|
|
boost::unordered_multiset<int> multiset;
|
|
simple_test(multiset);
|
|
|
|
for(int i1 = 0; i1 < 1000; ++i1) {
|
|
int count = rand() % 10, index = rand();
|
|
for(int j = 0; j < count; ++j)
|
|
multiset.insert(index);
|
|
}
|
|
simple_test(multiset);
|
|
|
|
std::cout<<"Test unordered_map.\n";
|
|
boost::unordered_map<int, int> map;
|
|
|
|
for(int i2 = 0; i2 < 1000; ++i2) {
|
|
map.insert(std::pair<const int, int>(rand(), rand()));
|
|
}
|
|
simple_test(map);
|
|
|
|
std::cout<<"Test unordered_multimap.\n";
|
|
boost::unordered_multimap<int, int> multimap;
|
|
|
|
for(int i3 = 0; i3 < 1000; ++i3) {
|
|
int count = rand() % 10, index = rand();
|
|
for(int j = 0; j < count; ++j)
|
|
multimap.insert(std::pair<const int, int>(index, rand()));
|
|
}
|
|
simple_test(multimap);
|
|
}
|
|
|
|
RUN_TESTS()
|