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]
80 lines
2.6 KiB
C++
80 lines
2.6 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 <algorithm>
|
|
#include <map>
|
|
#include "../helpers/list.hpp"
|
|
#include "../helpers/tracker.hpp"
|
|
#include "../helpers/invariants.hpp"
|
|
|
|
#include <iostream>
|
|
|
|
template <class Container, class Iterator>
|
|
void test_equal_insertion(Iterator begin, Iterator end)
|
|
{
|
|
typedef test::ordered<Container> tracker;
|
|
|
|
Container x1;
|
|
tracker x2 = test::create_ordered(x1);
|
|
|
|
for(Iterator it = begin; it != end; ++it) {
|
|
x1.insert(*it);
|
|
x2.insert(*it);
|
|
x2.compare_key(x1, *it);
|
|
}
|
|
|
|
x2.compare(x1);
|
|
test::check_equivalent_keys(x1);
|
|
}
|
|
|
|
UNORDERED_AUTO_TEST(set_tests)
|
|
{
|
|
int values[][5] = {
|
|
{1},
|
|
{54, 23},
|
|
{-13, 65},
|
|
{77, 77},
|
|
{986, 25, 986}
|
|
};
|
|
|
|
test_equal_insertion<boost::unordered_set<int> >(values[0], values[0] + 1);
|
|
test_equal_insertion<boost::unordered_set<int> >(values[1], values[1] + 2);
|
|
test_equal_insertion<boost::unordered_set<int> >(values[2], values[2] + 2);
|
|
test_equal_insertion<boost::unordered_set<int> >(values[3], values[3] + 2);
|
|
test_equal_insertion<boost::unordered_set<int> >(values[4], values[4] + 3);
|
|
|
|
test_equal_insertion<boost::unordered_multiset<int> >(values[0], values[0] + 1);
|
|
test_equal_insertion<boost::unordered_multiset<int> >(values[1], values[1] + 2);
|
|
test_equal_insertion<boost::unordered_multiset<int> >(values[2], values[2] + 2);
|
|
test_equal_insertion<boost::unordered_multiset<int> >(values[3], values[3] + 2);
|
|
test_equal_insertion<boost::unordered_multiset<int> >(values[4], values[4] + 3);
|
|
}
|
|
|
|
UNORDERED_AUTO_TEST(map_tests)
|
|
{
|
|
typedef test::list<std::pair<int const, int> > values_type;
|
|
values_type v[5];
|
|
v[0].push_back(std::pair<int const, int>(1,1));
|
|
v[1].push_back(std::pair<int const, int>(28,34));
|
|
v[1].push_back(std::pair<int const, int>(16,58));
|
|
v[1].push_back(std::pair<int const, int>(-124, 62));
|
|
v[2].push_back(std::pair<int const, int>(432,12));
|
|
v[2].push_back(std::pair<int const, int>(9,13));
|
|
v[2].push_back(std::pair<int const, int>(432,24));
|
|
|
|
for(int i = 0; i < 5; ++i)
|
|
test_equal_insertion<boost::unordered_map<int, int> >(
|
|
v[i].begin(), v[i].end());
|
|
|
|
for(int i2 = 0; i2 < 5; ++i2)
|
|
test_equal_insertion<boost::unordered_multimap<int, int> >(
|
|
v[i2].begin(), v[i2].end());
|
|
}
|
|
|
|
RUN_TESTS()
|