| //===----------------------------------------------------------------------===// |
| // |
| // The LLVM Compiler Infrastructure |
| // |
| // This file is dual licensed under the MIT and the University of Illinois Open |
| // Source Licenses. See LICENSE.TXT for details. |
| // |
| //===----------------------------------------------------------------------===// |
| |
| // <unordered_map> |
| |
| // Call erase(const_iterator first, const_iterator last); with a bad range |
| |
| #if _LIBCPP_DEBUG2 >= 1 |
| |
| #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) |
| |
| #include <unordered_map> |
| #include <cassert> |
| #include <exception> |
| #include <cstdlib> |
| |
| int main() |
| { |
| { |
| typedef std::pair<int, int> P; |
| P a1[] = {P(1, 1), P(2, 2), P(3, 3)}; |
| std::unordered_multimap<int, int> l1(a1, a1+3); |
| std::unordered_multimap<int, int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin()); |
| assert(false); |
| } |
| } |
| |
| #else |
| |
| int main() |
| { |
| } |
| |
| #endif |