Searched refs:__first (Results 1 - 25 of 167) sorted by relevance

1234567

/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
H A Dstl_heap.h75 __is_heap_until(_RandomAccessIterator __first, _Distance __n, argument
81 if (__comp(__first + __parent, __first + __child))
94 __is_heap(_RandomAccessIterator __first, _Distance __n) argument
97 return std::__is_heap_until(__first, __n, __comp) == __n;
104 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) argument
108 return std::__is_heap_until(__first, __n, __cmp) == __n;
114 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
115 { return std::__is_heap(__first, std::distance(__first, __las
120 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
134 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare& __comp) argument
161 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
197 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
223 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) argument
253 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Compare& __comp) argument
282 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
316 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
339 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) argument
374 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
401 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
418 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) argument
439 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
467 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
496 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
525 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
550 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
564 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
H A Dstl_numeric.h79 * @param __first Start of range.
88 iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value) argument
95 __glibcxx_requires_valid_range(__first, __last);
97 for (; __first != __last; ++__first)
99 *__first = __value;
126 * @param __first Start of range.
134 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) argument
138 __glibcxx_requires_valid_range(__first, __last);
140 for (; __first !
161 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op) argument
256 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result) argument
298 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) argument
338 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result) argument
382 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) argument
[all...]
H A Dstl_construct.h128 _Destroy(_ForwardIterator __first, _ForwardIterator __last);
149 __destroy(_ForwardIterator __first, _ForwardIterator __last) argument
151 for (; __first != __last; ++__first)
152 std::_Destroy(std::__addressof(*__first));
171 _Destroy(_ForwardIterator __first, _ForwardIterator __last) argument
182 return _Destroy_aux<false>::__destroy(__first, __last);
185 __destroy(__first, __last);
193 __destroy_n(_ForwardIterator __first, _Size __count) argument
195 for (; __count > 0; (void)++__first,
206 __destroy_n(_ForwardIterator __first, _Size __count) argument
220 _Destroy_n(_ForwardIterator __first, _Size __count) argument
240 destroy(_ForwardIterator __first, _ForwardIterator __last) argument
247 destroy_n(_ForwardIterator __first, _Size __count) argument
[all...]
H A Dstl_algo.h103 __find_if_not(_InputIterator __first, _InputIterator __last, argument
106 return std::__find_if(__first, __last,
108 std::__iterator_category(__first));
117 __find_if_not_n(_InputIterator __first, _Distance& __len, _Predicate __pred) argument
119 for (; __len; --__len, (void) ++__first)
120 if (!__pred(__first))
122 return __first;
194 __search_n_aux(_ForwardIterator __first, _ForwardIterator __last, argument
198 __first = std::__find_if(__first, __las
227 __search_n_aux(_RandomAccessIter __first, _RandomAccessIter __last, _Integer __count, _UnaryPredicate __unary_pred, std::random_access_iterator_tag) argument
258 __search_n(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, _UnaryPredicate __unary_pred) argument
452 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
470 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
489 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
505 find_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
530 is_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
552 partition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument
590 __remove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) argument
619 remove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value) argument
653 remove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) argument
688 copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) argument
711 __copy_n_a(_InputIterator __first, _Size __n, _OutputIterator __result) argument
736 __copy_n(_InputIterator __first, _Size __n, _OutputIterator __result, input_iterator_tag) argument
748 __copy_n(_RandomAccessIterator __first, _Size __n, _OutputIterator __result, random_access_iterator_tag) argument
768 copy_n(_InputIterator __first, _Size __n, _OutputIterator __result) argument
805 partition_copy(_InputIterator __first, _InputIterator __last, _OutputIterator1 __out_true, _OutputIterator2 __out_false, _Predicate __pred) argument
838 __remove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument
875 remove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) argument
909 remove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument
926 __adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) argument
944 __unique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) argument
978 unique(_ForwardIterator __first, _ForwardIterator __last) argument
1009 unique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) argument
1034 __unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, forward_iterator_tag, output_iterator_tag) argument
1064 __unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, output_iterator_tag) argument
1097 __unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, forward_iterator_tag) argument
1120 __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) argument
1141 __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) argument
1170 reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) argument
1198 reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) argument
1242 __rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, forward_iterator_tag) argument
1284 __rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, bidirectional_iterator_tag) argument
1323 __rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, random_access_iterator_tag) argument
1430 rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) argument
1468 rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) argument
1486 __partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) argument
1512 __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, bidirectional_iterator_tag) argument
1548 __stable_partition_adaptive(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size) argument
1608 __stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument
1649 stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument
1667 __heap_select(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) argument
1683 __partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) argument
1738 partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) argument
1789 partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) argument
1844 __insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
1868 __unguarded_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
1886 __final_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
1903 __unguarded_partition(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __pivot, _Compare __comp) argument
1925 __unguarded_partition_pivot(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
1937 __partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) argument
1950 __introsort_loop(_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) argument
1974 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
1989 __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) argument
2036 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
2053 __upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
2092 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) argument
2123 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
2141 __equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _CompareItTp __comp_it_val, _CompareTpIt __comp_val_it) argument
2196 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) argument
2233 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
2267 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) argument
2301 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
2394 __rotate_adaptive(_BidirectionalIterator1 __first, _BidirectionalIterator1 __middle, _BidirectionalIterator1 __last, _Distance __len1, _Distance __len2, _BidirectionalIterator2 __buffer, _Distance __buffer_size) argument
2432 __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
2493 __merge_without_buffer(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Compare __comp) argument
2542 __inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) argument
2590 inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) argument
2631 inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) argument
2681 __merge_sort_loop(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _Distance __step_size, _Compare __comp) argument
2706 __chunk_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance __chunk_size, _Compare __comp) argument
2722 __merge_sort_with_buffer(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Compare __comp) argument
2749 __stable_sort_adaptive(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
2778 __inplace_stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
2926 __next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) argument
2976 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) argument
3009 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) argument
3028 __prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) argument
3079 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) argument
3112 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) argument
3135 __replace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred, const _Tp& __new_value) argument
3164 replace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __old_value, const _Tp& __new_value) argument
3200 replace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred, const _Tp& __new_value) argument
3228 is_sorted(_ForwardIterator __first, _ForwardIterator __last) argument
3243 is_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
3250 __is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
3274 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last) argument
3299 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
3355 __minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
3426 minmax_element(_ForwardIterator __first, _ForwardIterator __last) argument
3454 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
3753 shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, _UniformRandomNumberGenerator&& __g) argument
3838 for_each(_InputIterator __first, _InputIterator __last, _Function __f) argument
3864 for_each_n(_InputIterator __first, _Size __n, _Function __f) argument
3900 find(_InputIterator __first, _InputIterator __last, const _Tp& __val) argument
3925 find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
4031 adjacent_find(_ForwardIterator __first, _ForwardIterator __last) argument
4057 adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) argument
4083 count(_InputIterator __first, _InputIterator __last, const _Tp& __value) argument
4107 count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
4224 search_n(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val) argument
4259 search_n(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val, _BinaryPredicate __binary_pred) argument
4284 search(_ForwardIterator __first, _ForwardIterator __last, const _Searcher& __searcher) argument
4309 transform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __unary_op) argument
4380 replace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) argument
4413 replace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) argument
4446 generate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) argument
4480 generate_n(_OutputIterator __first, _Size __n, _Generator __gen) argument
4518 unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) argument
4560 unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred) argument
4592 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
4627 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomNumberGenerator&& __rand) argument
4668 partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument
4702 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) argument
4741 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) argument
4778 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) argument
4818 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) argument
4856 sort(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
4887 sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
5028 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
5065 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
5099 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
5636 __min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
5658 min_element(_ForwardIterator __first, _ForwardIterator __last) argument
5683 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
5701 __max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
5722 max_element(_ForwardIterator __first, _ForwardIterator __last) argument
5747 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
5767 __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag, _RandomAccessIterator __out, random_access_iterator_tag, _Size __n, _UniformRandomBitGenerator&& __g) argument
5794 __sample(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag, _OutputIterator __out, _Cat, _Size __n, _UniformRandomBitGenerator&& __g) argument
5864 sample(_PopulationIterator __first, _PopulationIterator __last, _SampleIterator __out, _Distance __n, _UniformRandomBitGenerator&& __g) argument
[all...]
H A Dstl_uninitialized.h84 __uninit_copy(_InputIterator __first, _InputIterator __last, argument
90 for (; __first != __last; ++__first, (void)++__cur)
91 std::_Construct(std::__addressof(*__cur), *__first);
107 __uninit_copy(_InputIterator __first, _InputIterator __last, argument
109 { return std::copy(__first, __last, __result); }
116 * @param __first An input iterator.
119 * @return __result + (__first - __last)
125 uninitialized_copy(_InputIterator __first, _InputIterator __last, argument
137 static_assert(is_constructible<_ValueType2, decltype(*__first)>
160 __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) argument
182 __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) argument
200 uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) argument
229 __uninit_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) argument
252 __uninit_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) argument
272 uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) argument
303 __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) argument
323 __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, allocator<_Tp>&) argument
330 __uninitialized_move_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) argument
341 __uninitialized_move_if_noexcept_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) argument
353 __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, _Allocator& __alloc) argument
372 __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, allocator<_Tp2>&) argument
379 __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, const _Tp& __x, _Allocator& __alloc) argument
400 __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, const _Tp& __x, allocator<_Tp2>&) argument
472 __uninitialized_fill_move(_ForwardIterator __result, _ForwardIterator __mid, const _Tp& __x, _InputIterator __first, _InputIterator __last, _Allocator& __alloc) argument
526 __uninit_default(_ForwardIterator __first, _ForwardIterator __last) argument
547 __uninit_default(_ForwardIterator __first, _ForwardIterator __last) argument
568 __uninit_default_n(_ForwardIterator __first, _Size __n) argument
590 __uninit_default_n(_ForwardIterator __first, _Size __n) argument
608 __uninitialized_default(_ForwardIterator __first, _ForwardIterator __last) argument
625 __uninitialized_default_n(_ForwardIterator __first, _Size __n) argument
643 __uninitialized_default_a(_ForwardIterator __first, _ForwardIterator __last, _Allocator& __alloc) argument
663 __uninitialized_default_a(_ForwardIterator __first, _ForwardIterator __last, allocator<_Tp>&) argument
674 __uninitialized_default_n_a(_ForwardIterator __first, _Size __n, _Allocator& __alloc) argument
696 __uninitialized_default_n_a(_ForwardIterator __first, _Size __n, allocator<_Tp>&) argument
705 __uninit_default_novalue(_ForwardIterator __first, _ForwardIterator __last) argument
727 __uninit_default_novalue(_ForwardIterator __first, _ForwardIterator __last) argument
738 __uninit_default_novalue_n(_ForwardIterator __first, _Size __n) argument
760 __uninit_default_novalue_n(_ForwardIterator __first, _Size __n) argument
768 __uninitialized_default_novalue(_ForwardIterator __first, _ForwardIterator __last) argument
783 __uninitialized_default_novalue_n(_ForwardIterator __first, _Size __n) argument
796 __uninitialized_copy_n(_InputIterator __first, _Size __n, _ForwardIterator __result, input_iterator_tag) argument
816 __uninitialized_copy_n(_RandomAccessIterator __first, _Size __n, _ForwardIterator __result, random_access_iterator_tag) argument
824 __uninitialized_copy_n_pair(_InputIterator __first, _Size __n, _ForwardIterator __result, input_iterator_tag) argument
844 __uninitialized_copy_n_pair(_RandomAccessIterator __first, _Size __n, _ForwardIterator __result, random_access_iterator_tag) argument
866 uninitialized_copy_n(_InputIterator __first, _Size __n, _ForwardIterator __result) argument
874 __uninitialized_copy_n_pair(_InputIterator __first, _Size __n, _ForwardIterator __result) argument
894 uninitialized_default_construct(_ForwardIterator __first, _ForwardIterator __last) argument
908 uninitialized_default_construct_n(_ForwardIterator __first, _Size __count) argument
920 uninitialized_value_construct(_ForwardIterator __first, _ForwardIterator __last) argument
934 uninitialized_value_construct_n(_ForwardIterator __first, _Size __count) argument
948 uninitialized_move(_InputIterator __first, _InputIterator __last, _ForwardIterator __result) argument
965 uninitialized_move_n(_InputIterator __first, _Size __count, _ForwardIterator __result) argument
[all...]
H A Dcharconv.h72 __to_chars_10_impl(char* __first, unsigned __len, _Tp __val) noexcept
88 __first[__pos] = __digits[__num + 1];
89 __first[__pos - 1] = __digits[__num];
95 __first[1] = __digits[__num + 1];
96 __first[0] = __digits[__num];
99 __first[0] = '0' + __val;
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
H A Dstl_heap.h76 __is_heap_until(_RandomAccessIterator __first, _Distance __n, argument
82 if (__comp(__first + __parent, __first + __child))
95 __is_heap(_RandomAccessIterator __first, _Distance __n) argument
98 return std::__is_heap_until(__first, __n, __comp) == __n;
105 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) argument
109 return std::__is_heap_until(__first, __n, __cmp) == __n;
115 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
116 { return std::__is_heap(__first, std::distance(__first, __las
121 __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
135 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare& __comp) argument
162 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
198 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
224 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) argument
254 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Compare& __comp) argument
283 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
317 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
340 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) argument
375 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
402 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
419 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) argument
440 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
468 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
497 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
526 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
551 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
565 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
H A Dstl_numeric.h79 * @param __first Start of range.
88 iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value) argument
95 __glibcxx_requires_valid_range(__first, __last);
97 for (; __first != __last; ++__first)
99 *__first = __value;
126 * @param __first Start of range.
134 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) argument
138 __glibcxx_requires_valid_range(__first, __last);
140 for (; __first !
161 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op) argument
256 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result) argument
298 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) argument
338 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result) argument
382 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) argument
[all...]
H A Dstl_uninitialized.h113 __do_uninit_copy(_InputIterator __first, _InputIterator __last, argument
119 for (; __first != __last; ++__first, (void)++__cur)
120 std::_Construct(std::__addressof(*__cur), *__first);
135 __uninit_copy(_InputIterator __first, _InputIterator __last, argument
137 { return std::__do_uninit_copy(__first, __last, __result); }
145 __uninit_copy(_InputIterator __first, _InputIterator __last, argument
147 { return std::copy(__first, __last, __result); }
154 * @param __first An input iterator.
157 * @return __result + (__first
163 uninitialized_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result) argument
192 __do_uninit_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) argument
213 __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) argument
223 __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) argument
241 uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) argument
261 __do_uninit_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) argument
282 __uninit_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) argument
292 __uninit_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) argument
312 uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) argument
344 __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) argument
365 __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, allocator<_Tp>&) argument
379 __uninitialized_move_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) argument
391 __uninitialized_move_if_noexcept_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) argument
404 __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, _Allocator& __alloc) argument
424 __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, allocator<_Tp2>&) argument
438 __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, const _Tp& __x, _Allocator& __alloc) argument
460 __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, const _Tp& __x, allocator<_Tp2>&) argument
538 __uninitialized_fill_move(_ForwardIterator __result, _ForwardIterator __mid, const _Tp& __x, _InputIterator __first, _InputIterator __last, _Allocator& __alloc) argument
592 __uninit_default(_ForwardIterator __first, _ForwardIterator __last) argument
613 __uninit_default(_ForwardIterator __first, _ForwardIterator __last) argument
632 __uninit_default_n(_ForwardIterator __first, _Size __n) argument
655 __uninit_default_n(_ForwardIterator __first, _Size __n) argument
673 __uninitialized_default(_ForwardIterator __first, _ForwardIterator __last) argument
691 __uninitialized_default_n(_ForwardIterator __first, _Size __n) argument
710 __uninitialized_default_a(_ForwardIterator __first, _ForwardIterator __last, _Allocator& __alloc) argument
730 __uninitialized_default_a(_ForwardIterator __first, _ForwardIterator __last, allocator<_Tp>&) argument
741 __uninitialized_default_n_a(_ForwardIterator __first, _Size __n, _Allocator& __alloc) argument
764 __uninitialized_default_n_a(_ForwardIterator __first, _Size __n, allocator<_Tp>&) argument
773 __uninit_default_novalue(_ForwardIterator __first, _ForwardIterator __last) argument
795 __uninit_default_novalue(_ForwardIterator __first, _ForwardIterator __last) argument
806 __uninit_default_novalue_n(_ForwardIterator __first, _Size __n) argument
828 __uninit_default_novalue_n(_ForwardIterator __first, _Size __n) argument
836 __uninitialized_default_novalue(_ForwardIterator __first, _ForwardIterator __last) argument
851 __uninitialized_default_novalue_n(_ForwardIterator __first, _Size __n) argument
864 __uninitialized_copy_n(_InputIterator __first, _Size __n, _ForwardIterator __result, input_iterator_tag) argument
884 __uninitialized_copy_n(_RandomAccessIterator __first, _Size __n, _ForwardIterator __result, random_access_iterator_tag) argument
892 __uninitialized_copy_n_pair(_InputIterator __first, _Size __n, _ForwardIterator __result, input_iterator_tag) argument
912 __uninitialized_copy_n_pair(_RandomAccessIterator __first, _Size __n, _ForwardIterator __result, random_access_iterator_tag) argument
935 uninitialized_copy_n(_InputIterator __first, _Size __n, _ForwardIterator __result) argument
943 __uninitialized_copy_n_pair(_InputIterator __first, _Size __n, _ForwardIterator __result) argument
964 uninitialized_default_construct(_ForwardIterator __first, _ForwardIterator __last) argument
979 uninitialized_default_construct_n(_ForwardIterator __first, _Size __count) argument
992 uninitialized_value_construct(_ForwardIterator __first, _ForwardIterator __last) argument
1007 uninitialized_value_construct_n(_ForwardIterator __first, _Size __count) argument
1022 uninitialized_move(_InputIterator __first, _InputIterator __last, _ForwardIterator __result) argument
1040 uninitialized_move_n(_InputIterator __first, _Size __count, _ForwardIterator __result) argument
[all...]
H A Dstl_construct.h139 _Destroy(_ForwardIterator __first, _ForwardIterator __last);
160 __destroy(_ForwardIterator __first, _ForwardIterator __last) argument
162 for (; __first != __last; ++__first)
163 std::_Destroy(std::__addressof(*__first));
182 _Destroy(_ForwardIterator __first, _ForwardIterator __last) argument
193 return _Destroy_aux<false>::__destroy(__first, __last);
196 __destroy(__first, __last);
204 __destroy_n(_ForwardIterator __first, _Size __count) argument
206 for (; __count > 0; (void)++__first,
217 __destroy_n(_ForwardIterator __first, _Size __count) argument
231 _Destroy_n(_ForwardIterator __first, _Size __count) argument
251 destroy(_ForwardIterator __first, _ForwardIterator __last) argument
258 destroy_n(_ForwardIterator __first, _Size __count) argument
[all...]
H A Dstl_algo.h106 __find_if_not(_InputIterator __first, _InputIterator __last, argument
109 return std::__find_if(__first, __last,
111 std::__iterator_category(__first));
120 __find_if_not_n(_InputIterator __first, _Distance& __len, _Predicate __pred) argument
122 for (; __len; --__len, (void) ++__first)
123 if (!__pred(__first))
125 return __first;
197 __search_n_aux(_ForwardIterator __first, _ForwardIterator __last, argument
201 __first = std::__find_if(__first, __las
230 __search_n_aux(_RandomAccessIter __first, _RandomAccessIter __last, _Integer __count, _UnaryPredicate __unary_pred, std::random_access_iterator_tag) argument
261 __search_n(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, _UnaryPredicate __unary_pred) argument
455 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
473 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
492 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
508 find_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
533 is_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
555 partition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument
593 __remove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) argument
622 remove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value) argument
656 remove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) argument
691 copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) argument
714 __copy_n(_InputIterator __first, _Size __n, _OutputIterator __result, input_iterator_tag) argument
726 __copy_n(_RandomAccessIterator __first, _Size __n, _OutputIterator __result, random_access_iterator_tag) argument
746 copy_n(_InputIterator __first, _Size __n, _OutputIterator __result) argument
783 partition_copy(_InputIterator __first, _InputIterator __last, _OutputIterator1 __out_true, _OutputIterator2 __out_false, _Predicate __pred) argument
833 remove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) argument
867 remove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument
884 __adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) argument
902 __unique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) argument
936 unique(_ForwardIterator __first, _ForwardIterator __last) argument
967 unique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) argument
992 __unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, forward_iterator_tag, output_iterator_tag) argument
1022 __unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, output_iterator_tag) argument
1055 __unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, forward_iterator_tag) argument
1078 __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) argument
1099 __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) argument
1128 reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) argument
1156 reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) argument
1200 __rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, forward_iterator_tag) argument
1242 __rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, bidirectional_iterator_tag) argument
1281 __rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, random_access_iterator_tag) argument
1388 rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) argument
1426 rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) argument
1444 __partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) argument
1470 __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, bidirectional_iterator_tag) argument
1506 __stable_partition_adaptive(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size) argument
1566 __stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument
1607 stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument
1625 __heap_select(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) argument
1641 __partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) argument
1696 partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) argument
1747 partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) argument
1802 __insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
1826 __unguarded_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
1844 __final_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
1861 __unguarded_partition(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __pivot, _Compare __comp) argument
1883 __unguarded_partition_pivot(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
1895 __partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) argument
1908 __introsort_loop(_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) argument
1932 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
1947 __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) argument
1994 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
2011 __upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
2050 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) argument
2081 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
2099 __equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _CompareItTp __comp_it_val, _CompareTpIt __comp_val_it) argument
2154 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) argument
2191 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
2225 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) argument
2259 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) argument
2352 __rotate_adaptive(_BidirectionalIterator1 __first, _BidirectionalIterator1 __middle, _BidirectionalIterator1 __last, _Distance __len1, _Distance __len2, _BidirectionalIterator2 __buffer, _Distance __buffer_size) argument
2390 __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
2451 __merge_without_buffer(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Compare __comp) argument
2500 __inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) argument
2550 inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) argument
2591 inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) argument
2641 __merge_sort_loop(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _Distance __step_size, _Compare __comp) argument
2666 __chunk_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance __chunk_size, _Compare __comp) argument
2682 __merge_sort_with_buffer(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Compare __comp) argument
2709 __stable_sort_adaptive(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
2739 __inplace_stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
2885 __next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) argument
2935 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) argument
2968 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) argument
2987 __prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) argument
3038 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) argument
3071 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) argument
3094 __replace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred, const _Tp& __new_value) argument
3123 replace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __old_value, const _Tp& __new_value) argument
3159 replace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred, const _Tp& __new_value) argument
3187 is_sorted(_ForwardIterator __first, _ForwardIterator __last) argument
3202 is_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
3209 __is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
3233 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last) argument
3258 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
3314 __minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
3385 minmax_element(_ForwardIterator __first, _ForwardIterator __last) argument
3413 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
3696 shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, _UniformRandomNumberGenerator&& __g) argument
3781 for_each(_InputIterator __first, _InputIterator __last, _Function __f) argument
3807 for_each_n(_InputIterator __first, _Size __n, _Function __f) argument
3843 find(_InputIterator __first, _InputIterator __last, const _Tp& __val) argument
3868 find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
3974 adjacent_find(_ForwardIterator __first, _ForwardIterator __last) argument
4000 adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) argument
4026 count(_InputIterator __first, _InputIterator __last, const _Tp& __value) argument
4050 count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) argument
4167 search_n(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val) argument
4202 search_n(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val, _BinaryPredicate __binary_pred) argument
4227 search(_ForwardIterator __first, _ForwardIterator __last, const _Searcher& __searcher) argument
4252 transform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __unary_op) argument
4323 replace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) argument
4356 replace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) argument
4389 generate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) argument
4423 generate_n(_OutputIterator __first, _Size __n, _Generator __gen) argument
4461 unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) argument
4503 unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred) argument
4541 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
4581 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomNumberGenerator&& __rand) argument
4622 partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument
4656 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) argument
4695 partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) argument
4732 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) argument
4772 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) argument
4810 sort(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
4841 sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
4982 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
5024 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
5058 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
5595 __min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
5617 min_element(_ForwardIterator __first, _ForwardIterator __last) argument
5642 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
5660 __max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
5681 max_element(_ForwardIterator __first, _ForwardIterator __last) argument
5706 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) argument
5769 __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag, _RandomAccessIterator __out, random_access_iterator_tag, _Size __n, _UniformRandomBitGenerator&& __g) argument
5796 __sample(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag, _OutputIterator __out, _Cat, _Size __n, _UniformRandomBitGenerator&& __g) argument
5866 sample(_PopulationIterator __first, _PopulationIterator __last, _SampleIterator __out, _Distance __n, _UniformRandomBitGenerator&& __g) argument
[all...]
H A Dcharconv.h72 __to_chars_10_impl(char* __first, unsigned __len, _Tp __val) noexcept
88 __first[__pos] = __digits[__num + 1];
89 __first[__pos - 1] = __digits[__num];
95 __first[1] = __digits[__num + 1];
96 __first[0] = __digits[__num];
99 __first[0] = '0' + __val;
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/profile/impl/
H A Dprofiler_algos.h84 __for_each(_InputIterator __first, _InputIterator __last, _Function __f) argument
86 for (; __first != __last; ++__first)
87 __f(*__first);
94 __remove(_ForwardIterator __first, _ForwardIterator __last, argument
97 if(__first == __last)
98 return __first;
99 _ForwardIterator __result = __first;
100 ++__first;
101 for(; __first !
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/debug/
H A Dfunctions.h52 * __first. This routine is useful when we can't use a separate
57 __check_valid_range(const _InputIterator& __first, argument
63 __glibcxx_check_valid_range_at(__first, __last,
65 return __first;
215 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last, argument
218 if (__first == __last)
221 _ForwardIterator __next = __first;
222 for (++__next; __next != __last; __first = __next, (void)++__next)
223 if (*__next < *__first)
243 __check_sorted_aux(_ForwardIterator __first, _ForwardIterato argument
261 __check_sorted(const _InputIterator& __first, const _InputIterator& __last) argument
270 __check_sorted(const _InputIterator& __first, const _InputIterator& __last, _Predicate __pred) argument
280 __check_sorted_set_aux(const _InputIterator& __first, const _InputIterator& __last, std::__true_type) argument
296 __check_sorted_set_aux(const _InputIterator& __first, const _InputIterator& __last, _Predicate __pred, std::__true_type) argument
313 __check_sorted_set(const _InputIterator1& __first, const _InputIterator1& __last, const _InputIterator2&) argument
331 __check_sorted_set(const _InputIterator1& __first, const _InputIterator1& __last, const _InputIterator2&, _Predicate __pred) argument
351 __check_partitioned_lower(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) argument
368 __check_partitioned_upper(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) argument
386 __check_partitioned_lower(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Pred __pred) argument
404 __check_partitioned_upper(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Pred __pred) argument
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/debug/
H A Dfunctions.h52 * __first. This routine is useful when we can't use a separate
57 __check_valid_range(const _InputIterator& __first, argument
63 __glibcxx_check_valid_range_at(__first, __last,
65 return __first;
215 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last, argument
218 if (__first == __last)
221 _ForwardIterator __next = __first;
222 for (++__next; __next != __last; __first = __next, (void)++__next)
223 if (*__next < *__first)
243 __check_sorted_aux(_ForwardIterator __first, _ForwardIterato argument
261 __check_sorted(const _InputIterator& __first, const _InputIterator& __last) argument
270 __check_sorted(const _InputIterator& __first, const _InputIterator& __last, _Predicate __pred) argument
280 __check_sorted_set_aux(const _InputIterator& __first, const _InputIterator& __last, std::__true_type) argument
296 __check_sorted_set_aux(const _InputIterator& __first, const _InputIterator& __last, _Predicate __pred, std::__true_type) argument
313 __check_sorted_set(const _InputIterator1& __first, const _InputIterator1& __last, const _InputIterator2&) argument
331 __check_sorted_set(const _InputIterator1& __first, const _InputIterator1& __last, const _InputIterator2&, _Predicate __pred) argument
351 __check_partitioned_lower(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) argument
368 __check_partitioned_upper(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) argument
386 __check_partitioned_lower(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Pred __pred) argument
404 __check_partitioned_upper(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Pred __pred) argument
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/
H A Dmemory_impl.h28 __brick_uninitialized_move(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
32 for (; __first != __last; ++__first, ++__result)
34 ::new (std::addressof(*__result)) _ValueType(std::move(*__first));
41 __brick_uninitialized_move(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
49 __first, __last - __first, __result,
55 __brick_destroy(_Iterator __first, _Iterator __last, /*vector*/ std::false_type) noexcept
59 for (; __first != __last; ++__first)
[all...]
H A Dparallel_impl.h29 __parallel_find(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f, _Compare __comp, bool __b_first) argument
32 const _DifferenceType __n = __last - __first;
36 __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last, local
37 [__comp, __f, __first, &__extremum](_Index __i, _Index __j) {
40 if (__comp(__i - __first, __extremum))
46 const _DifferenceType __k = __res - __first;
55 return __extremum != __initial_dist ? __first + __extremum : __last;
64 __parallel_or(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f) argument
67 __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last, local
H A Dalgorithm_impl.h38 __brick_any_of(const _ForwardIterator __first, const _ForwardIterator __last, _Pred __pred,
41 return std::any_of(__first, __last, __pred);
46 __brick_any_of(const _ForwardIterator __first, const _ForwardIterator __last, _Pred __pred,
49 return __unseq_backend::__simd_or(__first, __last - __first, __pred);
54 __pattern_any_of(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred,
57 return __internal::__brick_any_of(__first, __last, __pred, __is_vector);
62 __pattern_any_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred, argument
66 return __internal::__parallel_or(std::forward<_ExecutionPolicy>(__exec), __first, __last,
78 __for_each_n_it_serial(_ForwardIterator __first, _Siz argument
116 __pattern_walk1(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Function __f, _IsVector __is_vector, std::true_type) argument
138 __pattern_walk_brick(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Brick __brick, std::true_type) argument
152 __brick_walk1_n(_ForwardIterator __first, _Size __n, _Function __f, std::false_type) argument
[all...]
H A Dunseq_backend_simd.h29 __simd_walk_1(_Iterator __first, _DifferenceType __n, _Function __f) noexcept
33 __f(__first[__i]);
35 return __first + __n;
62 __simd_or(_Index __first, _DifferenceType __n, _Pred __pred) noexcept
69 if (__pred(__first[__i]))
74 const _Index __last = __first + __n;
75 while (__last != __first)
80 if (__pred(*(__first + __i)))
85 __first += __block_size;
86 if (__last - __first >
361 __first[__i] = __value; variable
372 __first[__i] = __g(); variable
514 __simd_scan(_InputIterator __first, _Size __n, _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init, _BinaryOperation, std::false_type) argument
549 __simd_scan(_InputIterator __first, _Size __n, _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init, _BinaryOperation __binary_op, std::false_type) argument
572 __simd_scan(_InputIterator __first, _Size __n, _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init, _BinaryOperation, std::true_type) argument
589 __simd_scan(_InputIterator __first, _Size __n, _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init, _BinaryOperation __binary_op, std::true_type) argument
[all...]
/netbsd-current/external/apache2/llvm/dist/libcxx/include/__memory/
H A Duninitialized_algorithms.h127 void destroy(_ForwardIterator __first, _ForwardIterator __last) { argument
128 for (; __first != __last; ++__first)
129 _VSTD::destroy_at(_VSTD::addressof(*__first));
134 _ForwardIterator destroy_n(_ForwardIterator __first, _Size __n) { argument
135 for (; __n > 0; (void)++__first, --__n)
136 _VSTD::destroy_at(_VSTD::addressof(*__first));
137 return __first;
142 void uninitialized_default_construct(_ForwardIterator __first, _ForwardIterator __last) { argument
144 auto __idx = __first;
160 uninitialized_default_construct_n(_ForwardIterator __first, _Size __n) argument
180 uninitialized_value_construct(_ForwardIterator __first, _ForwardIterator __last) argument
198 uninitialized_value_construct_n(_ForwardIterator __first, _Size __n) argument
218 uninitialized_move(_InputIt __first, _InputIt __last, _ForwardIt __first_res) argument
238 uninitialized_move_n(_InputIt __first, _Size __n, _ForwardIt __first_res) argument
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/
H A Dmemory_impl.h28 __brick_uninitialized_move(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
32 for (; __first != __last; ++__first, ++__result)
34 ::new (std::addressof(*__result)) _ValueType2(std::move(*__first));
41 __brick_uninitialized_move(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
49 __first, __last - __first, __result,
H A Dparallel_impl.h29 __parallel_find(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f, _Compare __comp, bool __b_first) argument
32 const _DifferenceType __n = __last - __first;
36 __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last, local
37 [__comp, __f, __first, &__extremum](_Index __i, _Index __j) {
40 if (__comp(__i - __first, __extremum))
46 const _DifferenceType __k = __res - __first;
55 return __extremum != __initial_dist ? __first + __extremum : __last;
64 __parallel_or(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f) argument
67 __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last, local
H A Dunseq_backend_simd.h29 __simd_walk_1(_Iterator __first, _DifferenceType __n, _Function __f) noexcept
33 __f(__first[__i]);
35 return __first + __n;
62 __simd_or(_Index __first, _DifferenceType __n, _Pred __pred) noexcept
69 if (__pred(__first[__i]))
74 const _Index __last = __first + __n;
75 while (__last != __first)
80 if (__pred(*(__first + __i)))
85 __first += __block_size;
86 if (__last - __first >
361 __first[__i] = __value; variable
372 __first[__i] = __g(); variable
514 __simd_scan(_InputIterator __first, _Size __n, _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init, _BinaryOperation, std::false_type) argument
549 __simd_scan(_InputIterator __first, _Size __n, _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init, _BinaryOperation __binary_op, std::false_type) argument
572 __simd_scan(_InputIterator __first, _Size __n, _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init, _BinaryOperation, std::true_type) argument
589 __simd_scan(_InputIterator __first, _Size __n, _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init, _BinaryOperation __binary_op, std::true_type) argument
[all...]
H A Dalgorithm_impl.h38 __brick_any_of(const _ForwardIterator __first, const _ForwardIterator __last, _Pred __pred,
41 return std::any_of(__first, __last, __pred);
46 __brick_any_of(const _ForwardIterator __first, const _ForwardIterator __last, _Pred __pred,
49 return __unseq_backend::__simd_or(__first, __last - __first, __pred);
54 __pattern_any_of(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred,
57 return __internal::__brick_any_of(__first, __last, __pred, __is_vector);
62 __pattern_any_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred, argument
66 return __internal::__parallel_or(std::forward<_ExecutionPolicy>(__exec), __first, __last,
78 __for_each_n_it_serial(_ForwardIterator __first, _Siz argument
116 __pattern_walk1(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Function __f, _IsVector __is_vector, std::true_type) argument
138 __pattern_walk_brick(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Brick __brick, std::true_type) argument
152 __brick_walk1_n(_ForwardIterator __first, _Size __n, _Function __f, std::false_type) argument
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/
H A Dlist-aux-2.cc47 _M_transfer(_List_node_base * const __first,
62 _M_transfer(_List_node_base * const __first,
69 __first->_M_prev->_M_next = __last;
70 this->_M_prev->_M_next = __first;
75 __last->_M_prev = __first->_M_prev;
76 __first->_M_prev = __tmp;

Completed in 613 milliseconds

1234567