mirror of
				https://github.com/boostorg/unordered.git
				synced 2025-10-31 15:51:36 +01:00 
			
		
		
		
	Copyright update. Switch back to the version where the sentinel points to itself. Remove alternative versions of swap. Workaround a borland bug or two. More consistent use of class/swap/template. Avoid a few warnings. Add a no-throw swap to the allocator for exception testing. [SVN r3793]
		
			
				
	
	
		
			19 lines
		
	
	
		
			532 B
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			19 lines
		
	
	
		
			532 B
		
	
	
	
		
			C++
		
	
	
	
	
	
| 
 | |
| // Copyright 2006-2007 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>
 | |
| 
 | |
| void foo(boost::unordered_set<int>& x1,
 | |
|         boost::unordered_map<int, int>& x2,
 | |
|         boost::unordered_multiset<int>& x3,
 | |
|         boost::unordered_multimap<int, int>& x4)
 | |
| {
 | |
|     x1.insert(1);
 | |
|     x2[2] = 2;
 | |
|     x3.insert(3);
 | |
|     x4.insert(std::make_pair(4, 5));
 | |
| }
 |