Definition in file macros.h.
Go to the source code of this file.
|
|
|
Verify that the iterator range [_First, _Last) is a heap w.r.t. the predicate _Pred. |
|
Verify that we can insert into *this with the iterator _Position. Insertion into a container at a specific position requires that the iterator be nonsingular (i.e., either dereferenceable or past-the-end) and that it reference the sequence we are inserting into. Note that this macro is only valid when the container is a _Safe_sequence and the iterator is a _Safe_iterator. Definition at line 69 of file macros.h. Referenced by std::__debug::vector< _Tp, _Allocator >::insert(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::insert(), std::__debug::set< _Key, _Compare, _Allocator >::insert(), std::__debug::multiset< _Key, _Compare, _Allocator >::insert(), std::__debug::multimap< _Key, _Tp, _Compare, _Allocator >::insert(), std::__debug::map< _Key, _Tp, _Compare, _Allocator >::insert(), std::__debug::list< _Tp, _Allocator >::insert(), std::__debug::deque< _Tp, _Allocator >::insert(), and std::__debug::list< _Tp, _Allocator >::splice(). |
|
Verify that we can insert the values in the iterator range [_First, _Last) into *this with the iterator _Position. Insertion into a container at a specific position requires that the iterator be nonsingular (i.e., either dereferenceable or past-the-end), that it reference the sequence we are inserting into, and that the iterator range [_First, Last) is a valid (possibly empty) range. Note that this macro is only valid when the container is a _Safe_sequence and the iterator is a _Safe_iterator. We would like to be able to check for noninterference of _Position and the range [_First, _Last), but that can't (in general) be done. Definition at line 92 of file macros.h. Referenced by std::__debug::vector< _Tp, _Allocator >::insert(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::insert(), std::__debug::list< _Tp, _Allocator >::insert(), and std::__debug::deque< _Tp, _Allocator >::insert(). |
|
Verify that the iterator range [_First, _Last) is partitioned w.r.t. the value _Value. |
|
Verify that the iterator range [_First, _Last) is partitioned w.r.t. the value _Value and predicate _Pred. |
|
Verify that the iterator range [_First, _Last) is sorted by the predicate _Pred. Definition at line 165 of file macros.h. Referenced by std::__debug::list< _Tp, _Allocator >::merge(). |
|