/prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _queue.h | 184 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.h | 52 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...] |
/prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
H A D | stl_queue.h | 420 * @param __last An input iterator. 434 priority_queue(_InputIterator __first, _InputIterator __last, argument 439 __glibcxx_requires_valid_range(__first, __last); 440 c.insert(c.end(), __first, __last); 445 priority_queue(_InputIterator __first, _InputIterator __last, argument 450 __glibcxx_requires_valid_range(__first, __last); 451 c.insert(c.end(), __first, __last); 456 priority_queue(_InputIterator __first, _InputIterator __last, argument 461 __glibcxx_requires_valid_range(__first, __last); 462 c.insert(c.end(), __first, __last); [all...] |
H A D | stl_tempbuf.h | 163 _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last); 185 __ucr(_Pointer __first, _Pointer __last, argument 188 if(__first == __last) 198 for(; __cur != __last; ++__cur, ++__prev) 231 __uninitialized_construct_buf(_Pointer __first, _Pointer __last, argument 239 __ucr(__first, __last, __seed); 244 _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) argument 245 : _M_original_len(std::distance(__first, __last)),
|
/prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _construct.h | 190 __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.c | 49 _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.h | 184 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.h | 52 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...] |
/prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
H A D | stl_queue.h | 420 * @param __last An input iterator. 434 priority_queue(_InputIterator __first, _InputIterator __last, argument 439 __glibcxx_requires_valid_range(__first, __last); 440 c.insert(c.end(), __first, __last); 445 priority_queue(_InputIterator __first, _InputIterator __last, argument 450 __glibcxx_requires_valid_range(__first, __last); 451 c.insert(c.end(), __first, __last); 456 priority_queue(_InputIterator __first, _InputIterator __last, argument 461 __glibcxx_requires_valid_range(__first, __last); 462 c.insert(c.end(), __first, __last); [all...] |
H A D | stl_tempbuf.h | 163 _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last); 185 __ucr(_Pointer __first, _Pointer __last, argument 188 if(__first == __last) 198 for(; __cur != __last; ++__cur, ++__prev) 231 __uninitialized_construct_buf(_Pointer __first, _Pointer __last, argument 239 __ucr(__first, __last, __seed); 244 _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) argument 245 : _M_original_len(std::distance(__first, __last)),
|
/prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _construct.h | 190 __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.c | 49 _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.h | 184 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.h | 52 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...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
H A D | stl_bvector.h | 383 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x) argument 385 for (; __first != __last; ++__first) 390 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x) argument 392 if (__first._M_p != __last._M_p) 394 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0); 396 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local 399 __fill_bvector(__first, __last, __x); 606 vector(_InputIterator __first, _InputIterator __last, 609 { _M_initialize_dispatch(__first, __last, __false_typ [all...] |
H A D | stl_map.h | 216 * @param __last An input iterator. 219 * [__first,__last). This is linear in N if the range is 221 * distance(__first,__last)). 224 map(_InputIterator __first, _InputIterator __last) argument 226 { _M_t._M_insert_unique(__first, __last); } 231 * @param __last An input iterator. 236 * [__first,__last). This is linear in N if the range is 238 * distance(__first,__last)). 241 map(_InputIterator __first, _InputIterator __last, argument 245 { _M_t._M_insert_unique(__first, __last); } 670 insert(_InputIterator __first, _InputIterator __last) argument 746 erase(const_iterator __first, const_iterator __last) argument 762 erase(iterator __first, iterator __last) argument [all...] |
H A D | stl_multimap.h | 212 * @param __last An input iterator. 215 * [__first,__last). This is linear in N if the range is already sorted, 216 * and NlogN otherwise (where N is distance(__first,__last)). 219 multimap(_InputIterator __first, _InputIterator __last) argument 221 { _M_t._M_insert_equal(__first, __last); } 226 * @param __last An input iterator. 231 * [__first,__last). This is linear in N if the range is already sorted, 232 * and NlogN otherwise (where N is distance(__first,__last)). 235 multimap(_InputIterator __first, _InputIterator __last, argument 239 { _M_t._M_insert_equal(__first, __last); } 562 insert(_InputIterator __first, _InputIterator __last) argument 652 erase(const_iterator __first, const_iterator __last) argument 671 erase(iterator __first, iterator __last) argument [all...] |
H A D | stl_multiset.h | 153 * @param __last An input iterator. 157 * and NlogN otherwise (where N is distance(__first,__last)). 160 multiset(_InputIterator __first, _InputIterator __last) argument 162 { _M_t._M_insert_equal(__first, __last); } 167 * @param __last An input iterator. 172 * [__first,__last). This is linear in N if the range is already sorted, 173 * and NlogN otherwise (where N is distance(__first,__last)). 176 multiset(_InputIterator __first, _InputIterator __last, argument 180 { _M_t._M_insert_equal(__first, __last); } 497 * @param __last Iterato 503 insert(_InputIterator __first, _InputIterator __last) argument 589 erase(const_iterator __first, const_iterator __last) argument 605 erase(iterator __first, iterator __last) argument [all...] |
H A D | stl_set.h | 155 * @param __last An input iterator. 158 * [__first,__last). This is linear in N if the range is 160 * distance(__first,__last)). 163 set(_InputIterator __first, _InputIterator __last) argument 165 { _M_t._M_insert_unique(__first, __last); } 170 * @param __last An input iterator. 175 * [__first,__last). This is linear in N if the range is 177 * distance(__first,__last)). 180 set(_InputIterator __first, _InputIterator __last, argument 184 { _M_t._M_insert_unique(__first, __last); } 517 insert(_InputIterator __first, _InputIterator __last) argument 603 erase(const_iterator __first, const_iterator __last) argument 619 erase(iterator __first, iterator __last) argument [all...] |
H A D | stl_uninitialized.h | 68 __uninit_copy(_InputIterator __first, _InputIterator __last, argument 74 for (; __first != __last; ++__first, ++__cur) 91 __uninit_copy(_InputIterator __first, _InputIterator __last, argument 93 { return std::copy(__first, __last, __result); } 99 * @param __last An input iterator. 101 * @return __result + (__first - __last) 107 uninitialized_copy(_InputIterator __first, _InputIterator __last, argument 117 __uninit_copy(__first, __last, __result); 126 __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, argument 132 for (; __cur != __last; 148 __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) argument 164 uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) argument 236 __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) argument 256 __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, allocator<_Tp>&) argument 263 __uninitialized_move_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) argument 274 __uninitialized_move_if_noexcept_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) argument 286 __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, _Allocator& __alloc) argument 305 __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, allocator<_Tp2>&) argument 404 __uninitialized_fill_move(_ForwardIterator __result, _ForwardIterator __mid, const _Tp& __x, _InputIterator __first, _InputIterator __last, _Allocator& __alloc) argument 454 __uninit_default(_ForwardIterator __first, _ForwardIterator __last) argument 475 __uninit_default(_ForwardIterator __first, _ForwardIterator __last) argument 524 __uninitialized_default(_ForwardIterator __first, _ForwardIterator __last) argument 553 __uninitialized_default_a(_ForwardIterator __first, _ForwardIterator __last, _Allocator& __alloc) argument 573 __uninitialized_default_a(_ForwardIterator __first, _ForwardIterator __last, allocator<_Tp>&) argument [all...] |
H A D | streambuf_iterator.h | 294 istreambuf_iterator<_CharT> __last, 297 if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed) 310 __copy_move_a2(_CharT* __first, _CharT* __last, argument 313 const streamsize __num = __last - __first; 322 __copy_move_a2(const _CharT* __first, const _CharT* __last, argument 325 const streamsize __num = __last - __first; 335 istreambuf_iterator<_CharT> __last, _CharT* __result) 342 if (__first._M_sbuf && !__last._M_sbuf) 370 istreambuf_iterator<_CharT> __last, const _CharT& __val) 377 if (__first._M_sbuf && !__last 293 copy(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, ostreambuf_iterator<_CharT> __result) argument 334 __copy_move_a2(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, _CharT* __result) argument 369 find(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, const _CharT& __val) argument [all...] |
H A D | unordered_map.h | 148 * @param __last An input iterator. 155 * [__first,__last). This is linear in N (where N is 156 * distance(__first,__last)). 412 * @param __last Iterator pointing to the end of the range. 418 insert(_InputIterator __first, _InputIterator __last) argument 419 { _M_h.insert(__first, __last); } 473 * @brief Erases a [__first,__last) range of elements from an 477 * @param __last Iterator pointing to the end of the range to 479 * @return The iterator @a __last. 487 erase(const_iterator __first, const_iterator __last) argument 1081 insert(_InputIterator __first, _InputIterator __last) argument 1151 erase(const_iterator __first, const_iterator __last) argument [all...] |
H A D | unordered_set.h | 142 * @param __last An input iterator. 149 * [__first,__last). This is linear in N (where N is 150 * distance(__first,__last)). 386 * @param __last Iterator pointing to the end of the range. 392 insert(_InputIterator __first, _InputIterator __last) argument 393 { _M_h.insert(__first, __last); } 447 * @brief Erases a [__first,__last) range of elements from an 451 * @param __last Iterator pointing to the end of the range to 453 * @return The iterator @a __last. 461 erase(const_iterator __first, const_iterator __last) argument 975 insert(_InputIterator __first, _InputIterator __last) argument 1048 erase(const_iterator __first, const_iterator __last) argument [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/debug/ |
H A D | functions.h | 91 const _RandomAccessIterator& __last, 93 { return __last - __first >= 0; } 120 const _InputIterator& __last, std::__false_type) 121 { return __valid_range_aux2(__first, __last, 131 __valid_range(const _InputIterator& __first, const _InputIterator& __last) argument 134 return __valid_range_aux(__first, __last, _Integral()); 141 const _Safe_iterator<_Iterator, _Sequence>& __last) 142 { return __first._M_valid_range(__last); } 148 const _Safe_local_iterator<_Iterator, _Sequence>& __last) 149 { return __first._M_valid_range(__last); } 90 __valid_range_aux2(const _RandomAccessIterator& __first, const _RandomAccessIterator& __last, std::random_access_iterator_tag) argument 119 __valid_range_aux(const _InputIterator& __first, const _InputIterator& __last, std::__false_type) argument 140 __valid_range(const _Safe_iterator<_Iterator, _Sequence>& __first, const _Safe_iterator<_Iterator, _Sequence>& __last) argument 147 __valid_range(const _Safe_local_iterator<_Iterator, _Sequence>& __first, const _Safe_local_iterator<_Iterator, _Sequence>& __last) argument 200 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) argument 218 __check_sorted_aux(const _Safe_iterator<_Iterator, _Sequence>& __first, const _Safe_iterator<_Iterator, _Sequence>& __last, std::random_access_iterator_tag __tag) argument 235 __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, std::forward_iterator_tag) argument 254 __check_sorted_aux(const _Safe_iterator<_Iterator, _Sequence>& __first, const _Safe_iterator<_Iterator, _Sequence>& __last, _Predicate __pred, std::random_access_iterator_tag __tag) argument 263 __check_sorted(const _InputIterator& __first, const _InputIterator& __last) argument 275 __check_sorted(const _InputIterator& __first, const _InputIterator& __last, _Predicate __pred) argument 288 __check_sorted_set_aux(const _InputIterator& __first, const _InputIterator& __last, std::__true_type) argument 302 __check_sorted_set_aux(const _InputIterator& __first, const _InputIterator& __last, _Predicate __pred, std::__true_type) argument 317 __check_sorted_set(const _InputIterator1& __first, const _InputIterator1& __last, const _InputIterator2&) argument 334 __check_sorted_set(const _InputIterator1& __first, const _InputIterator1& __last, const _InputIterator2&, _Predicate __pred) argument 350 __check_partitioned_lower_aux(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, std::forward_iterator_tag) argument 369 __check_partitioned_lower_aux( const _Safe_iterator<_Iterator, _Sequence>& __first, const _Safe_iterator<_Iterator, _Sequence>& __last, const _Tp& __value, std::random_access_iterator_tag __tag) argument 384 __check_partitioned_lower(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) argument 393 __check_partitioned_upper_aux(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, std::forward_iterator_tag) argument 412 __check_partitioned_upper_aux( const _Safe_iterator<_Iterator, _Sequence>& __first, const _Safe_iterator<_Iterator, _Sequence>& __last, const _Tp& __value, std::random_access_iterator_tag __tag) argument 424 __check_partitioned_upper(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) argument 433 __check_partitioned_lower_aux(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Pred __pred, std::forward_iterator_tag) argument 454 __check_partitioned_lower_aux( const _Safe_iterator<_Iterator, _Sequence>& __first, const _Safe_iterator<_Iterator, _Sequence>& __last, const _Tp& __value, _Pred __pred, std::random_access_iterator_tag __tag) argument 467 __check_partitioned_lower(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Pred __pred) argument 477 __check_partitioned_upper_aux(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Pred __pred, std::forward_iterator_tag) argument 498 __check_partitioned_upper_aux( const _Safe_iterator<_Iterator, _Sequence>& __first, const _Safe_iterator<_Iterator, _Sequence>& __last, const _Tp& __value, _Pred __pred, std::random_access_iterator_tag __tag) argument 510 __check_partitioned_upper(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Pred __pred) argument [all...] |
H A D | map.h | 80 map(_InputIterator __first, _InputIterator __last, argument 84 __last)), 85 __gnu_debug::__base(__last), 280 insert(_InputIterator __first, _InputIterator __last) argument 282 __glibcxx_check_valid_range(__first, __last); 284 __gnu_debug::__base(__last)); 325 erase(const_iterator __first, const_iterator __last) argument 329 __glibcxx_check_erase_range(__first, __last); 331 __victim != __last.base(); ++__victim) 336 ._M_iterator(__last, "las 343 erase(iterator __first, iterator __last) argument [all...] |