Searched defs:__prev (Results 1 - 8 of 8) sorted by relevance

/external/stlport/stlport/stl/
H A D_bitset.c110 _Base_bitset<_Nw>::_M_do_find_next(size_t __prev, argument
113 ++__prev;
116 if ( __prev >= _Nw * __BITS_PER_WORD )
120 size_t __i = _S_whichword(__prev);
124 __thisword &= (~__STATIC_CAST(_WordT,0)) << _S_whichbit(__prev);
129 __thisword >>= _S_whichbyte(__prev) * CHAR_BIT;
130 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); ++__j ) {
H A D_slist.c92 _Node_base* __prev = &this->_M_head._M_data; local
96 __prev = __node;
100 _M_insert_after_fill(__prev, __n, __val);
102 this->_M_erase_after(__prev, 0);
H A D_hashtable.c173 _ElemsIte __prev = __cur++; local
174 for (; __cur != __pos; ++__prev, ++__cur);
175 return __prev;
186 size_type __prev = __n; local
187 _ElemsIte __pos = _M_before_begin(__prev)._M_ite;
189 fill(_M_buckets.begin() + __prev, _M_buckets.begin() + __n + 1,
275 _ElemsIte __prev = _M_before_begin(__prev_b)._M_ite; local
277 __cur = _M_elems.erase_after(__prev);
283 _ElemsIte __prev = __cur++; local
284 for (; __cur != __last; ++__prev,
310 _ElemsIte __prev = _M_before_begin(__prev_b)._M_ite; local
316 _ElemsIte __prev = __cur++; local
341 _ElemsIte __prev; local
407 const size_type *__prev; local
469 _ElemsIte __prev = _S_before_begin(__tmp_elems, __tmp, __prev_bucket)._M_ite; local
[all...]
H A D_bitset.h203 size_t _M_do_find_next(size_t __prev, size_t __not_found) const;
265 inline size_t _M_do_find_next(size_t __prev, size_t __not_found) const;
295 _Base_bitset<1UL>::_M_do_find_next(size_t __prev, argument
298 ++__prev;
301 if ( __prev >= __BITS_PER_WORD )
308 __thisword &= (~__STATIC_CAST(_WordT,0)) << _S_whichbit(__prev);
313 __thisword >>= _S_whichbyte(__prev) * CHAR_BIT;
314 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); __j++ ) {
623 size_t _Find_next( size_t __prev ) const
624 { return this->_M_do_find_next(__prev, _N
[all...]
H A D_slist.h374 _Node_base* __prev = &this->_M_head._M_data;
378 __prev = __node;
383 _M_insert_after_range(__prev, __first, __last);
385 this->_M_erase_after(__prev, 0);
389 _Node_base* __prev = &this->_M_head._M_data; local
393 __prev = __node;
398 _M_insert_after_range(__prev, __first, __last);
400 this->_M_erase_after(__prev, 0);
711 // Moves the element that follows __prev to *this, inserting it immediately
713 void splice_after(iterator __pos, _Self& __x, iterator __prev) { argument
[all...]
/external/stlport/stlport/stl/debug/
H A D_debug.c126 _L_type* __prev = __CONST_CAST(_L_type*, &__base->_M_node); local
127 _L_type* __pos = __prev->_M_next;
135 __prev->_M_next = __pos->_M_next;
138 __prev = __pos;
140 __pos = __prev->_M_next;
150 _L_type* __prev = __CONST_CAST(_L_type*, &__base->_M_node); local
151 _L_type* __pos = __prev->_M_next;
157 __prev->_M_next = __pos->_M_next;
160 __prev = __pos;
162 __pos = __prev
223 _L_type* __prev = &__base->_M_node; local
519 _L_type* __prev = &__src._M_node; local
542 __owned_link* __prev, *__next; local
[all...]
H A D_slist.h415 // Moves the element that follows __prev to *this, inserting it immediately
417 void splice_after(iterator __pos, _Self& __x, iterator __prev) { argument
420 _STLP_DEBUG_CHECK(_STLP_PRIV _Dereferenceable(__prev))
421 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&__x._M_iter_list, __prev))
422 iterator __elem = __prev; ++__elem;
423 _M_non_dbg_impl.splice_after(__pos._M_iterator, __x._M_non_dbg_impl, __prev._M_iterator);
/external/stlport/stlport/stl/pointers/
H A D_slist.h369 void splice_after(iterator __pos, _Self& __x, iterator __prev) argument
370 { _M_impl.splice_after(_BaseIte(__pos._M_node), __x._M_impl, _BaseIte(__prev._M_node)); }

Completed in 87 milliseconds