mirror of
https://github.com/boostorg/unordered.git
synced 2025-11-03 09:11:42 +01:00
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]
46 lines
1.1 KiB
C++
46 lines
1.1 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/detail/lightweight_test.hpp>
|
|
|
|
//[point_example1
|
|
struct point {
|
|
int x;
|
|
int y;
|
|
};
|
|
|
|
bool operator==(point const& p1, point const& p2)
|
|
{
|
|
return p1.x == p2.x && p1.y == p2.y;
|
|
}
|
|
|
|
struct point_hash
|
|
: std::unary_function<point, std::size_t>
|
|
{
|
|
std::size_t operator()(point const& p) const
|
|
{
|
|
std::size_t seed = 0;
|
|
boost::hash_combine(seed, p.x);
|
|
boost::hash_combine(seed, p.y);
|
|
return seed;
|
|
}
|
|
};
|
|
|
|
boost::unordered_multiset<point, point_hash> points;
|
|
//]
|
|
|
|
int main() {
|
|
point x[] = {{1,2}, {3,4}, {1,5}, {1,2}};
|
|
for(int i = 0; i < sizeof(x) / sizeof(point); ++i)
|
|
points.insert(x[i]);
|
|
BOOST_TEST(points.count(x[0]) == 2);
|
|
BOOST_TEST(points.count(x[1]) == 1);
|
|
point y = {10, 2};
|
|
BOOST_TEST(points.count(y) == 0);
|
|
|
|
return boost::report_errors();
|
|
}
|