1//===----------------------------------------------------------------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is dual licensed under the MIT and the University of Illinois Open 6// Source Licenses. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9 10// <unordered_map> 11 12// Call erase(const_iterator first, const_iterator last); with both iterators from another container 13 14#if _LIBCPP_DEBUG >= 1 15 16#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) 17 18#include <unordered_map> 19#include <cassert> 20#include <exception> 21#include <cstdlib> 22 23int main() 24{ 25 { 26 typedef std::pair<int, int> P; 27 P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; 28 std::unordered_map<int, int> l1(a1, a1+3); 29 std::unordered_map<int, int> l2(a1, a1+3); 30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin())); 31 assert(false); 32 } 33} 34 35#else 36 37int main() 38{ 39} 40 41#endif 42