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

/haiku/headers/cpp/
H A Dstl_heap.h43 __push_heap(_RandomAccessIterator __first, argument
47 while (__holeIndex > __topIndex && *(__first + __parent) < __value) {
48 *(__first + __holeIndex) = *(__first + __parent);
52 *(__first + __holeIndex) = __value;
57 __push_heap_aux(_RandomAccessIterator __first, argument
60 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0),
66 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
68 __push_heap_aux(__first, __las
75 __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare __comp) argument
90 __push_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, _Distance*, _Tp*) argument
100 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
109 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value) argument
130 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Distance*) argument
139 __pop_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp*) argument
147 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
156 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) argument
178 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Tp __value, _Compare __comp, _Distance*) argument
189 __pop_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp*, _Compare __comp) argument
198 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
206 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp*, _Distance*) argument
222 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
231 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, _Tp*, _Distance*) argument
248 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
256 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
264 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
H A Dstl_algo.h81 _Function for_each(_InputIter __first, _InputIter __last, _Function __f) { argument
82 for ( ; __first != __last; ++__first)
83 __f(*__first);
90 inline _InputIter find(_InputIter __first, _InputIter __last, argument
94 while (__first != __last && *__first != __val)
95 ++__first;
96 return __first;
100 inline _InputIter find_if(_InputIter __first, _InputIte argument
112 find(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, random_access_iterator_tag) argument
150 find_if(_RandomAccessIter __first, _RandomAccessIter __last, _Predicate __pred, random_access_iterator_tag) argument
190 find(_InputIter __first, _InputIter __last, const _Tp& __val) argument
197 find_if(_InputIter __first, _InputIter __last, _Predicate __pred) argument
205 adjacent_find(_ForwardIter __first, _ForwardIter __last) argument
218 adjacent_find(_ForwardIter __first, _ForwardIter __last, _BinaryPredicate __binary_pred) argument
238 count(_InputIter __first, _InputIter __last, const _Tp& __value, _Size& __n) argument
246 count_if(_InputIter __first, _InputIter __last, _Predicate __pred, _Size& __n) argument
257 count(_InputIter __first, _InputIter __last, const _Tp& __value) argument
267 count_if(_InputIter __first, _InputIter __last, _Predicate __pred) argument
377 search_n(_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp& __val) argument
401 search_n(_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp& __val, _BinaryPred __binary_pred) argument
448 transform(_InputIter __first, _InputIter __last, _OutputIter __result, _UnaryOperation __oper) argument
468 replace(_ForwardIter __first, _ForwardIter __last, const _Tp& __old_value, const _Tp& __new_value) argument
476 replace_if(_ForwardIter __first, _ForwardIter __last, _Predicate __pred, const _Tp& __new_value) argument
484 replace_copy(_InputIter __first, _InputIter __last, _OutputIter __result, const _Tp& __old_value, const _Tp& __new_value) argument
493 replace_copy_if(Iterator __first, Iterator __last, _OutputIter __result, _Predicate __pred, const _Tp& __new_value) argument
504 generate(_ForwardIter __first, _ForwardIter __last, _Generator __gen) argument
510 generate_n(_OutputIter __first, _Size __n, _Generator __gen) argument
519 remove_copy(_InputIter __first, _InputIter __last, _OutputIter __result, const _Tp& __value) argument
530 remove_copy_if(_InputIter __first, _InputIter __last, _OutputIter __result, _Predicate __pred) argument
541 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __value) argument
550 remove_if(_ForwardIter __first, _ForwardIter __last, _Predicate __pred) argument
561 __unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result, _Tp*) argument
574 __unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result, output_iterator_tag) argument
581 __unique_copy(_InputIter __first, _InputIter __last, _ForwardIter __result, forward_iterator_tag) argument
590 unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result) argument
599 __unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result, _BinaryPredicate __binary_pred, _Tp*) argument
613 __unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result, _BinaryPredicate __binary_pred, output_iterator_tag) argument
622 __unique_copy(_InputIter __first, _InputIter __last, _ForwardIter __result, _BinaryPredicate __binary_pred, forward_iterator_tag) argument
633 unique_copy(_InputIter __first, _InputIter __last, _OutputIter __result, _BinaryPredicate __binary_pred) argument
642 unique(_ForwardIter __first, _ForwardIter __last) argument
648 unique(_ForwardIter __first, _ForwardIter __last, _BinaryPredicate __binary_pred) argument
657 __reverse(_BidirectionalIter __first, _BidirectionalIter __last, bidirectional_iterator_tag) argument
667 __reverse(_RandomAccessIter __first, _RandomAccessIter __last, random_access_iterator_tag) argument
674 reverse(_BidirectionalIter __first, _BidirectionalIter __last) argument
679 reverse_copy(_BidirectionalIter __first, _BidirectionalIter __last, _OutputIter __result) argument
705 __rotate(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last, _Distance*, forward_iterator_tag) argument
739 __rotate(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance*, bidirectional_iterator_tag) argument
766 __rotate(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Distance *, _Tp *) argument
819 rotate(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last) argument
827 rotate_copy(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last, _OutputIter __result) argument
848 random_shuffle(_RandomAccessIter __first, _RandomAccessIter __last) argument
856 random_shuffle(_RandomAccessIter __first, _RandomAccessIter __last, _RandomNumberGenerator& __rand) argument
866 random_sample_n(_ForwardIter __first, _ForwardIter __last, _OutputIter __out, const _Distance __n) argument
888 random_sample_n(_ForwardIter __first, _ForwardIter __last, _OutputIter __out, const _Distance __n, _RandomNumberGenerator& __rand) argument
910 __random_sample(_InputIter __first, _InputIter __last, _RandomAccessIter __out, const _Distance __n) argument
932 __random_sample(_InputIter __first, _InputIter __last, _RandomAccessIter __out, _RandomNumberGenerator& __rand, const _Distance __n) argument
955 random_sample(_InputIter __first, _InputIter __last, _RandomAccessIter __out_first, _RandomAccessIter __out_last) argument
966 random_sample(_InputIter __first, _InputIter __last, _RandomAccessIter __out_first, _RandomAccessIter __out_last, _RandomNumberGenerator& __rand) argument
978 __partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred, forward_iterator_tag) argument
999 __partition(_BidirectionalIter __first, _BidirectionalIter __last, _Predicate __pred, bidirectional_iterator_tag) argument
1025 partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred) argument
1033 __inplace_stable_partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Distance __len) argument
1049 __stable_partition_adaptive(_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size) argument
1085 __stable_partition_aux(_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Tp*, _Distance*) argument
1099 stable_partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred) argument
1111 __unguarded_partition(_RandomAccessIter __first, _RandomAccessIter __last, _Tp __pivot) argument
1129 __unguarded_partition(_RandomAccessIter __first, _RandomAccessIter __last, _Tp __pivot, _Compare __comp) argument
1176 __linear_insert(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*) argument
1188 __linear_insert(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Compare __comp) argument
1200 __insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last) argument
1207 __insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1215 __unguarded_insertion_sort_aux(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*) argument
1222 __unguarded_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last) argument
1228 __unguarded_insertion_sort_aux(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Compare __comp) argument
1236 __unguarded_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1244 __final_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last) argument
1255 __final_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1273 __introsort_loop(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Size __depth_limit) argument
1294 __introsort_loop(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Size __depth_limit, _Compare __comp) argument
1316 sort(_RandomAccessIter __first, _RandomAccessIter __last) argument
1326 sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1340 __inplace_stable_sort(_RandomAccessIter __first, _RandomAccessIter __last) argument
1355 __inplace_stable_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1372 __merge_sort_loop(_RandomAccessIter1 __first, _RandomAccessIter1 __last, _RandomAccessIter2 __result, _Distance __step_size) argument
1391 __merge_sort_loop(_RandomAccessIter1 __first, _RandomAccessIter1 __last, _RandomAccessIter2 __result, _Distance __step_size, _Compare __comp) argument
1415 __chunk_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Distance __chunk_size) argument
1426 __chunk_insertion_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Distance __chunk_size, _Compare __comp) argument
1438 __merge_sort_with_buffer(_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance*) argument
1457 __merge_sort_with_buffer(_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance*, _Compare __comp) argument
1475 __stable_sort_adaptive(_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance __buffer_size) argument
1494 __stable_sort_adaptive(_RandomAccessIter __first, _RandomAccessIter __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
1517 __stable_sort_aux(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Distance*) argument
1528 __stable_sort_aux(_RandomAccessIter __first, _RandomAccessIter __last, _Tp*, _Distance*, _Compare __comp) argument
1541 stable_sort(_RandomAccessIter __first, _RandomAccessIter __last) argument
1549 stable_sort(_RandomAccessIter __first, _RandomAccessIter __last, _Compare __comp) argument
1560 __partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Tp*) argument
1571 partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last) argument
1578 __partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Tp*, _Compare __comp) argument
1589 partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last, _Compare __comp) argument
1597 __partial_sort_copy(_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Distance*, _Tp*) argument
1623 partial_sort_copy(_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last) argument
1633 __partial_sort_copy(_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Compare __comp, _Distance*, _Tp*) argument
1660 partial_sort_copy(_InputIter __first, _InputIter __last, _RandomAccessIter __result_first, _RandomAccessIter __result_last, _Compare __comp) argument
1672 __nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Tp*) argument
1689 nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last) argument
1695 __nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Tp*, _Compare __comp) argument
1714 nth_element(_RandomAccessIter __first, _RandomAccessIter __nth, _RandomAccessIter __last, _Compare __comp) argument
1723 __lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Distance*) argument
1747 lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
1754 __lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp, _Distance*) argument
1778 lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
1785 __upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Distance*) argument
1809 upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
1816 __upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp, _Distance*) argument
1840 upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
1848 __equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Distance*) argument
1879 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
1886 __equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp, _Distance*) argument
1917 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
1924 binary_search(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
1931 binary_search(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
1980 __merge_without_buffer(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2) argument
2016 __merge_without_buffer(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Compare __comp) argument
2054 __rotate_adaptive(_BidirectionalIter1 __first, _BidirectionalIter1 __middle, _BidirectionalIter1 __last, _Distance __len1, _Distance __len2, _BidirectionalIter2 __buffer, _Distance __buffer_size) argument
2135 __merge_adaptive(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size) argument
2177 __merge_adaptive(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) argument
2220 __inplace_merge_aux(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Tp*, _Distance*) argument
2238 __inplace_merge_aux(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Tp*, _Distance*, _Compare __comp) argument
2257 inplace_merge(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last) argument
2267 inplace_merge(_BidirectionalIter __first, _BidirectionalIter __middle, _BidirectionalIter __last, _Compare __comp) argument
2485 max_element(_ForwardIter __first, _ForwardIter __last) argument
2495 max_element(_ForwardIter __first, _ForwardIter __last, _Compare __comp) argument
2505 min_element(_ForwardIter __first, _ForwardIter __last) argument
2515 min_element(_ForwardIter __first, _ForwardIter __last, _Compare __comp) argument
2529 next_permutation(_BidirectionalIter __first, _BidirectionalIter __last) argument
2558 next_permutation(_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp) argument
2588 prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last) argument
2617 prev_permutation(_BidirectionalIter __first, _BidirectionalIter __last, _Compare __comp) argument
2809 __is_heap(_RandomAccessIter __first, _Distance __n) argument
2822 __is_heap(_RandomAccessIter __first, _StrictWeakOrdering __comp, _Distance __n) argument
2836 is_heap(_RandomAccessIter __first, _RandomAccessIter __last) argument
2843 is_heap(_RandomAccessIter __first, _RandomAccessIter __last, _StrictWeakOrdering __comp) argument
2854 is_sorted(_ForwardIter __first, _ForwardIter __last) argument
2869 is_sorted(_ForwardIter __first, _ForwardIter __last, _StrictWeakOrdering __comp) argument
[all...]
H A Dstl_numeric.h38 _Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp __init) argument
40 for ( ; __first != __last; ++__first)
41 __init = __init + *__first;
46 _Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, argument
49 for ( ; __first != __last; ++__first)
50 __init = __binary_op(__init, *__first);
77 __partial_sum(_InputIterator __first, _InputIterator __last, argument
80 _Tp __value = *__first;
90 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result) argument
101 __partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp*, _BinaryOperation __binary_op) argument
114 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) argument
125 __adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp*) argument
139 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result) argument
151 __adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Tp*, _BinaryOperation __binary_op) argument
165 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) argument
227 iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value) argument
[all...]
H A Dstl_uninitialized.h42 __uninitialized_copy_aux(_InputIter __first, _InputIter __last, argument
46 return copy(__first, __last, __result);
51 __uninitialized_copy_aux(_InputIter __first, _InputIter __last, argument
57 for ( ; __first != __last; ++__first, ++__cur)
58 construct(&*__cur, *__first);
67 __uninitialized_copy(_InputIter __first, _InputIter __last, argument
71 return __uninitialized_copy_aux(__first, __last, __result, _Is_POD());
76 uninitialized_copy(_InputIter __first, _InputIter __last, argument
79 return __uninitialized_copy(__first, __las
83 uninitialized_copy(const char* __first, const char* __last, char* __result) argument
90 uninitialized_copy(const wchar_t* __first, const wchar_t* __last, wchar_t* __result) argument
101 __uninitialized_copy_n(_InputIter __first, _Size __count, _ForwardIter __result, input_iterator_tag) argument
116 __uninitialized_copy_n(_RandomAccessIter __first, _Size __count, _ForwardIter __result, random_access_iterator_tag) argument
127 __uninitialized_copy_n(_InputIter __first, _Size __count, _ForwardIter __result) argument
135 uninitialized_copy_n(_InputIter __first, _Size __count, _ForwardIter __result) argument
145 __uninitialized_fill_aux(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, __true_type) argument
153 __uninitialized_fill_aux(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, __false_type) argument
165 __uninitialized_fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, _Tp1*) argument
174 uninitialized_fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x) argument
185 __uninitialized_fill_n_aux(_ForwardIter __first, _Size __n, const _Tp& __x, __true_type) argument
193 __uninitialized_fill_n_aux(_ForwardIter __first, _Size __n, const _Tp& __x, __false_type) argument
207 __uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x, _Tp1*) argument
215 uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x) argument
246 __uninitialized_fill_copy(_ForwardIter __result, _ForwardIter __mid, const _Tp& __x, _InputIter __first, _InputIter __last) argument
[all...]
H A Dstl_construct.h58 __destroy_aux(_ForwardIterator __first, _ForwardIterator __last, __false_type) argument
60 for ( ; __first != __last; ++__first)
61 destroy(&*__first);
69 __destroy(_ForwardIterator __first, _ForwardIterator __last, _Tp*) argument
73 __destroy_aux(__first, __last, _Trivial_destructor());
77 inline void destroy(_ForwardIterator __first, _ForwardIterator __last) { argument
78 __destroy(__first, __last, __VALUE_TYPE(__first));
H A Dstl_algobase.h124 inline _OutputIter __copy(_InputIter __first, _InputIter __last, argument
128 for ( ; __first != __last; ++__result, ++__first)
129 *__result = *__first;
135 __copy(_RandomAccessIter __first, _RandomAccessIter __last, argument
138 for (_Distance __n = __last - __first; __n > 0; --__n) {
139 *__result = *__first;
140 ++__first;
148 __copy_trivial(const _Tp* __first, const _Tp* __last, _Tp* __result) { argument
149 memmove(__result, __first, sizeo
157 copy(_InputIter __first, _InputIter __last, _OutputIter __result) argument
168 copy(const _Tp* __first, const _Tp* __last, _Tp* __result) argument
176 copy(const _Tp* __first, const _Tp* __last, _Tp* __result) argument
182 copy(_InputIter __first, _InputIter __last, _OutputIter __result) argument
194 copy(_InputIter __first, _InputIter __last, _OutputIter __result) argument
202 copy(const char* __first, const char* __last, char* __result) argument
207 copy(const wchar_t* __first, const wchar_t* __last, wchar_t* __result) argument
220 __copy_backward(_BidirectionalIter1 __first, _BidirectionalIter1 __last, _BidirectionalIter2 __result, bidirectional_iterator_tag, _Distance*) argument
232 __copy_backward(_RandomAccessIter __first, _RandomAccessIter __last, _BidirectionalIter __result, random_access_iterator_tag, _Distance*) argument
259 copy(_BidirectionalIter1 __first, _BidirectionalIter1 __last, _BidirectionalIter2 __result) argument
269 copy(const _Tp* __first, const _Tp* __last, _Tp* __result) argument
279 copy(const _Tp* __first, const _Tp* __last, _Tp* __result) argument
286 copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) argument
297 copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) argument
309 __copy_n(_InputIter __first, _Size __count, _OutputIter __result, input_iterator_tag) argument
322 __copy_n(_RAIter __first, _Size __count, _OutputIter __result, random_access_iterator_tag) argument
331 __copy_n(_InputIter __first, _Size __count, _OutputIter __result) argument
338 copy_n(_InputIter __first, _Size __count, _OutputIter __result) argument
347 fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __value) argument
353 fill_n(_OutputIter __first, _Size __n, const _Tp& __value) argument
[all...]
H A Dstl_multiset.h83 multiset(_InputIterator __first, _InputIterator __last) argument
85 { _M_t.insert_equal(__first, __last); }
88 multiset(_InputIterator __first, _InputIterator __last, argument
91 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
95 multiset(const value_type* __first, const value_type* __last) argument
97 { _M_t.insert_equal(__first, __last); }
99 multiset(const value_type* __first, const value_type* __last, argument
102 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
104 multiset(const_iterator __first, const_iterator __last) argument
106 { _M_t.insert_equal(__first, __las
108 multiset(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
148 insert(_InputIterator __first, _InputIterator __last) argument
152 insert(const value_type* __first, const value_type* __last) argument
155 insert(const_iterator __first, const_iterator __last) argument
166 erase(iterator __first, iterator __last) argument
[all...]
H A Dstl_set.h82 set(_InputIterator __first, _InputIterator __last) argument
84 { _M_t.insert_unique(__first, __last); }
87 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp, argument
89 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
91 set(const value_type* __first, const value_type* __last) argument
93 { _M_t.insert_unique(__first, __last); }
95 set(const value_type* __first, argument
98 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
100 set(const_iterator __first, const_iterator __last) argument
102 { _M_t.insert_unique(__first, __las
104 set(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
142 insert(_InputIterator __first, _InputIterator __last) argument
146 insert(const_iterator __first, const_iterator __last) argument
149 insert(const value_type* __first, const value_type* __last) argument
160 erase(iterator __first, iterator __last) argument
[all...]
H A Dstl_vector.h254 vector(_InputIterator __first, _InputIterator __last, argument
257 _M_initialize_aux(__first, __last, _Integral());
268 void _M_initialize_aux(_InputIterator __first, _InputIterator __last, argument
270 _M_range_initialize(__first, __last, __ITERATOR_CATEGORY(__first));
274 vector(const _Tp* __first, const _Tp* __last, argument
276 : _Base(__last - __first, __a)
277 { _M_finish = uninitialized_copy(__first, __last, _M_start); }
305 void assign(_InputIterator __first, _InputIterator __last) { argument
307 _M_assign_dispatch(__first, __las
315 _M_assign_dispatch(_InputIter __first, _InputIter __last, __false_type) argument
378 insert(iterator __pos, _InputIterator __first, _InputIterator __last) argument
390 _M_insert_dispatch(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) argument
413 erase(iterator __first, iterator __last) argument
433 _M_allocate_and_copy(size_type __n, _ForwardIterator __first, _ForwardIterator __last) argument
444 _M_allocate_and_copy(size_type __n, const_iterator __first, const_iterator __last) argument
459 _M_range_initialize(_InputIterator __first, _InputIterator __last, input_iterator_tag) argument
468 _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) argument
560 _M_assign_aux(_InputIter __first, _InputIter __last, input_iterator_tag) argument
568 insert(end(), __first, __last); local
573 _M_assign_aux(_ForwardIter __first, _ForwardIter __last, forward_iterator_tag) argument
712 _M_range_insert(iterator __pos, _InputIterator __first, _InputIterator __last, input_iterator_tag) argument
725 _M_range_insert(iterator __position, _ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) argument
778 insert(iterator __position, const_iterator __first, const_iterator __last) argument
[all...]
H A Dstl_list.h363 _InputIterator __first, _InputIterator __last,
367 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { argument
369 _M_insert_dispatch(__pos, __first, __last, _Integral());
373 void insert(iterator __position, const _Tp* __first, const _Tp* __last);
375 const_iterator __first, const_iterator __last);
393 iterator erase(iterator __first, iterator __last);
417 list(_InputIterator __first, _InputIterator __last, argument
420 { insert(begin(), __first, __last); } local
424 list(const _Tp* __first, const _Tp* __last, argument
427 { insert(begin(), __first, __las local
428 list(const_iterator __first, const_iterator __last, const allocator_type& __a = allocator_type()) argument
431 { insert(begin(), __first, __last); } local
452 assign(_InputIterator __first, _InputIterator __last) argument
468 transfer(iterator __position, iterator __first, iterator __last) argument
494 splice(iterator __position, list&, iterator __first, iterator __last) argument
554 _M_insert_dispatch(iterator __position, _InputIter __first, _InputIter __last, __false_type) argument
566 insert(iterator __position, const _Tp* __first, const _Tp* __last) argument
575 insert(iterator __position, const_iterator __first, const_iterator __last) argument
593 erase(iterator __first, iterator __last) argument
665 iterator __first = begin(); local
678 iterator __first = begin(); local
715 iterator __first = begin(); local
720 transfer(begin(), __old, __first); local
756 iterator __first = begin(); local
769 iterator __first = begin(); local
[all...]
H A Dstl_map.h97 map(_InputIterator __first, _InputIterator __last) argument
99 { _M_t.insert_unique(__first, __last); }
102 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp, argument
104 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
106 map(const value_type* __first, const value_type* __last) argument
108 { _M_t.insert_unique(__first, __last); }
110 map(const value_type* __first, argument
113 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
115 map(const_iterator __first, const_iterator __last) argument
117 { _M_t.insert_unique(__first, __las
119 map(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
167 insert(_InputIterator __first, _InputIterator __last) argument
171 insert(const value_type* __first, const value_type* __last) argument
174 insert(const_iterator __first, const_iterator __last) argument
181 erase(iterator __first, iterator __last) argument
[all...]
H A Dstl_multimap.h96 multimap(_InputIterator __first, _InputIterator __last) argument
98 { _M_t.insert_equal(__first, __last); }
101 multimap(_InputIterator __first, _InputIterator __last, argument
104 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
106 multimap(const value_type* __first, const value_type* __last) argument
108 { _M_t.insert_equal(__first, __last); }
109 multimap(const value_type* __first, const value_type* __last, argument
112 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
114 multimap(const_iterator __first, const_iterator __last) argument
116 { _M_t.insert_equal(__first, __las
117 multimap(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
157 insert(_InputIterator __first, _InputIterator __last) argument
161 insert(const value_type* __first, const value_type* __last) argument
164 insert(const_iterator __first, const_iterator __last) argument
170 erase(iterator __first, iterator __last) argument
[all...]
H A Dstl_bvector.h440 void _M_initialize_range(_InputIterator __first, _InputIterator __last, argument
445 for ( ; __first != __last; ++__first)
446 push_back(*__first);
450 void _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last, argument
453 distance(__first, __last, __n);
455 copy(__first, __last, _M_start);
460 _InputIterator __first, _InputIterator __last,
462 for ( ; __first != __last; ++__first) {
459 _M_insert_range(iterator __pos, _InputIterator __first, _InputIterator __last, input_iterator_tag) argument
469 _M_insert_range(iterator __position, _ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) argument
549 __BVECTOR(_InputIterator __first, _InputIterator __last, const allocator_type& __a = allocator_type()) argument
564 _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, __false_type) argument
569 __BVECTOR(const_iterator __first, const_iterator __last, const allocator_type& __a = allocator_type()) argument
578 __BVECTOR(const bool* __first, const bool* __last, const allocator_type& __a = allocator_type()) argument
621 assign(_InputIterator __first, _InputIterator __last) argument
631 _M_assign_dispatch(_InputIter __first, _InputIter __last, __false_type) argument
635 _M_assign_aux(_InputIterator __first, _InputIterator __last, input_iterator_tag) argument
643 insert(end(), __first, __last); local
647 _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) argument
700 insert(iterator __position, _InputIterator __first, _InputIterator __last) argument
713 _M_insert_dispatch(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) argument
719 insert(iterator __position, const_iterator __first, const_iterator __last) argument
741 insert(iterator __position, const bool* __first, const bool* __last) argument
789 erase(iterator __first, iterator __last) argument
[all...]
H A Dstl_deque.h580 deque(_InputIterator __first, _InputIterator __last, argument
583 _M_initialize_dispatch(__first, __last, _Integral());
593 void _M_initialize_dispatch(_InputIter __first, _InputIter __last, argument
595 _M_range_initialize(__first, __last, __ITERATOR_CATEGORY(__first));
600 deque(const value_type* __first, const value_type* __last, argument
602 : _Base(__a, __last - __first)
603 { uninitialized_copy(__first, __last, _M_start); }
604 deque(const_iterator __first, const_iterator __last, argument
606 : _Base(__a, __last - __first)
654 assign(_InputIterator __first, _InputIterator __last) argument
666 _M_assign_dispatch(_InputIterator __first, _InputIterator __last, __false_type) argument
676 _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) argument
776 insert(iterator __pos, _InputIterator __first, _InputIterator __last) argument
788 _M_insert_dispatch(iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) argument
951 _M_assign_aux(_InputIter __first, _InputIter __last, input_iterator_tag) argument
959 insert(end(), __first, __last); local
986 insert(iterator __pos, const value_type* __first, const value_type* __last) argument
1012 insert(iterator __pos, const_iterator __first, const_iterator __last) argument
1042 erase(iterator __first, iterator __last) argument
1109 _M_range_initialize(_InputIterator __first, _InputIterator __last, input_iterator_tag) argument
1121 _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) argument
1238 insert(iterator __pos, _InputIterator __first, _InputIterator __last, input_iterator_tag) argument
1249 insert(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) argument
1399 _M_insert_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) argument
1460 _M_insert_aux(iterator __pos, const value_type* __first, const value_type* __last, size_type __n) argument
1518 _M_insert_aux(iterator __pos, const_iterator __first, const_iterator __last, size_type __n) argument
[all...]
H A Dstl_hashtable.h161 const unsigned long* __first = __stl_prime_list; local
163 const unsigned long* pos = lower_bound(__first, __last, __n);
461 _Node* __first; local
462 for ( __first = _M_buckets[__n];
463 __first && !_M_equals(_M_get_key(__first->_M_val), __key);
464 __first = __first->_M_next)
466 return iterator(__first, this);
472 const _Node* __first; local
703 _Node* __first = _M_buckets[__n]; local
722 _Node* __first = _M_buckets[__n]; local
747 _Node* __first = _M_buckets[__n]; local
816 _Node* __first = _M_buckets[__n]; local
877 erase(iterator __first, iterator __last) argument
899 erase(const_iterator __first, const_iterator __last) argument
928 _Node* __first = _M_buckets[__bucket]; local
957 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last) argument
[all...]
H A Dstl_slist.h67 _Slist_node_base* __first = __before_first->_M_next; local
70 __pos->_M_next = __first;
366 slist(_InputIterator __first, _InputIterator __last, argument
368 { _M_insert_after_range(&_M_head, __first, __last); }
371 slist(const_iterator __first, const_iterator __last, argument
373 { _M_insert_after_range(&_M_head, __first, __last); }
374 slist(const value_type* __first, const value_type* __last, argument
376 { _M_insert_after_range(&_M_head, __first, __last); }
397 void assign(_InputIterator __first, _InputIterator __last) { argument
399 _M_assign_dispatch(__first, __las
475 _M_insert_after_range(_Node_base* __pos, _InIter __first, _InIter __last) argument
488 _M_insert_after_range(_Node_base* __pos, _InIter __first, _InIter __last, __false_type) argument
499 _M_insert_after_range(_Node_base* __pos, const_iterator __first, const_iterator __last) argument
506 _M_insert_after_range(_Node_base* __pos, const value_type* __first, const value_type* __last) argument
536 insert_after(iterator __pos, _InIter __first, _InIter __last) argument
542 insert_after(iterator __pos, const_iterator __first, const_iterator __last) argument
546 insert_after(iterator __pos, const value_type* __first, const value_type* __last) argument
572 insert(iterator __pos, _InIter __first, _InIter __last) argument
574 __first, __last); local
579 insert(iterator __pos, const_iterator __first, const_iterator __last) argument
581 __first, __last); local
583 insert(iterator __pos, const value_type* __first, const value_type* __last) argument
586 __first, __last); local
605 erase(iterator __first, iterator __last) argument
650 splice(iterator __pos, slist& __x, iterator __first, iterator __last) argument
725 _M_assign_dispatch(_InputIter __first, _InputIter __last, __false_type) argument
[all...]
H A Dstl_queue.h139 priority_queue(_InputIterator __first, _InputIterator __last) argument
140 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
143 priority_queue(_InputIterator __first, argument
145 : c(__first, __last), comp(__x)
149 priority_queue(_InputIterator __first, _InputIterator __last, argument
153 c.insert(c.end(), __first, __last);
158 priority_queue(const value_type* __first, const value_type* __last) argument
159 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
161 priority_queue(const value_type* __first, const value_type* __last, argument
163 : c(__first, __las
166 priority_queue(const value_type* __first, const value_type* __last, const _Compare& __x, const _Sequence& __c) argument
[all...]
H A Dstl_tempbuf.h111 _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) { argument
116 distance(__first, __last, _M_len);
119 _M_initialize_buffer(*__first, _Trivial());
145 temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) argument
146 : _Temporary_buffer<_ForwardIterator, _Tp>(__first, __last) {}
H A Dstl_tree.h718 void insert_unique(_InputIterator __first, _InputIterator __last);
720 void insert_equal(_InputIterator __first, _InputIterator __last);
722 void insert_unique(const_iterator __first, const_iterator __last);
723 void insert_unique(const value_type* __first, const value_type* __last);
724 void insert_equal(const_iterator __first, const_iterator __last);
725 void insert_equal(const value_type* __first, const value_type* __last);
730 void erase(iterator __first, iterator __last);
731 void erase(const key_type* __first, const key_type* __last);
970 ::insert_equal(_II __first, _II __last) argument
972 for ( ; __first !
979 insert_unique(_II __first, _II __last) argument
989 insert_equal(const _Val* __first, const _Val* __last) argument
998 insert_equal(const_iterator __first, const_iterator __last) argument
1007 insert_unique(const _Val* __first, const _Val* __last) argument
1015 insert_unique(const_iterator __first, const_iterator __last) argument
1096 erase(iterator __first, iterator __last) argument
1107 erase(const _Key* __first, const _Key* __last) argument
[all...]
H A Dstl_iterator.h262 inline void __distance(_InputIterator __first, _InputIterator __last, argument
265 while (__first != __last) { ++__first; ++__n; }
269 inline void __distance(_RandomAccessIterator __first, argument
273 __n += __last - __first;
277 inline void distance(_InputIterator __first, argument
280 __distance(__first, __last, __n, iterator_category(__first));
287 __distance(_InputIterator __first, _InputIterator __last, input_iterator_tag) argument
290 while (__first !
298 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) argument
305 distance(_InputIterator __first, _InputIterator __last) argument
[all...]
H A Dropeimpl.h1496 _Rope_rotate(_Rope_iterator<_CharT,_Alloc> __first, argument
1500 __stl_assert(__first.container() == __middle.container()
1502 rope<_CharT,_Alloc>& __r(__first.container());
1503 rope<_CharT,_Alloc> __prefix = __r.substr(0, __first.index());
1509 __r.substr(__first.index(), __middle.index() - __first.index());
1518 inline void rotate(_Rope_iterator<char,__STL_DEFAULT_ALLOCATOR(char)> __first, argument
1521 _Rope_rotate(__first, __middle, __last);
1534 _Rope_iterator<wchar_t,__STL_DEFAULT_ALLOCATOR(char)> __first,
1537 _Rope_rotate(__first, __middl
[all...]

Completed in 226 milliseconds