Home
last modified time | relevance | path

Searched refs:__first2 (Results 1 – 9 of 9) sorted by relevance

/reactos/sdk/include/c++/stlport/stl/
H A D_algobase.c44 ; ++__first1, ++__first2) { in lexicographical_compare()
45 if (*__first1 < *__first2) { in lexicographical_compare()
49 if (*__first2 < *__first1) in lexicographical_compare()
81 if (*__first1 < *__first2) { in __lexicographical_compare_3way()
85 if (*__first2 < *__first1) in __lexicographical_compare_3way()
88 ++__first2; in __lexicographical_compare_3way()
90 if (__first2 == __last2) { in __lexicographical_compare_3way()
237 _ForwardIter2 __p1(__first2); in search()
303 for (; __first2 != __last2; ++__first2) {
373 if (__first2 == __last2)
[all …]
H A D_list.c111 const_iterator __first2 = __x.begin();
114 *__first1++ = *__first2++;
115 if (__first2 == __last2)
118 insert(__last1, __first2, __last2);
173 _Literator __first2 = __x.begin(); in _S_merge() local
177 if (__comp(*__first2, *__first1)) { in _S_merge()
179 _Literator __next = __first2; in _S_merge()
181 __first2 = __next; in _S_merge()
186 if (__first2 != __last2) in _S_merge()
191 if (__comp(*__first2, *__first1)) { in _S_merge()
[all …]
H A D_algo.c389 __first2 = __middle; in __rotate_aux()
1427 ++__first2; in merge()
1449 ++__first2; in merge()
1631 ++__first2; in __set_union()
1636 ++__first2; in __set_union()
1676 ++__first2; in __set_intersection()
1680 ++__first2; in __set_intersection()
1721 ++__first2; in __set_difference()
1724 ++__first2; in __set_difference()
1765 ++__first2; in __set_symmetric_difference()
[all …]
H A D_algobase.h525 _STLP_FIX_LITERAL_BUG(__first2) in mismatch()
529 ++__first2; in mismatch()
540 _STLP_FIX_LITERAL_BUG(__first2) in mismatch()
544 ++__first2; in mismatch()
552 _InputIter2 __first2) { in equal() argument
555 for ( ; __first1 != __last1; ++__first1, ++__first2) in equal()
556 if (!(*__first1 == *__first2)) in equal()
565 _STLP_FIX_LITERAL_BUG(__first2) in equal()
568 if (!__binary_pred(*__first1, *__first2)) in equal()
592 const size_t __len2 = __last2 - __first2; in lexicographical_compare()
[all …]
H A D_algo.h139 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2)) in find_first_of()
148 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first2, __last2)) in find_first_of()
155 _ForwardIter2 __first2, _ForwardIter2 __last2);
162 for ( ; __first1 != __last1; ++__first1, ++__first2) in swap_ranges()
163 iter_swap(__first1, __first2); in swap_ranges()
164 return __first2; in swap_ranges()
181 for ( ; __first1 != __last1; ++__first1, ++__first2, ++__result) in transform()
182 *__result = __binary_op(*__first1, *__first2); in transform()
577 _InputIter2 __first2, _InputIter2 __last2,
583 _InputIter2 __first2, _InputIter2 __last2,
[all …]
H A D_numeric.h62 _InputIterator2 __first2, _Tp _Init) { in inner_product() argument
64 for ( ; __first1 != __last1; ++__first1, ++__first2) in inner_product()
65 _Init = _Init + (*__first1 * *__first2); in inner_product()
73 _InputIterator2 __first2, _Tp _Init, in inner_product() argument
77 for ( ; __first1 != __last1; ++__first1, ++__first2) in inner_product()
78 _Init = __binary_op1(_Init, __binary_op2(*__first1, *__first2)); in inner_product()
H A D_string.c75 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
87 const _CharT* __first2, const _CharT* __last2, in __str_find_first_of() argument
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
112 const _CharT* __first2, const _CharT* __last2, in __str_find_first_not_of_aux2() argument
122 const _CharT* __first2, const _CharT* __last2, in __str_find_first_not_of_aux1() argument
124 { return __str_find_first_not_of_aux2(__first1, __last1, __first2, __last2, in __str_find_first_not_of_aux1()
[all …]
H A D_list.h573 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)
580 *__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)
591 *__first1 = *__first2;
592 if (__first2 == __last2)
[all …]
H A D_uninitialized.h374 _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
406 _Iter __mid2 = uninitialized_copy(__first1, __last1, __first2); in __uninitialized_copy_fill()
410 _STLP_UNWIND(_STLP_STD::_Destroy_Range(__first2, __mid2)) in __uninitialized_copy_fill()