mirror of
				https://github.com/boostorg/unordered.git
				synced 2025-10-30 23:31:41 +01:00 
			
		
		
		
	https://svn.boost.org/svn/boost/branches/unordered/trunk ........ r43840 | danieljames | 2008-03-24 17:25:07 +0000 (Mon, 24 Mar 2008) | 1 line Fix a g++ warning. ........ r43844 | danieljames | 2008-03-24 17:56:28 +0000 (Mon, 24 Mar 2008) | 1 line It's a new-ish year. ........ r43885 | danieljames | 2008-03-27 20:36:10 +0000 (Thu, 27 Mar 2008) | 1 line The release script doesn't need to copy images and css - because that's now done in the jamfiles. Also tweak the shell script a tad bit. ........ r43890 | danieljames | 2008-03-27 23:01:40 +0000 (Thu, 27 Mar 2008) | 1 line Starting to add a docbook bibliography. ........ r43894 | danieljames | 2008-03-27 23:24:18 +0000 (Thu, 27 Mar 2008) | 1 line Redeclare 'data' in iterator_base to help compilers which have trouble with accessing the nested typedef. ........ [SVN r43895]
		
			
				
	
	
		
			46 lines
		
	
	
		
			1.1 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			46 lines
		
	
	
		
			1.1 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/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();
 | |
| }
 |