Home
last modified time | relevance | path

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

1234

/freebsd-9-stable/contrib/libstdc++/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_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()
517 vector(_InputIterator __first, _InputIterator __last, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
522 _M_initialize_dispatch(__first, __last, _Integral()); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
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_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()
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 …]
Dvector.tcc121 erase(iterator __first, iterator __last) in erase() argument
124 std::copy(__last, end(), __first); in erase()
125 _M_erase_at_end(__first.base() + (end() - __last)); in erase()
126 return __first; in erase()
194 _M_assign_aux(_InputIterator __first, _InputIterator __last, in _M_assign_aux() argument
198 for (; __first != __last && __cur != this->_M_impl._M_finish; in _M_assign_aux()
199 ++__cur, ++__first) in _M_assign_aux()
200 *__cur = *__first; in _M_assign_aux()
201 if (__first == __last) in _M_assign_aux()
204 insert(end(), __first, __last); in _M_assign_aux()
[all …]
Dstl_vector.h266 vector(_InputIterator __first, _InputIterator __last,
272 _M_initialize_dispatch(__first, __last, _Integral()); in _Base()
324 assign(_InputIterator __first, _InputIterator __last) in assign() argument
328 _M_assign_dispatch(__first, __last, _Integral()); in assign()
685 insert(iterator __position, _InputIterator __first, in insert() argument
690 _M_insert_dispatch(__position, __first, __last, _Integral()); in insert()
730 erase(iterator __first, iterator __last);
775 _ForwardIterator __first, _ForwardIterator __last) in _M_allocate_and_copy() argument
780 std::__uninitialized_copy_a(__first, __last, __result, in _M_allocate_and_copy()
809 _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, in _M_initialize_dispatch() argument
[all …]
Dstreambuf_iterator.h284 copy(istreambuf_iterator<_CharT> __first, in copy() argument
288 if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed) in copy()
291 __copy_streambufs_eof(__first._M_sbuf, __result._M_sbuf, __ineof); in copy()
301 __copy_aux(_CharT* __first, _CharT* __last, in __copy_aux() argument
304 const streamsize __num = __last - __first; in __copy_aux()
306 __result._M_put(__first, __num); in __copy_aux()
313 __copy_aux(const _CharT* __first, const _CharT* __last, in __copy_aux() argument
316 const streamsize __num = __last - __first; in __copy_aux()
318 __result._M_put(__first, __num); in __copy_aux()
325 __copy_aux(istreambuf_iterator<_CharT> __first, in __copy_aux() argument
[all …]
Dstl_iterator_base_funcs.h75 __distance(_InputIterator __first, _InputIterator __last, in _GLIBCXX_BEGIN_NAMESPACE()
82 while (__first != __last) in _GLIBCXX_BEGIN_NAMESPACE()
84 ++__first; in _GLIBCXX_BEGIN_NAMESPACE()
92 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, in __distance() argument
98 return __last - __first; in __distance()
115 distance(_InputIterator __first, _InputIterator __last) in distance() argument
118 return std::__distance(__first, __last, in distance()
119 std::__iterator_category(__first)); in distance()
Dstl_list.h84 transfer(_List_node_base * const __first,
520 list(_InputIterator __first, _InputIterator __last,
526 _M_initialize_dispatch(__first, __last, _Integral()); in _Base()
575 assign(_InputIterator __first, _InputIterator __last) in assign() argument
579 _M_assign_dispatch(__first, __last, _Integral()); in assign()
840 insert(iterator __position, _InputIterator __first, in insert() argument
843 list __tmp(__first, __last, _M_get_Node_allocator()); in insert()
884 erase(iterator __first, iterator __last) in erase() argument
886 while (__first != __last) in erase()
887 __first = erase(__first); in erase()
[all …]
Dstl_deque.h355 fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first,
739 deque(_InputIterator __first, _InputIterator __last,
745 _M_initialize_dispatch(__first, __last, _Integral()); in _Base()
794 assign(_InputIterator __first, _InputIterator __last) in assign() argument
797 _M_assign_dispatch(__first, __last, _Integral()); in assign()
1156 insert(iterator __position, _InputIterator __first, in insert() argument
1161 _M_insert_dispatch(__position, __first, __last, _Integral()); in insert()
1197 erase(iterator __first, iterator __last);
1247 _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, in _M_initialize_dispatch() argument
1252 _M_range_initialize(__first, __last, _IterCategory()); in _M_initialize_dispatch()
[all …]
/freebsd-9-stable/contrib/libstdc++/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 …]
Dlist110 list(_InputIterator __first, _InputIterator __last,
112 : _Base(__gnu_debug::__check_valid_range(__first, __last), __last, __a)
132 assign(_InputIterator __first, _InputIterator __last)
134 __glibcxx_check_valid_range(__first, __last);
135 _Base::assign(__first, __last);
283 insert(iterator __position, _InputIterator __first,
286 __glibcxx_check_insert_range(__position, __first, __last);
287 _Base::insert(__position.base(), __first, __last);
359 splice(iterator __position, list& __x, iterator __first, iterator __last)
362 __glibcxx_check_valid_range(__first, __last);
[all …]
/freebsd-9-stable/contrib/libc++/include/
Dnumeric72 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
74 for (; __first != __last; ++__first)
75 __init = __init + *__first;
82 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op)
84 for (; __first != __last; ++__first)
85 __init = __binary_op(__init, *__first);
113 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
115 if (__first != __last)
117 typename iterator_traits<_InputIterator>::value_type __t(*__first);
119 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
[all …]
Dalgorithm811 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
813 for (; __first != __last; ++__first)
814 if (!__pred(*__first))
824 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
826 for (; __first != __last; ++__first)
827 if (__pred(*__first))
837 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
839 for (; __first != __last; ++__first)
840 if (__pred(*__first))
850 for_each(_InputIterator __first, _InputIterator __last, _Function __f)
[all …]
D__bit_reference162 __find_bool_true(__bit_iterator<_Cp, _IsConst> __first, typename _Cp::size_type __n)
168 if (__first.__ctz_ != 0)
170 __storage_type __clz_f = static_cast<__storage_type>(__bits_per_word - __first.__ctz_);
172 …__storage_type __m = (~__storage_type(0) << __first.__ctz_) & (~__storage_type(0) >> (__clz_f - __…
173 __storage_type __b = *__first.__seg_ & __m;
175 return _It(__first.__seg_, static_cast<unsigned>(_VSTD::__ctz(__b)));
177 return __first + __n;
179 ++__first.__seg_;
182 for (; __n >= __bits_per_word; ++__first.__seg_, __n -= __bits_per_word)
183 if (*__first.__seg_)
[all …]
Dregex2513 basic_regex(_ForwardIterator __first, _ForwardIterator __last,
2517 {__parse(__first, __last);}
2573 assign(_InputIterator __first, _InputIterator __last,
2576 basic_string<_CharT> __t(__first, __last);
2599 assign(_ForwardIterator __first, _ForwardIterator __last,
2603 __parse(__first, __last);
2642 __parse(_ForwardIterator __first, _ForwardIterator __last);
2645 __parse_basic_reg_exp(_ForwardIterator __first, _ForwardIterator __last);
2648 __parse_RE_expression(_ForwardIterator __first, _ForwardIterator __last);
2651 __parse_simple_RE(_ForwardIterator __first, _ForwardIterator __last);
[all …]
/freebsd-9-stable/contrib/libstdc++/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.h229 const unsigned long* __first = __stl_prime_list; in __stl_next_prime() local
231 const unsigned long* pos = std::lower_bound(__first, __last, __n); in __stl_next_prime()
512 _Node* __first;
513 for (__first = _M_buckets[__n];
514 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
515 __first = __first->_M_next)
517 return iterator(__first, this);
524 const _Node* __first;
525 for (__first = _M_buckets[__n];
526 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
[all …]
Dmemory78 __uninitialized_copy_n(_InputIter __first, _Size __count,
84 for (; __count > 0 ; --__count, ++__first, ++__cur)
85 std::_Construct(&*__cur, *__first);
86 return pair<_InputIter, _ForwardIter>(__first, __cur);
97 __uninitialized_copy_n(_RandomAccessIter __first, _Size __count,
101 _RandomAccessIter __last = __first + __count;
103 (__last, std::uninitialized_copy(__first, __last, __result)));
108 __uninitialized_copy_n(_InputIter __first, _Size __count,
110 { return __uninitialized_copy_n(__first, __count, __result,
111 __iterator_category(__first)); }
[all …]
/freebsd-9-stable/contrib/libc++/include/ext/
Dhash_set248 hash_set(_InputIterator __first, _InputIterator __last);
250 hash_set(_InputIterator __first, _InputIterator __last,
254 hash_set(_InputIterator __first, _InputIterator __last,
285 void insert(_InputIterator __first, _InputIterator __last);
292 void erase(const_iterator __first, const_iterator __last)
293 {__table_.erase(__first, __last);}
349 _InputIterator __first, _InputIterator __last)
352 insert(__first, __last);
358 _InputIterator __first, _InputIterator __last, size_type __n,
363 insert(__first, __last);
[all …]

1234