Home
last modified time | relevance | path

Searched refs:__first (Results 1 – 25 of 113) sorted by relevance

12345

/openbsd/src/gnu/gcc/libstdc++-v3/include/bits/
Dstl_algo.h153 for_each(_InputIterator __first, _InputIterator __last, _Function __f) in for_each() argument
157 __glibcxx_requires_valid_range(__first, __last); in for_each()
158 for ( ; __first != __last; ++__first) in for_each()
159 __f(*__first); in for_each()
170 __find(_InputIterator __first, _InputIterator __last, in __find() argument
173 while (__first != __last && !(*__first == __val)) in __find()
174 ++__first; in __find()
175 return __first; in __find()
185 __find_if(_InputIterator __first, _InputIterator __last, in __find_if() argument
188 while (__first != __last && !__pred(*__first)) in __find_if()
[all …]
Dstl_heap.h72 __is_heap(_RandomAccessIterator __first, _Distance __n) in _GLIBCXX_BEGIN_NAMESPACE()
77 if (__first[__parent] < __first[__child]) in _GLIBCXX_BEGIN_NAMESPACE()
88 __is_heap(_RandomAccessIterator __first, _StrictWeakOrdering __comp, in __is_heap() argument
94 if (__comp(__first[__parent], __first[__child])) in __is_heap()
104 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in __is_heap() argument
105 { return std::__is_heap(__first, std::distance(__first, __last)); } in __is_heap()
109 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, in __is_heap() argument
111 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } in __is_heap()
117 __push_heap(_RandomAccessIterator __first, in __push_heap() argument
121 while (__holeIndex > __topIndex && *(__first + __parent) < __value) in __push_heap()
[all …]
Dstl_uninitialized.h72 __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last, in _GLIBCXX_BEGIN_NAMESPACE()
75 { return std::copy(__first, __last, __result); } in _GLIBCXX_BEGIN_NAMESPACE()
79 __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last, in __uninitialized_copy_aux() argument
86 for (; __first != __last; ++__first, ++__cur) in __uninitialized_copy_aux()
87 std::_Construct(&*__cur, *__first); in __uninitialized_copy_aux()
108 uninitialized_copy(_InputIterator __first, _InputIterator __last, in uninitialized_copy() argument
113 return std::__uninitialized_copy_aux(__first, __last, __result, in uninitialized_copy()
118 uninitialized_copy(const char* __first, const char* __last, char* __result) in uninitialized_copy() argument
120 std::memmove(__result, __first, __last - __first); in uninitialized_copy()
121 return __result + (__last - __first); in uninitialized_copy()
[all …]
Dstl_numeric.h81 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) in _GLIBCXX_BEGIN_NAMESPACE()
85 __glibcxx_requires_valid_range(__first, __last); in _GLIBCXX_BEGIN_NAMESPACE()
87 for (; __first != __last; ++__first) in _GLIBCXX_BEGIN_NAMESPACE()
88 __init = __init + *__first; in _GLIBCXX_BEGIN_NAMESPACE()
107 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, in accumulate() argument
112 __glibcxx_requires_valid_range(__first, __last); in accumulate()
114 for (; __first != __last; ++__first) in accumulate()
115 __init = __binary_op(__init, *__first); in accumulate()
198 partial_sum(_InputIterator __first, _InputIterator __last, in partial_sum() argument
207 __glibcxx_requires_valid_range(__first, __last); in partial_sum()
[all …]
Dstl_algobase.h265 copy(_II __first, _II __last, _OI __result)
267 for (; __first != __last; ++__result, ++__first)
268 *__result = *__first;
278 copy(_II __first, _II __last, _OI __result)
281 for(_Distance __n = __last - __first; __n > 0; --__n)
283 *__result = *__first;
284 ++__first;
296 copy(const _Tp* __first, const _Tp* __last, _Tp* __result)
298 std::memmove(__result, __first, sizeof(_Tp) * (__last - __first));
299 return __result + (__last - __first);
[all …]
Dstl_construct.h118 __destroy_aux(_ForwardIterator __first, _ForwardIterator __last, in __destroy_aux() argument
121 for (; __first != __last; ++__first) in __destroy_aux()
122 std::_Destroy(&*__first); in __destroy_aux()
148 _Destroy(_ForwardIterator __first, _ForwardIterator __last) in _Destroy() argument
155 std::__destroy_aux(__first, __last, _Has_trivial_destructor()); in _Destroy()
170 _Destroy(_ForwardIterator __first, _ForwardIterator __last, in _Destroy() argument
173 for (; __first != __last; ++__first) in _Destroy()
174 __alloc.destroy(&*__first); in _Destroy()
179 _Destroy(_ForwardIterator __first, _ForwardIterator __last, in _Destroy() argument
182 _Destroy(__first, __last); in _Destroy()
Ddeque.tcc135 erase(iterator __first, iterator __last) in erase() argument
137 if (__first == begin() && __last == end()) in erase()
144 const difference_type __n = __last - __first; in erase()
145 const difference_type __elems_before = __first - begin(); in erase()
148 if (__first != begin()) in erase()
149 std::copy_backward(begin(), __first, __last); in erase()
155 std::copy(__last, end(), __first); in erase()
166 _M_assign_aux(_InputIterator __first, _InputIterator __last, in _M_assign_aux() argument
170 for (; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
171 *__cur = *__first; in _M_assign_aux()
[all …]
Dstl_bvector.h357 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x) in __fill_bvector() argument
359 for (; __first != __last; ++__first) in __fill_bvector()
360 *__first = __x; in __fill_bvector()
364 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x) in fill() argument
366 if (__first._M_p != __last._M_p) in fill()
368 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0); in fill()
369 __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x); in fill()
373 __fill_bvector(__first, __last, __x); in fill()
505 vector(_InputIterator __first, _InputIterator __last, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
510 _M_initialize_dispatch(__first, __last, _Integral()); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
Dlist.tcc177 iterator __first = begin(); in remove() local
179 while (__first != __last) in remove()
181 iterator __next = __first; in remove()
183 if (*__first == __value) in remove()
184 _M_erase(__first); in remove()
185 __first = __next; in remove()
194 iterator __first = begin(); in unique() local
196 if (__first == __last) in unique()
198 iterator __next = __first; in unique()
201 if (*__first == *__next) in unique()
[all …]
/openbsd/src/gnu/lib/libstdc++/libstdc++/include/bits/
Dstl_algo.h152 for_each(_InputIter __first, _InputIter __last, _Function __f) in for_each() argument
156 for ( ; __first != __last; ++__first) in for_each()
157 __f(*__first); in for_each()
168 find(_InputIter __first, _InputIter __last, in find() argument
172 while (__first != __last && !(*__first == __val)) in find()
173 ++__first; in find()
174 return __first; in find()
184 find_if(_InputIter __first, _InputIter __last, in find_if() argument
188 while (__first != __last && !__pred(*__first)) in find_if()
189 ++__first; in find_if()
[all …]
Dstl_heap.h70 __push_heap(_RandomAccessIterator __first, in __push_heap() argument
74 while (__holeIndex > __topIndex && *(__first + __parent) < __value) { in __push_heap()
75 *(__first + __holeIndex) = *(__first + __parent); in __push_heap()
79 *(__first + __holeIndex) = __value; in __push_heap()
84 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) in push_heap() argument
96 __push_heap(__first, _DistanceType((__last - __first) - 1), _DistanceType(0), in push_heap()
103 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, in __push_heap() argument
107 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __value)) { in __push_heap()
108 *(__first + __holeIndex) = *(__first + __parent); in __push_heap()
112 *(__first + __holeIndex) = __value; in __push_heap()
[all …]
Dstl_algobase.h223 __copy(_InputIter __first, _InputIter __last, in __copy() argument
227 for ( ; __first != __last; ++__result, ++__first) in __copy()
228 *__result = *__first; in __copy()
234 __copy(_RandomAccessIter __first, _RandomAccessIter __last, in __copy() argument
240 for (_Distance __n = __last - __first; __n > 0; --__n) { in __copy()
241 *__result = *__first; in __copy()
242 ++__first; in __copy()
250 __copy_trivial(const _Tp* __first, const _Tp* __last, _Tp* __result) in __copy_trivial() argument
252 memmove(__result, __first, sizeof(_Tp) * (__last - __first)); in __copy_trivial()
253 return __result + (__last - __first); in __copy_trivial()
[all …]
Dstl_numeric.h69 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) in accumulate() argument
74 for ( ; __first != __last; ++__first) in accumulate()
75 __init = __init + *__first; in accumulate()
81 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, in accumulate() argument
87 for ( ; __first != __last; ++__first) in accumulate()
88 __init = __binary_op(__init, *__first); in accumulate()
125 partial_sum(_InputIterator __first, _InputIterator __last, in partial_sum() argument
134 if (__first == __last) return __result; in partial_sum()
135 *__result = *__first; in partial_sum()
136 _ValueType __value = *__first; in partial_sum()
[all …]
Dstl_uninitialized.h73 __uninitialized_copy_aux(_InputIter __first, _InputIter __last, in __uninitialized_copy_aux() argument
76 { return copy(__first, __last, __result); } in __uninitialized_copy_aux()
80 __uninitialized_copy_aux(_InputIter __first, _InputIter __last, in __uninitialized_copy_aux() argument
86 for ( ; __first != __last; ++__first, ++__cur) in __uninitialized_copy_aux()
87 _Construct(&*__cur, *__first); in __uninitialized_copy_aux()
108 uninitialized_copy(_InputIter __first, _InputIter __last, _ForwardIter __result) in uninitialized_copy() argument
112 return __uninitialized_copy_aux(__first, __last, __result, _Is_POD()); in uninitialized_copy()
116 uninitialized_copy(const char* __first, const char* __last, char* __result) in uninitialized_copy() argument
118 memmove(__result, __first, __last - __first); in uninitialized_copy()
119 return __result + (__last - __first); in uninitialized_copy()
[all …]
Dlist.tcc183 iterator __first = begin(); in remove() local
185 while (__first != __last) in remove()
187 iterator __next = __first; in remove()
189 if (*__first == __value) in remove()
190 erase(__first); in remove()
191 __first = __next; in remove()
200 iterator __first = begin(); in unique() local
202 if (__first == __last) return; in unique()
203 iterator __next = __first; in unique()
206 if (*__first == *__next) in unique()
[all …]
Dstl_bvector.h401 void _M_initialize_range(_InputIterator __first, _InputIterator __last, in _M_initialize_range() argument
406 for ( ; __first != __last; ++__first) in _M_initialize_range()
407 push_back(*__first); in _M_initialize_range()
411 void _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last, in _M_initialize_range() argument
413 size_type __n = distance(__first, __last); in _M_initialize_range()
415 copy(__first, __last, _M_start); in _M_initialize_range()
420 _InputIterator __first, _InputIterator __last, in _M_insert_range() argument
422 for ( ; __first != __last; ++__first) { in _M_insert_range()
423 __pos = insert(__pos, *__first); in _M_insert_range()
430 _ForwardIterator __first, _ForwardIterator __last, in _M_insert_range() argument
[all …]
Dvector.tcc116 erase(iterator __first, iterator __last) in erase() argument
118 iterator __i(copy(__last, end(), __first)); in erase()
120 _M_finish = _M_finish - (__last - __first); in erase()
121 return __first; in erase()
177 _M_assign_aux(_InputIter __first, _InputIter __last, input_iterator_tag) in _M_assign_aux() argument
180 for ( ; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
181 *__cur = *__first; in _M_assign_aux()
182 if (__first == __last) in _M_assign_aux()
185 insert(end(), __first, __last); in _M_assign_aux()
191 _M_assign_aux(_ForwardIter __first, _ForwardIter __last, in _M_assign_aux() argument
[all …]
/openbsd/src/gnu/gcc/libstdc++-v3/include/debug/
Dfunctions.h95 __valid_range_aux2(const _RandomAccessIterator& __first, in __valid_range_aux2() argument
98 { return __last - __first >= 0; } in __valid_range_aux2()
124 __valid_range_aux(const _InputIterator& __first, in __valid_range_aux() argument
129 return __valid_range_aux2(__first, __last, _Category()); in __valid_range_aux()
139 __valid_range(const _InputIterator& __first, const _InputIterator& __last) in __valid_range() argument
142 return __valid_range_aux(__first, __last, _Integral()); in __valid_range()
148 __valid_range(const _Safe_iterator<_Iterator, _Sequence>& __first, in __valid_range() argument
150 { return __first._M_valid_range(__last); } in __valid_range()
158 __check_valid_range(const _InputIterator& __first, in __check_valid_range() argument
162 _GLIBCXX_DEBUG_ASSERT(__valid_range(__first, __last)); in __check_valid_range()
[all …]
/openbsd/src/gnu/llvm/libcxx/src/
Dcharconv.cpp45 to_chars_result to_chars(char* __first, char* __last, float __value) { in to_chars() argument
46 …return _Floating_to_chars<_Floating_to_chars_overload::_Plain>(__first, __last, __value, chars_for… in to_chars()
49 to_chars_result to_chars(char* __first, char* __last, double __value) { in to_chars() argument
50 …return _Floating_to_chars<_Floating_to_chars_overload::_Plain>(__first, __last, __value, chars_for… in to_chars()
53 to_chars_result to_chars(char* __first, char* __last, long double __value) { in to_chars() argument
54 …return _Floating_to_chars<_Floating_to_chars_overload::_Plain>(__first, __last, static_cast<double… in to_chars()
58 to_chars_result to_chars(char* __first, char* __last, float __value, chars_format __fmt) { in to_chars() argument
59 …return _Floating_to_chars<_Floating_to_chars_overload::_Format_only>(__first, __last, __value, __f… in to_chars()
62 to_chars_result to_chars(char* __first, char* __last, double __value, chars_format __fmt) { in to_chars() argument
63 …return _Floating_to_chars<_Floating_to_chars_overload::_Format_only>(__first, __last, __value, __f… in to_chars()
[all …]
/openbsd/src/gnu/llvm/libcxx/include/
D__bit_reference183 __find_bool_true(__bit_iterator<_Cp, _IsConst> __first, typename _Cp::size_type __n)
189 if (__first.__ctz_ != 0)
191 __storage_type __clz_f = static_cast<__storage_type>(__bits_per_word - __first.__ctz_);
193 …__storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f - __…
194 __storage_type __b = *__first.__seg_ & __m;
196 return _It(__first.__seg_, static_cast<unsigned>(_VSTD::__libcpp_ctz(__b)));
198 return __first + __n;
200 ++__first.__seg_;
203 for (; __n >= __bits_per_word; ++__first.__seg_, __n -= __bits_per_word)
204 if (*__first.__seg_)
[all …]
Dregex2695 basic_regex(_ForwardIterator __first, _ForwardIterator __last,
2700 __init(__first, __last);
2754 assign(_InputIterator __first, _InputIterator __last,
2757 basic_string<_CharT> __t(__first, __last);
2780 assign(_ForwardIterator __first, _ForwardIterator __last,
2783 return assign(basic_regex(__first, __last, __f));
2827 __init(_ForwardIterator __first, _ForwardIterator __last);
2830 __parse(_ForwardIterator __first, _ForwardIterator __last);
2833 __parse_basic_reg_exp(_ForwardIterator __first, _ForwardIterator __last);
2836 __parse_RE_expression(_ForwardIterator __first, _ForwardIterator __last);
[all …]
/openbsd/src/gnu/gcc/libstdc++-v3/include/ext/
Dalgorithm82 __copy_n(_InputIterator __first, _Size __count,
88 *__result = *__first;
89 ++__first;
92 return pair<_InputIterator, _OutputIterator>(__first, __result);
97 __copy_n(_RAIterator __first, _Size __count,
101 _RAIterator __last = __first + __count;
102 return pair<_RAIterator, _OutputIterator>(__last, std::copy(__first,
123 copy_n(_InputIterator __first, _Size __count, _OutputIterator __result)
130 return __copy_n(__first, __count, __result,
131 std::__iterator_category(__first));
[all …]
Dhashtable.h228 const unsigned long* __first = __stl_prime_list; in __stl_next_prime() local
230 const unsigned long* pos = std::lower_bound(__first, __last, __n); in __stl_next_prime()
511 _Node* __first;
512 for (__first = _M_buckets[__n];
513 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
514 __first = __first->_M_next)
516 return iterator(__first, this);
523 const _Node* __first;
524 for (__first = _M_buckets[__n];
525 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
[all …]
/openbsd/src/gnu/lib/libstdc++/libstdc++/include/ext/
Dalgorithm82 __copy_n(_InputIter __first, _Size __count,
87 *__result = *__first;
88 ++__first;
91 return pair<_InputIter, _OutputIter>(__first, __result);
96 __copy_n(_RAIter __first, _Size __count,
100 _RAIter __last = __first + __count;
102 std::copy(__first, __last, __result));
121 copy_n(_InputIter __first, _Size __count, _OutputIter __result)
128 return __copy_n(__first, __count, __result,
129 std::__iterator_category(__first));
[all …]
Dstl_hashtable.h197 const unsigned long* __first = __stl_prime_list; in __stl_next_prime() local
199 const unsigned long* pos = std::lower_bound(__first, __last, __n); in __stl_next_prime()
444 _Node* __first;
445 for ( __first = _M_buckets[__n];
446 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
447 __first = __first->_M_next)
449 return iterator(__first, this);
455 const _Node* __first;
456 for ( __first = _M_buckets[__n];
457 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
[all …]

12345