| /external/stlport/stlport/stl/ |
| D | _algobase.c | 40 _InputIter2 __first2, _InputIter2 __last2) { in lexicographical_compare() argument
42 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2)) in lexicographical_compare()
43 for ( ; __first1 != __last1 && __first2 != __last2 in lexicographical_compare()
52 return __first1 == __last1 && __first2 != __last2; in lexicographical_compare()
57 _InputIter2 __first2, _InputIter2 __last2, in lexicographical_compare() argument
60 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2)) in lexicographical_compare()
61 for ( ; __first1 != __last1 && __first2 != __last2 in lexicographical_compare()
71 return __first1 == __last1 && __first2 != __last2; in lexicographical_compare()
79 _InputIter2 __first2, _InputIter2 __last2) { in __lexicographical_compare_3way() argument
80 while (__first1 != __last1 && __first2 != __last2) { in __lexicographical_compare_3way()
[all …]
|
| D | _list.c | 112 const_iterator __last2 = __x.end();
113 while (__first1 != __last1 && __first2 != __last2)
115 if (__first2 == __last2)
118 insert(__last1, __first2, __last2);
174 _Literator __last2 = __x.end(); in _S_merge() local
176 while (__first1 != __last1 && __first2 != __last2) { in _S_merge()
186 if (__first2 != __last2) in _S_merge()
187 _List_global_inst::_Transfer(__last1._M_node, __first2._M_node, __last2._M_node); in _S_merge()
190 while (__first1 != __last1 && __first2 != __last2) { in _S_merge()
198 if (__first2 != __last2) { in _S_merge()
[all …]
|
| D | _algo.c | 54 _BidirectionalIter2 __last2,
113 _ForwardIter2 __first2, _ForwardIter2 __last2) { in search() argument
115 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2)) in search()
117 if (__first1 == __last1 || __first2 == __last2) in search()
123 if ( ++__p1 == __last2 ) in search()
139 if (++__p == __last2) in search()
274 _ForwardIter2 __first2, _ForwardIter2 __last2) { in find_end() argument
276 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2)) in find_end()
277 return _STLP_PRIV __find_end(__first1, __last1, __first2, __last2, in find_end()
1420 _InputIter2 __first2, _InputIter2 __last2, in merge() argument
[all …]
|
| D | _algobase.h | 579 _InputIter2 __first2, _InputIter2 __last2);
583 _InputIter2 __first2, _InputIter2 __last2,
590 const unsigned char* __last2) { in lexicographical_compare() argument
592 const size_t __len2 = __last2 - __first2; in lexicographical_compare()
594 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2)) in lexicographical_compare()
603 const char* __first2, const char* __last2) { in lexicographical_compare() argument
605 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2)) in lexicographical_compare()
610 (const unsigned char*) __last2); in lexicographical_compare()
618 _InputIter2 __first2, _InputIter2 __last2);
624 const unsigned char* __last2) { in __lexicographical_compare_3way() argument
[all …]
|
| D | _algo.h | 125 _ForwardIter2 __first2, _ForwardIter2 __last2);
137 _ForwardIter __first2, _ForwardIter __last2) { in find_first_of() argument
139 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2)) in find_first_of()
140 return _STLP_PRIV __find_first_of(__first1, __last1, __first2, __last2); in find_first_of()
146 _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) { in find_first_of() argument
148 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2)) in find_first_of()
149 return _STLP_PRIV __find_first_of(__first1, __last1, __first2, __last2, __comp); in find_first_of()
155 _ForwardIter2 __first2, _ForwardIter2 __last2);
577 _InputIter2 __first2, _InputIter2 __last2,
583 _InputIter2 __first2, _InputIter2 __last2,
[all …]
|
| D | _string.c | 75 const _CharT* __first2, const _CharT* __last2, in __str_find_first_of_aux() argument
77 { return __find_first_of(__first1, __last1, __first2, __last2); } in __str_find_first_of_aux()
81 const _CharT* __first2, const _CharT* __last2, in __str_find_first_of_aux() argument
83 { return __find_first_of(__first1, __last1, __first2, __last2, _STLP_PRIV _Eq_traits<_Traits>()); } in __str_find_first_of_aux()
87 const _CharT* __first2, const _CharT* __last2, in __str_find_first_of() argument
95 return __str_find_first_of_aux(__first1, __last1, __first2, __last2, __traits, _STLportTraits()); in __str_find_first_of()
100 const _CharT* __first2, const _CharT* __last2, in __str_find_first_not_of_aux3() argument
102 { return __find_first_of_aux2(__first1, __last1, __first2, __last2, __first2, not1(_Identity<bool>(… in __str_find_first_not_of_aux3()
106 const _CharT* __first2, const _CharT* __last2, in __str_find_first_not_of_aux3() argument
108 …_STLP_STD::find_if(__first1, __last1, _STLP_PRIV _Not_within_traits<_Traits>(__first2, __last2)); } in __str_find_first_not_of_aux3()
[all …]
|
| D | _list.h | 573 void _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2,
576 void assign(const value_type *__first2, const value_type *__last2) {
579 for ( ; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2)
581 if (__first2 == __last2)
584 insert(__last1, __first2, __last2);
586 void assign(const_iterator __first2, const_iterator __last2) {
590 for ( ; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2)
592 if (__first2 == __last2)
595 insert(__last1, __first2, __last2);
|
| D | _uninitialized.h | 374 _InputIter2 __first2, _InputIter2 __last2, in __uninitialized_copy_copy() argument
378 return uninitialized_copy(__first2, __last2, __new_result); in __uninitialized_copy_copy()
404 __uninitialized_copy_fill(_Iter __first1, _Iter __last1, _Iter __first2, _Iter __last2, in __uninitialized_copy_fill() argument
408 uninitialized_fill(__mid2, __last2, __x); in __uninitialized_copy_fill()
|