HomeSort by: relevance | last modified time | path
    Searched defs:__tail (Results 1 - 20 of 20) sorted by relevancy

  /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
forward_list.h 94 _Fwd_list_node_base* __tail = _M_next; local
95 if (!__tail)
97 while (_Fwd_list_node_base* __temp = __tail->_M_next)
101 __tail->_M_next = __temp->_M_next;
forward_list.h 94 _Fwd_list_node_base* __tail = _M_next; local
95 if (!__tail)
97 while (_Fwd_list_node_base* __temp = __tail->_M_next)
101 __tail->_M_next = __temp->_M_next;
ranges_algobase.h 470 auto __tail = __lasti; local
474 --__tail;
476 __detail::__assign_one<_IsMove>(__result, __tail);
483 auto __tail = __lasti; local
485 while (__first != __tail)
487 --__tail;
489 __detail::__assign_one<_IsMove>(__result, __tail);
ranges_algobase.h 470 auto __tail = __lasti; local
474 --__tail;
476 __detail::__assign_one<_IsMove>(__result, __tail);
483 auto __tail = __lasti; local
485 while (__first != __tail)
487 --__tail;
489 __detail::__assign_one<_IsMove>(__result, __tail);
shared_ptr_base.h 731 _M_alloc_array(size_t __tail)
733 return allocator_traits<_Alloc>::allocate(_M_alloc, _M_n + __tail);
738 size_t __tail)
740 allocator_traits<_Alloc>::deallocate(_M_alloc, __p, _M_n + __tail);
985 const size_t __tail = _Sp_ca_type::_S_tail(); local
1010 size_t __space = sizeof(_Up) * __tail;
shared_ptr_base.h 731 _M_alloc_array(size_t __tail)
733 return allocator_traits<_Alloc>::allocate(_M_alloc, _M_n + __tail);
738 size_t __tail)
740 allocator_traits<_Alloc>::deallocate(_M_alloc, __p, _M_n + __tail);
985 const size_t __tail = _Sp_ca_type::_S_tail(); local
1010 size_t __space = sizeof(_Up) * __tail;
ranges_algo.h 1263 auto __tail = __i; local
1269 --__tail;
1270 while (__first < __tail)
1272 ranges::iter_swap(__first, __tail);
1274 --__tail;
1282 if (__first == __tail || __first == --__tail)
1286 ranges::iter_swap(__first, __tail);
1316 auto __tail = __i; local
1317 while (__first != __tail)
1421 auto __tail = __lasti; local
2281 auto __tail = __lasti; local
    [all...]
ranges_algo.h 1263 auto __tail = __i; local
1269 --__tail;
1270 while (__first < __tail)
1272 ranges::iter_swap(__first, __tail);
1274 --__tail;
1282 if (__first == __tail || __first == --__tail)
1286 ranges::iter_swap(__first, __tail);
1316 auto __tail = __i; local
1317 while (__first != __tail)
1421 auto __tail = __lasti; local
2281 auto __tail = __lasti; local
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
forward_list.h 93 _Fwd_list_node_base* __tail = _M_next; local
94 if (!__tail)
96 while (_Fwd_list_node_base* __temp = __tail->_M_next)
100 __tail->_M_next = __temp->_M_next;
forward_list.h 93 _Fwd_list_node_base* __tail = _M_next; local
94 if (!__tail)
96 while (_Fwd_list_node_base* __temp = __tail->_M_next)
100 __tail->_M_next = __temp->_M_next;
ranges_algobase.h 406 auto __tail = __lasti; local
410 --__tail;
413 *__result = std::move(*__tail);
415 *__result = *__tail;
422 auto __tail = __lasti; local
424 while (__first != __tail)
426 --__tail;
429 *__result = std::move(*__tail);
431 *__result = *__tail;
ranges_algobase.h 406 auto __tail = __lasti; local
410 --__tail;
413 *__result = std::move(*__tail);
415 *__result = *__tail;
422 auto __tail = __lasti; local
424 while (__first != __tail)
426 --__tail;
429 *__result = std::move(*__tail);
431 *__result = *__tail;
shared_ptr_base.h 733 _M_alloc_array(size_t __tail)
735 return allocator_traits<_Alloc>::allocate(_M_alloc, _M_n + __tail);
740 size_t __tail)
742 allocator_traits<_Alloc>::deallocate(_M_alloc, __p, _M_n + __tail);
987 const size_t __tail = _Sp_ca_type::_S_tail(); local
1012 size_t __space = sizeof(_Up) * __tail;
shared_ptr_base.h 733 _M_alloc_array(size_t __tail)
735 return allocator_traits<_Alloc>::allocate(_M_alloc, _M_n + __tail);
740 size_t __tail)
742 allocator_traits<_Alloc>::deallocate(_M_alloc, __p, _M_n + __tail);
987 const size_t __tail = _Sp_ca_type::_S_tail(); local
1012 size_t __space = sizeof(_Up) * __tail;
ranges_algo.h 1286 auto __tail = __i; local
1292 --__tail;
1293 while (__first < __tail)
1295 ranges::iter_swap(__first, __tail);
1297 --__tail;
1305 if (__first == __tail || __first == --__tail)
1309 ranges::iter_swap(__first, __tail);
1339 auto __tail = __i; local
1340 while (__first != __tail)
1444 auto __tail = __lasti; local
2306 auto __tail = __lasti; local
    [all...]
ranges_algo.h 1286 auto __tail = __i; local
1292 --__tail;
1293 while (__first < __tail)
1295 ranges::iter_swap(__first, __tail);
1297 --__tail;
1305 if (__first == __tail || __first == --__tail)
1309 ranges::iter_swap(__first, __tail);
1339 auto __tail = __i; local
1340 while (__first != __tail)
1444 auto __tail = __lasti; local
2306 auto __tail = __lasti; local
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/
hashtable.h 609 _Node** __tail = _M_buckets + __i; local
612 *__tail = _M_allocate_node(__n->_M_v);
613 this->_M_copy_code(*__tail, __n);
614 __tail = &((*__tail)->_M_next);
hashtable.h 609 _Node** __tail = _M_buckets + __i; local
612 *__tail = _M_allocate_node(__n->_M_v);
613 this->_M_copy_code(*__tail, __n);
614 __tail = &((*__tail)->_M_next);
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/
hashtable.h 609 _Node** __tail = _M_buckets + __i; local
612 *__tail = _M_allocate_node(__n->_M_v);
613 this->_M_copy_code(*__tail, __n);
614 __tail = &((*__tail)->_M_next);
hashtable.h 609 _Node** __tail = _M_buckets + __i; local
612 *__tail = _M_allocate_node(__n->_M_v);
613 this->_M_copy_code(*__tail, __n);
614 __tail = &((*__tail)->_M_next);

Completed in 70 milliseconds