4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
39 lines
862 B
C++
39 lines
862 B
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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_set>
|
|
|
|
// Call erase(const_iterator first, const_iterator last); with a bad range
|
|
|
|
#if _LIBCPP_DEBUG >= 1
|
|
|
|
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
|
|
|
|
#include <unordered_set>
|
|
#include <cassert>
|
|
#include <exception>
|
|
#include <cstdlib>
|
|
|
|
int main()
|
|
{
|
|
{
|
|
int a1[] = {1, 2, 3};
|
|
std::unordered_multiset<int> l1(a1, a1+3);
|
|
std::unordered_multiset<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
|
assert(false);
|
|
}
|
|
}
|
|
|
|
#else
|
|
|
|
int main()
|
|
{
|
|
}
|
|
|
|
#endif
|