Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/libstdc++/include/bits/
H A Dlist.tcc130 ++__first1, ++__first2) in operator =()
131 *__first1 = *__first2; in operator =()
132 if (__first2 == __last2) in operator =()
164 ++__first1, ++__first2) in _M_assign_dispatch()
225 if (*__first2 < *__first1) in merge()
227 iterator __next = __first2; in merge()
229 __first2 = __next; in merge()
233 if (__first2 != __last2) in merge()
257 iterator __next = __first2; in merge()
259 __first2 = __next; in merge()
[all …]
H A Dstl_algobase.h707 _InputIterator2 __first2)
720 ++__first2;
753 ++__first2;
772 _InputIterator2 __first2)
783 if (!(*__first1 == *__first2))
805 _InputIterator2 __first2,
851 ++__first1, ++__first2)
853 if (*__first1 < *__first2)
855 if (*__first2 < *__first1)
887 ++__first1, ++__first2)
[all …]
H A Dstl_algo.h1769 ++__first2; in __rotate()
1781 ++__first2; in __rotate()
4552 ++__first2; in set_intersection()
4557 ++__first2; in set_intersection()
4610 ++__first2; in set_intersection()
4615 ++__first2; in set_intersection()
4669 ++__first2; in set_difference()
4673 ++__first2; in set_difference()
4731 ++__first2; in set_difference()
4735 ++__first2; in set_difference()
[all …]
H A Dstl_numeric.h136 _InputIterator2 __first2, _Tp __init) in inner_product() argument
143 for (; __first1 != __last1; ++__first1, ++__first2) in inner_product()
144 __init = __init + (*__first1 * *__first2); in inner_product()
168 _InputIterator2 __first2, _Tp __init, in inner_product() argument
177 for (; __first1 != __last1; ++__first1, ++__first2) in inner_product()
178 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2)); in inner_product()
H A Dstl_uninitialized.h323 _InputIterator2 __first2, in __uninitialized_copy_copy() argument
333 return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc); in __uninitialized_copy_copy()
372 _ForwardIterator __first2, in __uninitialized_copy_fill() argument
377 __first2, in __uninitialized_copy_fill()
385 std::_Destroy(__first2, __mid2, __alloc); in __uninitialized_copy_fill()
/freebsd-12.1/contrib/libc++/include/
H A Dalgorithm4282 ++__first2;
4339 ++__first2;
4534 ++__first2;
4562 ++__first2;
4570 for (; __first2 != __last2; ++__first2, ++__result)
4601 ++__first2;
4608 ++__first2;
5306 ++__first2;
5351 ++__first2;
5410 ++__first2;
[all …]
H A D__bit_reference975 if ((*__first2.__seg_ & __m) != (__b << (__first2.__ctz_ - __first1.__ctz_)))
980 if ((*__first2.__seg_ & __m) != (__b >> (__first1.__ctz_ - __first2.__ctz_)))
983 __first2.__seg_ += (__ddn + __first2.__ctz_) / __bits_per_word;
984 __first2.__ctz_ = static_cast<unsigned>((__ddn + __first2.__ctz_) % __bits_per_word);
1003 if ((*__first2.__seg_ & __m) != (__b << __first2.__ctz_))
1005 ++__first2.__seg_;
1016 if ((*__first2.__seg_ & __m) != (__b << __first2.__ctz_))
1018 __first2.__seg_ += (__dn + __first2.__ctz_) / __bits_per_word;
1019 __first2.__ctz_ = static_cast<unsigned>((__dn + __first2.__ctz_) % __bits_per_word);
1053 ++__first2.__seg_;
[all …]
H A Dnumeric208 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __in…
210 for (; __first1 != __last1; ++__first1, (void) ++__first2)
211 __init = __init + *__first1 * *__first2;
218 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2,
221 for (; __first1 != __last1; ++__first1, (void) ++__first2)
222 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
243 _InputIterator2 __first2, _Tp __init, _BinaryOp1 __b1, _BinaryOp2 __b2)
245 for (; __first1 != __last1; ++__first1, (void) ++__first2)
246 __init = __b1(__init, __b2(*__first1, *__first2));
254 _InputIterator2 __first2, _Tp __init)
[all …]
H A D__string750 const _CharT *__first2, const _CharT *__last2) {
753 const ptrdiff_t __len2 = __last2 - __first2;
761 // First element of __first2 is loop invariant.
762 _CharT __f2 = *__first2;
775 // already know that it matches the first byte of __first2: this is because
776 // __first2 is most likely aligned, as it is user's "pattern" string, and
779 if (_Traits::compare(__first1, __first2, __len2) == 0)
H A Dcharconv270 __inner_product(_It1 __first1, _It1 __last1, _It2 __first2, _Up __init)
272 for (; __first1 < __last1; ++__first1, ++__first2)
273 __init = __init + *__first1 * *__first2;
H A Dfunctional2840 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
2843 if (__first2 == __last2)
2847 // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks
2850 if (__first1 == __last1) // return __last1 if no element matches *__first2
2852 if (__pred(*__first1, *__first2))
2856 // *__first1 matches *__first2, now match elements after here
2858 _ForwardIterator2 __m2 = __first2;
2878 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
2884 const _D2 __len2 = __last2 - __first2;
2898 if (__pred(*__first1, *__first2))
[all …]
H A Dutility258 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2)
260 for(; __first1 != __last1; ++__first1, (void) ++__first2)
261 swap(*__first1, *__first2);
262 return __first2;
/freebsd-12.1/contrib/libstdc++/include/ext/
H A Dalgorithm138 _InputIterator2 __first2,
143 if (*__first1 < *__first2)
145 if (*__first2 < *__first1)
148 ++__first2;
150 if (__first2 == __last2)
159 const unsigned char* __first2,
163 const ptrdiff_t __len2 = __last2 - __first2;
171 const char* __first2, const char* __last2)
176 (const signed char*) __first2,
181 (const unsigned char*) __first2,
[all …]