Home
last modified time | relevance | path

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

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_algobase.c40 _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()
44 ; ++__first1, ++__first2) { in lexicographical_compare()
45 if (*__first1 < *__first2) { in lexicographical_compare()
46 _STLP_VERBOSE_ASSERT(!(*__first2 < *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in lexicographical_compare()
49 if (*__first2 < *__first1) 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()
[all …]
D_list.c111 const_iterator __first2 = __x.begin();
113 while (__first1 != __last1 && __first2 != __last2)
114 *__first1++ = *__first2++;
115 if (__first2 == __last2)
118 insert(__last1, __first2, __last2);
173 _Literator __first2 = __x.begin(); in _S_merge() local
176 while (__first1 != __last1 && __first2 != __last2) { in _S_merge()
177 if (__comp(*__first2, *__first1)) { in _S_merge()
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in _S_merge()
179 _Literator __next = __first2; in _S_merge()
[all …]
D_algobase.h524 _InputIter2 __first2) { in mismatch() argument
525 _STLP_FIX_LITERAL_BUG(__first2) in mismatch()
527 while (__first1 != __last1 && *__first1 == *__first2) { in mismatch()
529 ++__first2; in mismatch()
531 return _STLP_STD::pair<_InputIter1, _InputIter2>(__first1, __first2); in mismatch()
538 _InputIter2 __first2, in mismatch() argument
540 _STLP_FIX_LITERAL_BUG(__first2) in mismatch()
542 while (__first1 != __last1 && __binary_pred(*__first1, *__first2)) { in mismatch()
544 ++__first2; in mismatch()
546 return _STLP_STD::pair<_InputIter1, _InputIter2>(__first1, __first2); in mismatch()
[all …]
D_algo.c53 _BidirectionalIter2 __first2,
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()
121 _ForwardIter2 __p1(__first2); in search()
124 return find(__first1, __last1, *__first2); in search()
129 __first1 = find(__first1, __last1, *__first2); 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()
[all …]
D_algo.h125 _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);
160 swap_ranges(_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2) { in swap_ranges() argument
162 for ( ; __first1 != __last1; ++__first1, ++__first2) in swap_ranges()
[all …]
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()
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
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 { return _STLP_STD::find_if(__first1, __last1, _STLP_PRIV _Not_within_traits<_Traits>(__first2, __l… in __str_find_first_not_of_aux3()
[all …]
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 …]
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()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
Dalgorithm899 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
904 if (__first2 == __last2)
912 if (__pred(*__first1, *__first2))
916 // *__first1 matches *__first2, now match elements after here
918 _ForwardIterator2 __m2 = __first2;
941 … _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred,
945 if (__first2 == __last2)
955 if (__first1 == __l1) // return __last1 if no element matches *__first2
965 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
980 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
[all …]
D__bit_reference867 __bit_iterator<__C2, false> __first2)
869 if (__first1.__ctz_ == __first2.__ctz_)
870 return __swap_ranges_aligned(__first1, __last1, __first2);
871 return __swap_ranges_unaligned(__first1, __last1, __first2);
958 __bit_iterator<_Cp, _IC2> __first2)
975 unsigned __clz_r = __bits_per_word - __first2.__ctz_;
977 … __m = (~__storage_type(0) << __first2.__ctz_) & (~__storage_type(0) >> (__clz_r - __ddn));
978 if (__first2.__ctz_ > __first1.__ctz_)
980 if ((*__first2.__seg_ & __m) != (__b << (__first2.__ctz_ - __first1.__ctz_)))
985 if ((*__first2.__seg_ & __m) != (__b >> (__first1.__ctz_ - __first2.__ctz_)))
[all …]
Dnumeric92 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __in…
94 for (; __first1 != __last1; ++__first1, ++__first2)
95 __init = __init + *__first1 * *__first2;
102 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2,
105 for (; __first1 != __last1; ++__first1, ++__first2)
106 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
Dutility208 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2)
210 for(; __first1 != __last1; ++__first1, ++__first2)
211 swap(*__first1, *__first2);
212 return __first2;