| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| D | _debug.h | 118 const __owned_link& __i2);
120 const __owned_link& __i2);
231 inline bool _STLP_CALL __valid_range(const _Iterator& __i1 ,const _Iterator& __i2, in __valid_range() argument
233 { return (__i1 < __i2) || (__i1 == __i2); } in __valid_range()
236 inline bool _STLP_CALL __valid_range(const _Iterator& __i1 ,const _Iterator& __i2, in __valid_range() argument
239 bool __dummy(__i1==__i2); in __valid_range()
244 inline bool _STLP_CALL __valid_range(const _Iterator& __i1 ,const _Iterator& __i2, in __valid_range() argument
247 bool __dummy(__i1==__i2); in __valid_range()
262 inline bool _STLP_CALL __valid_range(const _Iterator& __i1, const _Iterator& __i2) in __valid_range() argument
263 { return __valid_range(__i1,__i2,_STLP_ITERATOR_CATEGORY(__i1, _Iterator)); } in __valid_range()
[all …]
|
| D | _debug.c | 584 const __owned_link& __i2) { in _Check_same_owner() argument
586 _STLP_VERBOSE_RETURN(__i2._Valid(), _StlMsg_INVALID_RIGHTHAND_ITERATOR) in _Check_same_owner()
587 _STLP_VERBOSE_RETURN((__i1._Owner() == __i2._Owner()), _StlMsg_DIFFERENT_OWNERS) in _Check_same_owner()
594 const __owned_link& __i2) { in _Check_same_or_null_owner() argument
595 _STLP_VERBOSE_RETURN(__i1._Owner() == __i2._Owner(), _StlMsg_DIFFERENT_OWNERS) in _Check_same_or_null_owner()
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| D | _slist.c | 166 typename slist<_Tp, _Alloc>::iterator __i1(__that.before_begin()), __i2(__x.begin()); in _Slist_merge()
167 while (__i1._M_node->_M_next && __i2._M_node) { in _Slist_merge()
168 if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) { in _Slist_merge()
169 _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data), in _Slist_merge()
174 __i1 = __that.insert_after(__i1, *(__i2++)); in _Slist_merge()
177 __that.insert_after(__i1, __i2, __x.end()); in _Slist_merge()
|
| D | _algobase.h | 100 inline void __iter_swap_aux_aux(_ForwardIter1& __i1, _ForwardIter2& __i2, _Value *) { in __iter_swap_aux_aux() argument
102 *__i1 = *__i2; in __iter_swap_aux_aux()
103 *__i2 = tmp; in __iter_swap_aux_aux()
107 inline void __iter_swap_aux(_ForwardIter1& __i1, _ForwardIter2& __i2, const __true_type& /*OKToSwap… in __iter_swap_aux() argument
109 /*_STLP_STD::*/ swap(*__i1, *__i2); in __iter_swap_aux()
113 inline void __iter_swap_aux(_ForwardIter1& __i1, _ForwardIter2& __i2, const __false_type& /*OKToSwa… in __iter_swap_aux() argument
114 _STLP_PRIV __iter_swap_aux_aux( __i1, __i2, _STLP_VALUE_TYPE(__i1,_ForwardIter1) ); in __iter_swap_aux()
120 inline void iter_swap(_ForwardIter1 __i1, _ForwardIter2 __i2) { in iter_swap() argument
121 …_STLP_PRIV __iter_swap_aux( __i1, __i2, _IsOKToSwap(_STLP_VALUE_TYPE(__i1, _ForwardIter1), _STLP_V… in iter_swap()
123 … _STLP_IS_REF_TYPE_REAL_REF(__i2, _ForwardIter2))._Answer()); in iter_swap()
|
| D | _list.h | 712 const_iterator __i2 = __y.begin();
713 while (__i1 != __end1 && __i2 != __end2 && *__i1 == *__i2) {
715 ++__i2;
717 return __i1 == __end1 && __i2 == __end2;
|
| D | _slist.h | 847 const_iterator __i2 = _SL2.begin();
848 while (__i1 != __end1 && __i2 != __end2 && *__i1 == *__i2) {
850 ++__i2;
852 return __i1 == __end1 && __i2 == __end2;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| D | string | 1616 basic_string& replace(const_iterator __i1, const_iterator __i2, const basic_string& __str);
1618 …basic_string& replace(const_iterator __i1, const_iterator __i2, const value_type* __s, size_type _…
1620 basic_string& replace(const_iterator __i1, const_iterator __i2, const value_type* __s);
1622 basic_string& replace(const_iterator __i1, const_iterator __i2, size_type __n, value_type __c);
1629 replace(const_iterator __i1, const_iterator __i2, _InputIterator __j1, _InputIterator __j2);
1632 … basic_string& replace(const_iterator __i1, const_iterator __i2, initializer_list<value_type> __il)
1633 {return replace(__i1, __i2, __il.begin(), __il.end());}
3017 basic_string<_CharT, _Traits, _Allocator>::replace(const_iterator __i1, const_iterator __i2,
3022 if (__i1 == __i2)
3030 erase(__i1, __i2);
[all …]
|
| D | algorithm | 3801 value_type* __i2 = __j2;
3802 if (__comp(*__first1, *--__i2))
3804 ::new(__j2) value_type(_VSTD::move(*__i2));
3806 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2)
3807 *__j2 = _VSTD::move(*__i2);
|