generic-library/cxx
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Rename _LIBCPP_DEBUG2 to _LIBCPP_DEBUG.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@189140 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Howard Hinnant 2013-08-23 20:10:18 +00:00
parent 5d5f9f9786
commit 5e57142c59
162 changed files with 292 additions and 292 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
include/__config
View File

@ -525,13 +525,13 @@ template <unsigned> struct __static_assert_check {};
#define _LIBCPP_DECLARE_STRONG_ENUM_EPILOG(x)
#endif // _LIBCPP_HAS_NO_STRONG_ENUMS
#ifdef _LIBCPP_DEBUG2
# if _LIBCPP_DEBUG2 == 0
#ifdef _LIBCPP_DEBUG
# if _LIBCPP_DEBUG == 0
# define _LIBCPP_DEBUG_LEVEL 1
# elif _LIBCPP_DEBUG2 == 1
# elif _LIBCPP_DEBUG == 1
# define _LIBCPP_DEBUG_LEVEL 2
# else
# error Supported values for _LIBCPP_DEBUG2 are 0 and 1
# error Supported values for _LIBCPP_DEBUG are 0 and 1
# endif
# define _LIBCPP_EXTERN_TEMPLATE(...)
#endif

2
include/__hash_table
View File

@ -20,7 +20,7 @@
#include <__undef_min_max>
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
# include <__debug>
#else
# define _LIBCPP_ASSERT(x, m) ((void)0)

142
include/algorithm
View File

@ -714,7 +714,7 @@ public:
bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);}
};
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
template <class _Compare>
struct __debug_less
@ -731,7 +731,7 @@ struct __debug_less
}
};
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
// Precondition: __x != 0
inline _LIBCPP_INLINE_VISIBILITY
@ -3953,14 +3953,14 @@ inline _LIBCPP_INLINE_VISIBILITY
void
sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
__sort<_Comp_ref>(__first, __last, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
__sort<_Comp_ref>(__first, __last, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _RandomAccessIterator>
@ -4066,14 +4066,14 @@ inline _LIBCPP_INLINE_VISIBILITY
_ForwardIterator
lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __lower_bound<_Comp_ref>(__first, __last, __value_, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _ForwardIterator, class _Tp>
@ -4114,14 +4114,14 @@ inline _LIBCPP_INLINE_VISIBILITY
_ForwardIterator
upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __upper_bound<_Comp_ref>(__first, __last, __value_, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _ForwardIterator, class _Tp>
@ -4174,14 +4174,14 @@ inline _LIBCPP_INLINE_VISIBILITY
pair<_ForwardIterator, _ForwardIterator>
equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __equal_range<_Comp_ref>(__first, __last, __value_, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __equal_range<_Comp_ref>(__first, __last, __value_, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _ForwardIterator, class _Tp>
@ -4209,14 +4209,14 @@ inline _LIBCPP_INLINE_VISIBILITY
bool
binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __binary_search<_Comp_ref>(__first, __last, __value_, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __binary_search<_Comp_ref>(__first, __last, __value_, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _ForwardIterator, class _Tp>
@ -4259,14 +4259,14 @@ _OutputIterator
merge(_InputIterator1 __first1, _InputIterator1 __last1,
_InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
@ -4433,16 +4433,16 @@ inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _
__buf = _VSTD::get_temporary_buffer<value_type>(__buf_size);
__h.reset(__buf.first);
}
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2,
__buf.first, __buf.second);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2,
__buf.first, __buf.second);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _BidirectionalIterator>
@ -4644,14 +4644,14 @@ stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compar
__buf = _VSTD::get_temporary_buffer<value_type>(__len);
__h.reset(__buf.first);
}
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
__stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
__stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _RandomAccessIterator>
@ -4793,14 +4793,14 @@ inline _LIBCPP_INLINE_VISIBILITY
void
push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
__push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
__push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _RandomAccessIterator>
@ -4831,14 +4831,14 @@ inline _LIBCPP_INLINE_VISIBILITY
void
pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
__pop_heap<_Comp_ref>(__first, __last, __c, __last - __first);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
__pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _RandomAccessIterator>
@ -4871,14 +4871,14 @@ inline _LIBCPP_INLINE_VISIBILITY
void
make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
__make_heap<_Comp_ref>(__first, __last, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
__make_heap<_Comp_ref>(__first, __last, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _RandomAccessIterator>
@ -4905,14 +4905,14 @@ inline _LIBCPP_INLINE_VISIBILITY
void
sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
__sort_heap<_Comp_ref>(__first, __last, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
__sort_heap<_Comp_ref>(__first, __last, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _RandomAccessIterator>
@ -4949,14 +4949,14 @@ void
partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last,
_Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
__partial_sort<_Comp_ref>(__first, __middle, __last, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
__partial_sort<_Comp_ref>(__first, __middle, __last, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _RandomAccessIterator>
@ -4999,14 +4999,14 @@ _RandomAccessIterator
partial_sort_copy(_InputIterator __first, _InputIterator __last,
_RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _InputIterator, class _RandomAccessIterator>
@ -5213,14 +5213,14 @@ inline _LIBCPP_INLINE_VISIBILITY
void
nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
__nth_element<_Comp_ref>(__first, __nth, __last, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
__nth_element<_Comp_ref>(__first, __nth, __last, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _RandomAccessIterator>
@ -5254,14 +5254,14 @@ bool
includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2,
_Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _InputIterator1, class _InputIterator2>
@ -5307,14 +5307,14 @@ _OutputIterator
set_union(_InputIterator1 __first1, _InputIterator1 __last1,
_InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
@ -5359,14 +5359,14 @@ _OutputIterator
set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
_InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
@ -5413,14 +5413,14 @@ _OutputIterator
set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
_InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
@ -5472,14 +5472,14 @@ _OutputIterator
set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
_InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
@ -5516,14 +5516,14 @@ bool
lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
_InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _InputIterator1, class _InputIterator2>
@ -5571,14 +5571,14 @@ inline _LIBCPP_INLINE_VISIBILITY
bool
next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __next_permutation<_Comp_ref>(__first, __last, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __next_permutation<_Comp_ref>(__first, __last, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _BidirectionalIterator>
@ -5624,14 +5624,14 @@ inline _LIBCPP_INLINE_VISIBILITY
bool
prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
{
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref;
__debug_less<_Compare> __c(__comp);
return __prev_permutation<_Comp_ref>(__first, __last, __c);
#else // _LIBCPP_DEBUG2
#else // _LIBCPP_DEBUG
typedef typename add_lvalue_reference<_Compare>::type _Comp_ref;
return __prev_permutation<_Comp_ref>(__first, __last, __comp);
#endif // _LIBCPP_DEBUG2
#endif // _LIBCPP_DEBUG
}
template <class _BidirectionalIterator>

2
include/iterator
View File

@ -321,7 +321,7 @@ template <class T, size_t N> T* end(T (&array)[N]);
#include <Availability.h>
#endif
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
# include <__debug>
#else
# define _LIBCPP_ASSERT(x, m) ((void)0)

2
include/list
View File

@ -178,7 +178,7 @@ template <class T, class Alloc>
#include <__undef_min_max>
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
# include <__debug>
#else
# define _LIBCPP_ASSERT(x, m) ((void)0)

2
include/vector
View File

@ -274,7 +274,7 @@ void swap(vector<T,Allocator>& x, vector<T,Allocator>& y)
#include <__undef_min_max>
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
# include <__debug>
#else
# define _LIBCPP_ASSERT(x, m) ((void)0)

2
src/debug.cpp
View File

@ -7,7 +7,7 @@
//
//===----------------------------------------------------------------------===//
#define _LIBCPP_DEBUG2 1
#define _LIBCPP_DEBUG 1
#include "__config"
#include "__debug"
#include "functional"

2
test/containers/sequences/list/db_back.pass.cpp
View File

@ -11,7 +11,7 @@
// Call back() on empty container.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/db_cback.pass.cpp
View File

@ -11,7 +11,7 @@
// Call back() on empty const container.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/db_cfront.pass.cpp
View File

@ -11,7 +11,7 @@
// Call front() on empty const container.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/db_front.pass.cpp
View File

@ -11,7 +11,7 @@
// Call front() on empty container.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/db_iterators_6.pass.cpp
View File

@ -11,7 +11,7 @@
// Decrement iterator prior to begin.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/db_iterators_7.pass.cpp
View File

@ -11,7 +11,7 @@
// Increment iterator past end.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/db_iterators_8.pass.cpp
View File

@ -11,7 +11,7 @@
// Dereference non-dereferenceable iterator.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/db_iterators_9.pass.cpp
View File

@ -11,7 +11,7 @@
// Operations on "NULL" iterators
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) do { if (!x) throw 1; } while(0)

2
test/containers/sequences/list/list.cons/move.pass.cpp
View File

@ -61,7 +61,7 @@ int main()
assert(l2.get_allocator() == lo.get_allocator());
}
#endif
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int> l1 = {1, 2, 3};
std::list<int>::iterator i = l1.begin();

6
test/containers/sequences/list/list.modifiers/emplace.pass.cpp
View File

@ -11,7 +11,7 @@
// template <class... Args> void emplace(const_iterator p, Args&&... args);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -51,7 +51,7 @@ int main()
assert(c.back().geti() == 3);
assert(c.back().getd() == 4.5);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<A> c1;
std::list<A> c2;
@ -75,7 +75,7 @@ int main()
assert(c.back().geti() == 3);
assert(c.back().getd() == 4.5);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<A, min_allocator<A>> c1;
std::list<A, min_allocator<A>> c2;

2
test/containers/sequences/list/list.modifiers/erase_iter_db1.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator position) with end()
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/list.modifiers/erase_iter_db2.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator position) with iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/list.modifiers/erase_iter_iter_db1.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with first iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/list.modifiers/erase_iter_iter_db2.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with second iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/list.modifiers/erase_iter_iter_db3.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with both iterators from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/list/list.modifiers/erase_iter_iter_db4.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with a bad range
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

6
test/containers/sequences/list/list.modifiers/insert_iter_iter_iter.pass.cpp
View File

@ -12,7 +12,7 @@
// template <InputIterator Iter>
// iterator insert(const_iterator position, Iter first, Iter last);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -99,7 +99,7 @@ int main()
assert(*i == 3);
}
throw_next = 0xFFFF;
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int> v(100);
std::list<int> v2(100);
@ -167,7 +167,7 @@ int main()
++i;
assert(*i == 3);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
throw_next = 0xFFFF;
std::list<int, min_allocator<int>> v(100);

6
test/containers/sequences/list/list.modifiers/insert_iter_rvalue.pass.cpp
View File

@ -11,7 +11,7 @@
// iterator insert(const_iterator position, value_type&& x);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -35,7 +35,7 @@ int main()
assert(l1.back() == MoveOnly(1));
}
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int> v1(3);
std::list<int> v2(3);
@ -56,7 +56,7 @@ int main()
assert(l1.back() == MoveOnly(1));
}
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int, min_allocator<int>> v1(3);
std::list<int, min_allocator<int>> v2(3);

6
test/containers/sequences/list/list.modifiers/insert_iter_size_value.pass.cpp
View File

@ -11,7 +11,7 @@
// iterator insert(const_iterator position, size_type n, const value_type& x);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -62,7 +62,7 @@ int main()
assert(save_count == count);
assert(l1 == std::list<int>(a2, a2+8));
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int> c1(100);
std::list<int> c2;
@ -92,7 +92,7 @@ int main()
assert(save_count == count);
assert((l1 == std::list<int, min_allocator<int>>(a2, a2+8)));
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int, min_allocator<int>> c1(100);
std::list<int, min_allocator<int>> c2;

6
test/containers/sequences/list/list.modifiers/insert_iter_value.pass.cpp
View File

@ -11,7 +11,7 @@
// iterator insert(const_iterator position, const value_type& x);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -64,7 +64,7 @@ int main()
assert(save_count == count);
assert(l1 == std::list<int>(a2, a2+4));
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int> v1(3);
std::list<int> v2(3);
@ -97,7 +97,7 @@ int main()
assert(save_count == count);
assert((l1 == std::list<int, min_allocator<int>>(a2, a2+4)));
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int, min_allocator<int>> v1(3);
std::list<int, min_allocator<int>> v2(3);

6
test/containers/sequences/list/list.modifiers/pop_back.pass.cpp
View File

@ -11,7 +11,7 @@
// void pop_back();
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -31,7 +31,7 @@ int main()
assert(c == std::list<int>(a, a+1));
c.pop_back();
assert(c.empty());
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
c.pop_back();
assert(false);
#endif
@ -46,7 +46,7 @@ int main()
assert((c == std::list<int, min_allocator<int>>(a, a+1)));
c.pop_back();
assert(c.empty());
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
c.pop_back();
assert(false);
#endif

6
test/containers/sequences/list/list.ops/splice_pos_list.pass.cpp
View File

@ -11,7 +11,7 @@
// void splice(const_iterator position, list& x);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -403,7 +403,7 @@ int main()
++i;
assert(*i == 6);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int> v1(3);
std::list<int> v2(3);
@ -791,7 +791,7 @@ int main()
++i;
assert(*i == 6);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int, min_allocator<int>> v1(3);
std::list<int, min_allocator<int>> v2(3);

6
test/containers/sequences/list/list.ops/splice_pos_list_iter.pass.cpp
View File

@ -11,7 +11,7 @@
// void splice(const_iterator position, list<T,Allocator>& x, iterator i);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -180,7 +180,7 @@ int main()
++i;
assert(*i == 2);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int> v1(3);
std::list<int> v2(3);
@ -345,7 +345,7 @@ int main()
++i;
assert(*i == 2);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int, min_allocator<int>> v1(3);
std::list<int, min_allocator<int>> v2(3);

6
test/containers/sequences/list/list.ops/splice_pos_list_iter_iter.pass.cpp
View File

@ -11,7 +11,7 @@
// void splice(const_iterator position, list& x, iterator first, iterator last);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -120,7 +120,7 @@ int main()
i = l2.begin();
assert(*i == 4);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int> v1(3);
std::list<int> v2(3);
@ -225,7 +225,7 @@ int main()
i = l2.begin();
assert(*i == 4);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::list<int, min_allocator<int>> v1(3);
std::list<int, min_allocator<int>> v2(3);

4
test/containers/sequences/list/list.special/db_swap_1.pass.cpp
View File

@ -12,7 +12,7 @@
// template <class T, class Alloc>
// void swap(list<T,Alloc>& x, list<T,Alloc>& y);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -24,7 +24,7 @@
int main()
{
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
int a1[] = {1, 3, 7, 9, 10};
int a2[] = {0, 2, 4, 5, 6, 8, 11};

2
test/containers/sequences/vector/db_back.pass.cpp
View File

@ -11,7 +11,7 @@
// Call back() on empty container.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_cback.pass.cpp
View File

@ -11,7 +11,7 @@
// Call back() on empty const container.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_cfront.pass.cpp
View File

@ -11,7 +11,7 @@
// Call front() on empty const container.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_cindex.pass.cpp
View File

@ -11,7 +11,7 @@
// Index const vector out of bounds.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_front.pass.cpp
View File

@ -11,7 +11,7 @@
// Call front() on empty container.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_index.pass.cpp
View File

@ -11,7 +11,7 @@
// Index vector out of bounds.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_iterators_2.pass.cpp
View File

@ -11,7 +11,7 @@
// Compare iterators from different containers with <.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_iterators_3.pass.cpp
View File

@ -11,7 +11,7 @@
// Subtract iterators from different containers.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_iterators_4.pass.cpp
View File

@ -11,7 +11,7 @@
// Index iterator out of bounds.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_iterators_5.pass.cpp
View File

@ -11,7 +11,7 @@
// Add to iterator out of bounds.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_iterators_6.pass.cpp
View File

@ -11,7 +11,7 @@
// Decrement iterator prior to begin.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_iterators_7.pass.cpp
View File

@ -11,7 +11,7 @@
// Increment iterator past end.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/db_iterators_8.pass.cpp
View File

@ -11,7 +11,7 @@
// Dereference non-dereferenceable iterator.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

6
test/containers/sequences/vector/vector.modifiers/emplace.pass.cpp
View File

@ -11,7 +11,7 @@
// template <class... Args> iterator emplace(const_iterator pos, Args&&... args);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -107,7 +107,7 @@ int main()
assert(c.back().geti() == 3);
assert(c.back().getd() == 4.5);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::vector<A> c1;
std::vector<A> c2;
@ -140,7 +140,7 @@ int main()
assert(c.back().geti() == 3);
assert(c.back().getd() == 4.5);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::vector<A, min_allocator<A>> c1;
std::vector<A, min_allocator<A>> c2;

2
test/containers/sequences/vector/vector.modifiers/erase_iter_db1.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator position) with end()
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/vector.modifiers/erase_iter_db2.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator position) with iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/vector.modifiers/erase_iter_iter_db1.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with first iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/vector.modifiers/erase_iter_iter_db2.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with second iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/vector.modifiers/erase_iter_iter_db3.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with both iterators from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/sequences/vector/vector.modifiers/erase_iter_iter_db4.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with a bad range
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

6
test/containers/sequences/vector/vector.modifiers/insert_iter_iter_iter.pass.cpp
View File

@ -12,7 +12,7 @@
// template <class Iter>
// iterator insert(const_iterator position, Iter first, Iter last);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -88,7 +88,7 @@ int main()
for (; j < 105; ++j)
assert(v[j] == 0);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::vector<int> v(100);
std::vector<int> v2(100);
@ -132,7 +132,7 @@ int main()
for (; j < 105; ++j)
assert(v[j] == 0);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::vector<int, min_allocator<int>> v(100);
std::vector<int, min_allocator<int>> v2(100);

6
test/containers/sequences/vector/vector.modifiers/insert_iter_rvalue.pass.cpp
View File

@ -11,7 +11,7 @@
// iterator insert(const_iterator position, value_type&& x);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -48,7 +48,7 @@ int main()
for (++j; j < 101; ++j)
assert(v[j] == MoveOnly());
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::vector<int> v1(3);
std::vector<int> v2(3);
@ -69,7 +69,7 @@ int main()
for (++j; j < 101; ++j)
assert(v[j] == MoveOnly());
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::vector<int, min_allocator<int>> v1(3);
std::vector<int, min_allocator<int>> v2(3);

6
test/containers/sequences/vector/vector.modifiers/insert_iter_size_value.pass.cpp
View File

@ -11,7 +11,7 @@
// iterator insert(const_iterator position, size_type n, const value_type& x);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -48,7 +48,7 @@ int main()
for (++j; j < 105; ++j)
assert(v[j] == 0);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::vector<int> c1(100);
std::vector<int> c2;
@ -83,7 +83,7 @@ int main()
for (++j; j < 105; ++j)
assert(v[j] == 0);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::vector<int, min_allocator<int>> c1(100);
std::vector<int, min_allocator<int>> c2;

6
test/containers/sequences/vector/vector.modifiers/insert_iter_value.pass.cpp
View File

@ -11,7 +11,7 @@
// iterator insert(const_iterator position, const value_type& x);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -46,7 +46,7 @@ int main()
for (++j; j < 101; ++j)
assert(v[j] == 0);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::vector<int> v1(3);
std::vector<int> v2(3);
@ -68,7 +68,7 @@ int main()
for (++j; j < 101; ++j)
assert(v[j] == 0);
}
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::vector<int, min_allocator<int>> v1(3);
std::vector<int, min_allocator<int>> v2(3);

8
test/containers/sequences/vector/vector.modifiers/pop_back.pass.cpp
View File

@ -11,7 +11,7 @@
// void pop_back();
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -20,7 +20,7 @@
#include "../../../stack_allocator.h"
#include "../../../min_allocator.h"
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#include <cstdlib>
#include <exception>
@ -34,7 +34,7 @@ int main()
assert(c.size() == 1);
c.pop_back();
assert(c.size() == 0);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
c.pop_back();
assert(false);
#endif
@ -46,7 +46,7 @@ int main()
assert(c.size() == 1);
c.pop_back();
assert(c.size() == 0);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
c.pop_back();
assert(false);
#endif

4
test/containers/sequences/vector/vector.special/db_swap_1.pass.cpp
View File

@ -12,7 +12,7 @@
// template <class T, class Alloc>
// void swap(vector<T,Alloc>& x, vector<T,Alloc>& y);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -23,7 +23,7 @@
int main()
{
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
int a1[] = {1, 3, 7, 9, 10};
int a2[] = {0, 2, 4, 5, 6, 8, 11};

2
test/containers/unord/unord.map/bucket.pass.cpp
View File

@ -15,7 +15,7 @@
// size_type bucket(const key_type& __k) const;
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif

2
test/containers/unord/unord.map/bucket_size.pass.cpp
View File

@ -15,7 +15,7 @@
// size_type bucket_size(size_type n) const
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif

2
test/containers/unord/unord.map/db_iterators_7.pass.cpp
View File

@ -11,7 +11,7 @@
// Increment iterator past end.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.map/db_iterators_8.pass.cpp
View File

@ -11,7 +11,7 @@
// Dereference non-dereferenceable iterator.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.map/db_local_iterators_7.pass.cpp
View File

@ -11,7 +11,7 @@
// Increment local_iterator past end.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.map/db_local_iterators_8.pass.cpp
View File

@ -11,7 +11,7 @@
// Dereference non-dereferenceable iterator.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.map/max_load_factor.pass.cpp
View File

@ -16,7 +16,7 @@
// float max_load_factor() const;
// void max_load_factor(float mlf);
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif

2
test/containers/unord/unord.map/unord.map.cnstr/assign_move.pass.cpp
View File

@ -213,7 +213,7 @@ int main()
assert(c0.size() == 0);
}
#endif
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::unordered_map<int, int> s1 = {{1, 1}, {2, 2}, {3, 3}};
std::unordered_map<int, int>::iterator i = s1.begin();

2
test/containers/unord/unord.map/unord.map.cnstr/move.pass.cpp
View File

@ -184,7 +184,7 @@ int main()
assert(c0.empty());
}
#endif
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::unordered_map<int, int> s1 = {{1, 1}, {2, 2}, {3, 3}};
std::unordered_map<int, int>::iterator i = s1.begin();

4
test/containers/unord/unord.map/unord.map.swap/db_swap_1.pass.cpp
View File

@ -15,7 +15,7 @@
// void swap(unordered_map& x, unordered_map& y);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -24,7 +24,7 @@
int main()
{
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
typedef std::pair<int, int> P;
P a1[] = {P(1, 1), P(3, 3), P(7, 7), P(9, 9), P(10, 10)};

4
test/containers/unord/unord.map/unorder.map.modifiers/emplace_hint.pass.cpp
View File

@ -16,7 +16,7 @@
// template <class... Args>
// iterator emplace_hint(const_iterator p, Args&&... args);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -76,7 +76,7 @@ int main()
assert(r->second == Emplaceable(6, 7));
}
#endif
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
typedef std::unordered_map<int, Emplaceable> C;
typedef C::iterator R;

2
test/containers/unord/unord.map/unorder.map.modifiers/erase_iter_db1.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator position) with end()
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.map/unorder.map.modifiers/erase_iter_db2.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator position) with iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.map/unorder.map.modifiers/erase_iter_iter_db1.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with first iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.map/unorder.map.modifiers/erase_iter_iter_db2.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with second iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.map/unorder.map.modifiers/erase_iter_iter_db3.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with both iterators from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.map/unorder.map.modifiers/erase_iter_iter_db4.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with a bad range
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

4
test/containers/unord/unord.map/unorder.map.modifiers/insert_hint_const_lvalue.pass.cpp
View File

@ -15,7 +15,7 @@
// iterator insert(const_iterator p, const value_type& x);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -81,7 +81,7 @@ int main()
assert(r->second == 4);
}
#endif
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
typedef std::unordered_map<double, int> C;
typedef C::iterator R;

4
test/containers/unord/unord.map/unorder.map.modifiers/insert_hint_rvalue.pass.cpp
View File

@ -17,7 +17,7 @@
// class = typename enable_if<is_convertible<P, value_type>::value>::type>
// iterator insert(const_iterator p, P&& x);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -140,7 +140,7 @@ int main()
assert(r->second == 4);
}
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
typedef std::unordered_map<double, int> C;
typedef C::iterator R;

2
test/containers/unord/unord.multimap/bucket.pass.cpp
View File

@ -15,7 +15,7 @@
// size_type bucket(const key_type& __k) const;
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif

2
test/containers/unord/unord.multimap/bucket_size.pass.cpp
View File

@ -15,7 +15,7 @@
// size_type bucket_size(size_type n) const
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif

2
test/containers/unord/unord.multimap/db_iterators_7.pass.cpp
View File

@ -11,7 +11,7 @@
// Increment iterator past end.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.multimap/db_iterators_8.pass.cpp
View File

@ -11,7 +11,7 @@
// Dereference non-dereferenceable iterator.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.multimap/db_local_iterators_7.pass.cpp
View File

@ -11,7 +11,7 @@
// Increment local_iterator past end.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.multimap/db_local_iterators_8.pass.cpp
View File

@ -11,7 +11,7 @@
// Dereference non-dereferenceable iterator.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.multimap/max_load_factor.pass.cpp
View File

@ -16,7 +16,7 @@
// float max_load_factor() const;
// void max_load_factor(float mlf);
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif

2
test/containers/unord/unord.multimap/unord.multimap.cnstr/assign_move.pass.cpp
View File

@ -290,7 +290,7 @@ int main()
assert(c.max_load_factor() == 1);
}
#endif
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::unordered_multimap<int, int> s1 = {{1, 1}, {2, 2}, {3, 3}};
std::unordered_multimap<int, int>::iterator i = s1.begin();

2
test/containers/unord/unord.multimap/unord.multimap.cnstr/move.pass.cpp
View File

@ -228,7 +228,7 @@ int main()
assert(c0.empty());
}
#endif
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
std::unordered_multimap<int, int> s1 = {{1, 1}, {2, 2}, {3, 3}};
std::unordered_multimap<int, int>::iterator i = s1.begin();

4
test/containers/unord/unord.multimap/unord.multimap.modifiers/emplace_hint.pass.cpp
View File

@ -16,7 +16,7 @@
// template <class... Args>
// iterator emplace_hint(const_iterator p, Args&&... args);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -92,7 +92,7 @@ int main()
assert(r->second == Emplaceable(5, 6));
}
#endif
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
typedef std::unordered_multimap<int, Emplaceable> C;
typedef C::iterator R;

2
test/containers/unord/unord.multimap/unord.multimap.modifiers/erase_iter_db1.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator position) with end()
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.multimap/unord.multimap.modifiers/erase_iter_db2.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator position) with iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.multimap/unord.multimap.modifiers/erase_iter_iter_db1.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with first iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.multimap/unord.multimap.modifiers/erase_iter_iter_db2.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with second iterator from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.multimap/unord.multimap.modifiers/erase_iter_iter_db3.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with both iterators from another container
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.multimap/unord.multimap.modifiers/erase_iter_iter_db4.pass.cpp
View File

@ -11,7 +11,7 @@
// Call erase(const_iterator first, const_iterator last); with a bad range
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

4
test/containers/unord/unord.multimap/unord.multimap.modifiers/insert_hint_const_lvalue.pass.cpp
View File

@ -15,7 +15,7 @@
// iterator insert(const_iterator p, const value_type& x);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -81,7 +81,7 @@ int main()
assert(r->second == 4);
}
#endif
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
typedef std::unordered_multimap<double, int> C;
typedef C::iterator R;

4
test/containers/unord/unord.multimap/unord.multimap.modifiers/insert_hint_rvalue.pass.cpp
View File

@ -17,7 +17,7 @@
// class = typename enable_if<is_convertible<P, value_type>::value>::type>
// iterator insert(const_iterator p, P&& x);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -140,7 +140,7 @@ int main()
assert(r->second == 4);
}
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
typedef std::unordered_multimap<double, int> C;
typedef C::iterator R;

4
test/containers/unord/unord.multimap/unord.multimap.swap/db_swap_1.pass.cpp
View File

@ -15,7 +15,7 @@
// void swap(unordered_multimap& x, unordered_multimap& y);
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif
@ -24,7 +24,7 @@
int main()
{
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
{
typedef std::pair<int, int> P;
P a1[] = {P(1, 1), P(3, 3), P(7, 7), P(9, 9), P(10, 10)};

2
test/containers/unord/unord.multiset/bucket.pass.cpp
View File

@ -15,7 +15,7 @@
// size_type bucket(const key_type& __k) const;
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif

2
test/containers/unord/unord.multiset/bucket_size.pass.cpp
View File

@ -15,7 +15,7 @@
// size_type bucket_size(size_type n) const
#ifdef _LIBCPP_DEBUG2
#ifdef _LIBCPP_DEBUG
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
#endif

2
test/containers/unord/unord.multiset/db_iterators_7.pass.cpp
View File

@ -11,7 +11,7 @@
// Increment iterator past end.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

2
test/containers/unord/unord.multiset/db_iterators_8.pass.cpp
View File

@ -11,7 +11,7 @@
// Dereference non-dereferenceable iterator.
#if _LIBCPP_DEBUG2 >= 1
#if _LIBCPP_DEBUG >= 1
#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))

Some files were not shown because too many files have changed in this diff Show More