0bb0a7c9ea
There are actually two debug modes:
1. -D_LIBCPP_DEBUG2 or -D_LIBCPP_DEBUG2=1
This is a relatively expensive debug mode, but very thorough. This is normally what you want to debug with, but may turn O(1) operations into O(N) operations.
2. -D_LIBCPP_DEBUG2=0
This is "debug lite." Only preconditions that can be checked with O(1) expense are checked. For example range checking on an indexing operation. But not iterator validity.
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@187369 91177308-0d34-0410-b5e6-96231b3b80d8
39 lines
789 B
C++
39 lines
789 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 position) with end()
|
|
|
|
#if _LIBCPP_DEBUG2 >= 1
|
|
|
|
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
|
|
|
|
#include <unordered_set>
|
|
#include <cassert>
|
|
|
|
int main()
|
|
{
|
|
{
|
|
int a1[] = {1, 2, 3};
|
|
std::unordered_multiset<int> l1(a1, a1+3);
|
|
std::unordered_multiset<int>::const_iterator i = l1.end();
|
|
l1.erase(i);
|
|
assert(false);
|
|
}
|
|
}
|
|
|
|
#else
|
|
|
|
int main()
|
|
{
|
|
}
|
|
|
|
#endif
|