Searched defs:__last (Results 1 - 25 of 54) sorted by relevance

123

/external/stlport/test/unit/
H A Diota.h8 void __iota(_It __first, _It __last, _Tp __val) { argument
10 iota(__first, __last, __val);
12 while (__first != __last) {
/external/stlport/src/
H A Dbitset.cpp31 const unsigned char *__last)
89 while ( __first < __last ) {
30 _S_count(const unsigned char *__first, const unsigned char *__last) argument
/external/stlport/stlport/stl/
H A D_heap.h39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compar
99 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
108 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
H A D_threads.c61 unsigned _STLP_mutex_spin<__inst>::__last = 0; member in class:__inst
122 unsigned __my_last_spins = _STLP_mutex_spin<0>::__last;
136 _STLP_mutex_spin<0>::__last = __i; member in class:_STLP_mutex_spin
H A D_numeric.c40 __partial_sum(_InputIterator __first, _InputIterator __last, argument
42 _STLP_DEBUG_CHECK(__check_range(__first, __last))
43 if (__first == __last) return __result;
47 while (++__first != __last) {
57 __adjacent_difference(_InputIterator __first, _InputIterator __last, argument
60 _STLP_DEBUG_CHECK(__check_range(__first, __last))
61 if (__first == __last) return __result;
64 while (++__first != __last) {
H A D_heap.c57 _RandomAccessIterator __last, _Distance*, _Tp*)
59 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0),
60 _Tp(*(__last - 1)));
65 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
67 __push_heap_aux(__first, __last,
93 _RandomAccessIterator __last, _Compare __comp,
96 __push_heap(__first, _Distance((__last - __first) - 1), _Distance(0),
97 _Tp(*(__last - 1)), __comp);
102 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
105 __push_heap_aux(__first, __last, __com
56 __push_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance*, _Tp*) argument
92 __push_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, _Distance*, _Tp*) argument
132 __pop_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp*) argument
138 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
171 __pop_heap_aux(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp*, _Compare __comp) argument
181 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
190 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp*, _Distance*) argument
206 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
216 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, _Tp*, _Distance*) argument
233 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
H A D_numeric.h42 _Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp _Init) { argument
43 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
44 for ( ; __first != __last; ++__first)
51 _Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp _Init, argument
53 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
54 for ( ; __first != __last; ++__first)
87 __partial_sum(_InputIterator __first, _InputIterator __last,
94 partial_sum(_InputIterator __first, _InputIterator __last, argument
96 return _STLP_PRIV __partial_sum(__first, __last, __result, _STLP_VALUE_TYPE(__first, _InputIterator),
102 partial_sum(_InputIterator __first, _InputIterator __last, argument
121 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result) argument
130 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary_op) argument
174 iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __val) argument
[all...]
H A D_tempbuf.h111 _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) { argument
119 _M_len = _STLP_STD::distance(__first, __last);
150 temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) argument
151 : _Temporary_buffer<_ForwardIterator, _Tp>(__first, __last) {}
H A D_construct.h190 __destroy_range_aux(_ForwardIterator __first, _ForwardIterator __last, _Tp*, const __false_type& /*_Trivial_destructor*/) { argument
191 for ( ; __first != __last; ++__first) {
202 __destroy_range_aux(_ForwardIterator __first, _ForwardIterator __last, _Tp*, const __true_type& /*_Trivial_destructor*/) { argument
203 for ( ; __first != __last; ++__first)
213 __destroy_range(_ForwardIterator __first, _ForwardIterator __last, _Tp *__ptr) { argument
215 __destroy_range_aux(__first, __last, __ptr, _Trivial_destructor());
219 inline void _Destroy_Range(_ForwardIterator __first, _ForwardIterator __last) { argument
220 __destroy_range(__first, __last, _STLP_VALUE_TYPE(__first, _ForwardIterator));
232 __destroy_mv_srcs(_ForwardIterator __first, _ForwardIterator __last, _Tp *__ptr) { argument
234 __destroy_range_aux(__first, __last, __pt
239 _Destroy_Moved_Range(_ForwardIterator __first, _ForwardIterator __last) argument
280 destroy(_ForwardIterator __first, _ForwardIterator __last) argument
[all...]
H A D_list.c49 _List_node_base* __first, _List_node_base* __last) {
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
58 __position->_M_prev = __last->_M_prev;
59 __last->_M_prev = __first->_M_prev;
142 _Literator __last = __that.end(); local
143 while (__first != __last) {
155 _Literator __last = __that.end(); local
156 if (__first == __last) retur
48 _Transfer(_List_node_base* __position, _List_node_base* __first, _List_node_base* __last) argument
[all...]
H A D_queue.h184 priority_queue(_InputIterator __first, _InputIterator __last) argument
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last, argument
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last) argument
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last, argument
208 : c(__first, __last), com
188 priority_queue(_InputIterator __first, _InputIterator __last, const _Compare& __x) argument
211 priority_queue(const value_type* __first, const value_type* __last, const _Compare& __x, const _Sequence& __c) argument
[all...]
H A D_uninitialized.h52 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last, argument
56 for ( ; __first != __last; ++__first, ++__cur)
65 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last, argument
67 { return __ucopy(__first, __last, __result, __d); }
71 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last, argument
73 { return __ucopy(__first, __last, __result, __d); }
76 inline _OutputIter __ucopy(_InputIter __first, _InputIter __last, argument
78 { return __ucopy(__first, __last, __result, __d); }
82 inline _OutputIter __ucopy(_RandomAccessIter __first, _RandomAccessIter __last, argument
86 for (_Distance __n = __last
99 __ucopy(_RandomAccessIter __first, _RandomAccessIter __last, _OutputIter __result) argument
103 __ucopy_trivial(const void* __first, const void* __last, void* __result) argument
111 __ucopy_ptrs(_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type& ) argument
116 __ucopy_ptrs(_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type& ) argument
124 __ucopy_aux(_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type& ) argument
132 __ucopy_aux(_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type& ) argument
143 uninitialized_copy(_InputIter __first, _InputIter __last, _ForwardIter __result) argument
147 uninitialized_copy(const char* __first, const char* __last, char* __result) argument
152 uninitialized_copy(const wchar_t* __first, const wchar_t* __last, wchar_t* __result) argument
194 _RandomAccessIter __last = __first + __count; local
218 __ufill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, _Distance*) argument
228 __ufill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, const input_iterator_tag &, _Distance* __d) argument
234 __ufill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, const forward_iterator_tag &, _Distance* __d) argument
239 __ufill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, const bidirectional_iterator_tag &, _Distance* __d) argument
245 __ufill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x, const random_access_iterator_tag &, _Distance*) argument
258 uninitialized_fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __x) argument
265 uninitialized_fill(unsigned char* __first, unsigned char* __last, const unsigned char& __val) argument
271 uninitialized_fill(signed char* __first, signed char* __last, const signed char& __val) argument
277 uninitialized_fill(char* __first, char* __last, const char& __val) argument
314 _ForwardIter __last = __first + __n; local
389 __uninitialized_fill_copy(_ForwardIter __result, _ForwardIter __mid, const _Tp& __x, _InputIter __first, _InputIter __last) argument
418 __uninitialized_move(_InputIter __first, _InputIter __last, _ForwardIter __result, _TrivialUCpy __trivial_ucpy, const __false_type& ) argument
425 __uninitialized_move(_InputIter __first, _InputIter __last, _ForwardIter __result, _TrivialUCpy , const __true_type& ) argument
[all...]
H A D_algo.h59 for_each(_InputIter __first, _InputIter __last, _Function __f) { argument
60 for ( ; __first != __last; ++__first)
68 count_if(_InputIter __first, _InputIter __last, _Predicate __pred) { argument
69 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
71 for ( ; __first != __last; ++__first) {
82 adjacent_find(_ForwardIter __first, _ForwardIter __last, argument
84 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
85 if (__first == __last)
86 return __last;
88 while(++__next != __last) {
98 adjacent_find(_ForwardIter __first, _ForwardIter __last) argument
106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) argument
115 count_if(_InputIter __first, _InputIter __last, _Predicate __pred, _Size& __n) argument
170 transform(_InputIter __first, _InputIter __last, _OutputIter __result, _UnaryOperation __opr) argument
190 replace_if(_ForwardIter __first, _ForwardIter __last, _Predicate __pred, const _Tp& __new_value) argument
199 replace_copy(_InputIter __first, _InputIter __last,_OutputIter __result, const _Tp& __old_value, const _Tp& __new_value) argument
209 replace_copy_if(_Iterator __first, _Iterator __last, _OutputIter __result, _Predicate __pred, const _Tp& __new_value) argument
222 generate(_ForwardIter __first, _ForwardIter __last, _Generator __gen) argument
239 remove_copy(_InputIter __first, _InputIter __last,_OutputIter __result, const _Tp& __val) argument
252 remove_copy_if(_InputIter __first, _InputIter __last, _OutputIter __result, _Predicate __pred) argument
265 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
278 remove_if(_ForwardIter __first, _ForwardIter __last, _Predicate __pred) argument
298 unique(_ForwardIter __first, _ForwardIter __last) argument
304 unique(_ForwardIter __first, _ForwardIter __last, _BinaryPredicate __binary_pred) argument
316 __reverse(_BidirectionalIter __first, _BidirectionalIter __last, const bidirectional_iterator_tag &) argument
323 __reverse(_RandomAccessIter __first, _RandomAccessIter __last, const random_access_iterator_tag &) argument
332 reverse(_BidirectionalIter __first, _BidirectionalIter __last) argument
339 reverse_copy(_BidirectionalIter __first, _BidirectionalIter __last, _OutputIter __result) argument
355 rotate_copy(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last, _OutputIter __result) argument
481 lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
491 lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
507 upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
517 upper_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
535 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
545 equal_range(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
553 binary_search(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
564 binary_search(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare __comp) argument
722 is_sorted(_ForwardIter __first, _ForwardIter __last) argument
728 is_sorted(_ForwardIter __first, _ForwardIter __last, _StrictWeakOrdering __comp) argument
[all...]
H A D_algobase.c112 _STLP_INLINE_LOOP _RandomAccessIter __find(_RandomAccessIter __first, _RandomAccessIter __last, argument
115 _STLP_DIFFERENCE_TYPE(_RandomAccessIter) __trip_count = (__last - __first) >> 2;
131 switch (__last - __first) {
143 return __last;
148 __find(char* __first, char* __last, char __val, const random_access_iterator_tag &) { argument
149 void *res = memchr(__first, __val, __last - __first);
150 return res != 0 ? __STATIC_CAST(char*, res) : __last;
153 __find(const char* __first, const char* __last, char __val, const random_access_iterator_tag &) { argument
154 const void *res = memchr(__first, __val, __last - __first);
155 return res != 0 ? __STATIC_CAST(const char*, res) : __last;
159 __find_if(_RandomAccessIter __first, _RandomAccessIter __last, _Predicate __pred, const random_access_iterator_tag &) argument
195 __find(_InputIter __first, _InputIter __last, const _Tp& __val, const input_iterator_tag &) argument
203 __find_if(_InputIter __first, _InputIter __last, _Predicate __pred, const input_iterator_tag &) argument
214 find_if(_InputIter __first, _InputIter __last, _Predicate __pred) argument
221 find(_InputIter __first, _InputIter __last, const _Tp& __val) argument
453 __lower_bound(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, _Compare1 __comp1, _Compare2 _STLP_UNUSED(__comp2), _Distance*) argument
[all...]
H A D_algobase.h184 inline _OutputIter __copy(_InputIter __first, _InputIter __last, argument
186 for ( ; __first != __last; ++__result, ++__first)
193 inline _OutputIter __copy(_InputIter __first, _InputIter __last, argument
195 for ( ; __first != __last; ++__result, ++__first)
201 inline _OutputIter __copy(_InputIter __first, _InputIter __last, argument
203 for ( ; __first != __last; ++__result, ++__first)
211 __copy(_RandomAccessIter __first, _RandomAccessIter __last, argument
213 for (_Distance __n = __last - __first; __n > 0; --__n) {
222 __copy_trivial(const void* __first, const void* __last, void* __result) { argument
223 size_t __n = (const char*)__last
232 __copy_backward(_BidirectionalIter1 __first, _BidirectionalIter1 __last, _BidirectionalIter2 __result, const bidirectional_iterator_tag &, _Distance*) argument
243 __copy_backward(_RandomAccessIter __first, _RandomAccessIter __last, _BidirectionalIter __result, const random_access_iterator_tag &, _Distance*) argument
254 __copy_trivial_backward(const void* __first, const void* __last, void* __result) argument
260 __copy_ptrs(_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type& ) argument
265 __copy_ptrs(_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type& ) argument
273 __copy_aux(_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type& ) argument
281 __copy_aux(_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type& ) argument
291 copy(_InputIter __first, _InputIter __last, _OutputIter __result) argument
299 __copy_backward_ptrs(_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type& ) argument
306 __copy_backward_ptrs(_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type& ) argument
312 __copy_backward_aux(_InputIter __first, _InputIter __last, _OutputIter __result, const __false_type&) argument
319 __copy_backward_aux(_InputIter __first, _InputIter __last, _OutputIter __result, const __true_type&) argument
328 copy_backward(_InputIter __first, _InputIter __last, _OutputIter __result) argument
391 _RAIter __last = __first + __count; local
411 __fill_fwd(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
417 __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, const input_iterator_tag &, _Distance*) argument
425 __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, const forward_iterator_tag &, _Distance*) argument
432 __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, const bidirectional_iterator_tag &, _Distance*) argument
440 __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, const random_access_iterator_tag &, _Distance*) argument
449 fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) argument
457 fill(unsigned char* __first, unsigned char* __last, const unsigned char& __val) argument
463 fill(signed char* __first, signed char* __last, const signed char& __val) argument
469 fill(char* __first, char* __last, const char& __val) argument
656 count(_InputIter __first, _InputIter __last, const _Tp& __val) argument
701 replace(_ForwardIter __first, _ForwardIter __last, const _Tp& __old_value, const _Tp& __new_value) argument
[all...]
H A D_iterator_base.h315 __distance(const _InputIterator& __first, const _InputIterator& __last, argument
319 while (__it != __last) {
328 __distance(const _ForwardIterator& __first, const _ForwardIterator& __last, argument
332 while (__it != __last) {
340 __distance(const _BidirectionalIterator& __first, const _BidirectionalIterator& __last, argument
344 while (__it != __last) {
353 __distance(const _RandomAccessIterator& __first, const _RandomAccessIterator& __last, argument
355 { return __last - __first; }
361 distance(_InputIterator __first, _InputIterator __last) argument
362 { return _STLP_PRIV __distance(__first, __last, _STLP_ITERATOR_CATEGOR
366 distance(const _InputIterator& __first, const _InputIterator& __last, _Distance& __n) argument
373 _Distance(_InputIterator __first, _InputIterator __last, _Dist& __n) argument
[all...]
H A D_map.h112 map(_InputIterator __first, _InputIterator __last) argument
114 { _M_t.insert_unique(__first, __last); }
117 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp, argument
119 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
123 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp) argument
124 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
128 map(const value_type* __first, const value_type* __last) argument
130 { _M_t.insert_unique(__first, __last); }
133 const value_type* __last, const _Compare& __comp,
135 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
132 map(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
137 map(const_iterator __first, const_iterator __last) argument
141 map(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
194 insert(_InputIterator __first, _InputIterator __last) argument
197 insert(const value_type* __first, const value_type* __last) argument
199 insert(const_iterator __first, const_iterator __last) argument
205 erase(iterator __first, iterator __last) argument
299 multimap(_InputIterator __first, _InputIterator __last) argument
304 multimap(_InputIterator __first, _InputIterator __last, const _Compare& __comp) argument
309 multimap(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) argument
314 multimap(const value_type* __first, const value_type* __last) argument
317 multimap(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
322 multimap(const_iterator __first, const_iterator __last) argument
325 multimap(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
370 insert(_InputIterator __first, _InputIterator __last) argument
373 insert(const value_type* __first, const value_type* __last) argument
375 insert(const_iterator __first, const_iterator __last) argument
380 erase(iterator __first, iterator __last) argument
[all...]
H A D_num_put.c42 __copy_float_and_fill(const _CharT* __first, const _CharT* __last, argument
47 if (__width <= __last - __first)
48 return _STLP_STD::copy(__first, __last, __oi);
50 streamsize __pad = __width - (__last - __first);
54 __oi = _STLP_STD::copy(__first, __last, __oi);
57 else if (__dir == ios_base::internal && __first != __last &&
61 return _STLP_STD::copy(__first, __last, __oi);
65 return _STLP_STD::copy(__first, __last, __oi);
H A D_set.h102 set(_InputIterator __first, _InputIterator __last) argument
104 { _M_t.insert_unique(__first, __last); }
108 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp) argument
109 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
112 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp, argument
114 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
116 set(const value_type* __first, const value_type* __last) argument
118 { _M_t.insert_unique(__first, __last); }
121 const value_type* __last, const _Compare& __comp,
123 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
120 set(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
125 set(const_iterator __first, const_iterator __last) argument
129 set(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
174 insert(_InputIterator __first, _InputIterator __last) argument
177 insert(const_iterator __first, const_iterator __last) argument
179 insert(const value_type* __first, const value_type* __last) argument
184 erase(iterator __first, iterator __last) argument
271 multiset(_InputIterator __first, _InputIterator __last) argument
276 multiset(_InputIterator __first, _InputIterator __last, const _Compare& __comp, const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) argument
282 multiset(_InputIterator __first, _InputIterator __last, const _Compare& __comp) argument
287 multiset(const value_type* __first, const value_type* __last) argument
291 multiset(const value_type* __first, const value_type* __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
296 multiset(const_iterator __first, const_iterator __last) argument
300 multiset(const_iterator __first, const_iterator __last, const _Compare& __comp, const allocator_type& __a = allocator_type()) argument
346 insert(_InputIterator __first, _InputIterator __last) argument
349 insert(const value_type* __first, const value_type* __last) argument
351 insert(const_iterator __first, const_iterator __last) argument
356 erase(iterator __first, iterator __last) argument
[all...]
H A D_time_facets.c78 __match(_InIt& __first, _InIt& __last, _NameIt __name, _NameIt __name_end) { argument
89 while (__first != __last) {
149 __get_formatted_time _STLP_WEAK (_InIt1 __first, _InIt1 __last, argument
157 while (__first != __last && __format != __format_end) {
171 size_t __index = __match(__first, __last,
182 size_t __index = __match(__first, __last,
191 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mday, __STATIC_CAST(_Ch*, 0));
200 bool __pr = __get_decimal_integer(__first, __last, __t->tm_hour, __STATIC_CAST(_Ch*, 0));
207 bool __pr = __get_decimal_integer(__first, __last, __t->tm_yday, __STATIC_CAST(_Ch*, 0));
214 bool __pr = __get_decimal_integer(__first, __last, __
281 __get_short_or_long_dayname(_InIt& __first, _InIt& __last, const _TimeInfo& __table, tm* __t) argument
292 __get_short_or_long_monthname(_InIt& __first, _InIt& __last, const _TimeInfo& __table, tm* __t) argument
[all...]
/external/stlport/stlport/stl/debug/
H A D_deque.h82 void _Invalidate_iterators(const iterator& __first, const iterator& __last) argument
83 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
161 deque(_InputIterator __first, _InputIterator __last,
163 : _ConstructCheck(__first, __last),
164 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last), __a),
169 deque(_InputIterator __first, _InputIterator __last)
170 : _ConstructCheck(__first, __last),
171 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)),
176 deque(const value_type* __first, const value_type* __last,
178 : _ConstructCheck(__first, __last),
[all...]
H A D_list.h85 void _Invalidate_iterators(const iterator& __first, const iterator& __last) argument
86 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
121 list(_InputIterator __first, _InputIterator __last, argument
123 : _ConstructCheck(__first, __last),
124 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last), __a),
128 list(_InputIterator __first, _InputIterator __last) argument
129 : _ConstructCheck(__first, __last),
130 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)),
135 list(const value_type* __first, const value_type* __last, argument
137 : _ConstructCheck(__first, __last),
140 list(const_iterator __first, const_iterator __last, const allocator_type& __a = allocator_type()) argument
220 insert(iterator __pos, _InputIterator __first, _InputIterator __last) argument
229 insert(iterator __pos, const _Tp* __first, const _Tp* __last) argument
237 insert(iterator __pos, const_iterator __first, const_iterator __last) argument
246 insert(iterator __pos, iterator __first, iterator __last) argument
282 erase(iterator __first, iterator __last) argument
309 assign(_InputIterator __first, _InputIterator __last) argument
315 assign(const _Tp* __first, const _Tp* __last) argument
321 assign(iterator __first, iterator __last) argument
327 assign(const_iterator __first, const_iterator __last) argument
340 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
385 splice(iterator __pos, _Self& __x, iterator __first, iterator __last) argument
416 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
436 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
450 _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end(); local
[all...]
H A D_tree.h114 void _Invalidate_iterators(const iterator& __first, const iterator& __last) argument
115 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
241 void insert_equal(_InputIterator __first, _InputIterator __last) { argument
242 _STLP_DEBUG_CHECK(__check_range(__first,__last))
243 _M_non_dbg_impl.insert_equal(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last));
246 void insert_unique(_InputIterator __first, _InputIterator __last) { argument
247 _STLP_DEBUG_CHECK(__check_range(__first,__last))
248 _M_non_dbg_impl.insert_unique(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last));
251 void insert_unique(const_iterator __first, const_iterator __last) { argument
252 _STLP_DEBUG_CHECK(__check_range(__first,__last))
255 insert_unique(const value_type* __first, const value_type* __last) argument
259 insert_equal(const_iterator __first, const_iterator __last) argument
263 insert_equal(const value_type* __first, const value_type* __last) argument
292 erase(iterator __first, iterator __last) argument
297 erase(const key_type* __first, const key_type* __last) argument
[all...]
H A D_vector.h128 void _Invalidate_iterators(const iterator& __first, const iterator& __last) argument
129 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
207 vector(_InputIterator __first, _InputIterator __last,
209 : _ConstructCheck(__first, __last),
210 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last), __a),
215 vector(_InputIterator __first, _InputIterator __last)
216 : _ConstructCheck(__first, __last),
217 _M_non_dbg_impl(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)),
221 vector(const _Tp* __first, const _Tp* __last,
223 : _ConstructCheck(__first, __last), _M_non_dbg_imp
[all...]
/external/clang/test/CodeGenCXX/
H A D2007-09-10-RecursiveTypeResolution.cpp33 typename _Tp > inline void find (_InputIterator __last, argument

Completed in 537 milliseconds

123