1f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant//===----------------------------------------------------------------------===// 2f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant// 3f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant// The LLVM Compiler Infrastructure 4f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant// 5f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 6f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant// Source Licenses. See LICENSE.TXT for details. 7f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant// 8f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant//===----------------------------------------------------------------------===// 9f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant 10f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant// <unordered_map> 11f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant 12f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant// template <class Key, class Value, class Hash = hash<Key>, class Pred = equal_to<Key>, 13f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant// class Alloc = allocator<pair<const Key, Value>>> 14f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant// class unordered_multimap 15f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant 16f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant// void swap(unordered_multimap& x, unordered_multimap& y); 17f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant 185e57142c5902c3f73a6fdcb8cab55e88ffb43a56Howard Hinnant#if _LIBCPP_DEBUG >= 1 19f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) 20f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant#endif 21f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant 22f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant#include <unordered_map> 23f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant#include <cassert> 24f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant 25f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnantint main() 26f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant{ 275e57142c5902c3f73a6fdcb8cab55e88ffb43a56Howard Hinnant#if _LIBCPP_DEBUG >= 1 28f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant { 29f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant typedef std::pair<int, int> P; 30f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant P a1[] = {P(1, 1), P(3, 3), P(7, 7), P(9, 9), P(10, 10)}; 31f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant P a2[] = {P(0, 0), P(2, 2), P(4, 4), P(5, 5), P(6, 6), P(8, 8), P(11, 11)}; 32f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant std::unordered_multimap<int, int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 33f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant std::unordered_multimap<int, int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 34f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant std::unordered_multimap<int, int>::iterator i1 = c1.begin(); 35f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant std::unordered_multimap<int, int>::iterator i2 = c2.begin(); 36f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant swap(c1, c2); 37f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant c1.erase(i2); 38f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant c2.erase(i1); 39f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant std::unordered_multimap<int, int>::iterator j = i1; 40f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant c1.erase(i1); 41f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant assert(false); 42f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant } 43f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant#endif 44f890d9bfaadc13df40bb74e95cebd53ec826f932Howard Hinnant} 45