| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _slist.h | 220 iterator previous(const_iterator __pos)
221 { return iterator(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node); }
222 const_iterator previous(const_iterator __pos) const
223 { return const_iterator(const_cast<_Node_base*>(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node)); }
226 iterator insert_after(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type))
228 iterator insert_after(iterator __pos, const value_type& __x)
230 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node),
234 iterator insert_after(iterator __pos)
235 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node))._M_node);}
238 void insert_after(iterator __pos, size_type __n, const value_type& __x
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _debug.c | 127 _L_type* __pos = __prev->_M_next; local
129 while (__pos != 0) {
130 if (!(&__first == __STATIC_CAST(_Iterator*, __pos) || &__last == __STATIC_CAST(_Iterator*, __pos)) &&
131 stlp_in_range_aux(__STATIC_CAST(_Iterator*, __pos)->_M_iterator,
134 __pos->_M_owner = 0;
135 __prev->_M_next = __pos->_M_next;
138 __prev = __pos;
140 __pos = __prev->_M_next;
151 _L_type* __pos = __prev->_M_next local
179 _L_type* __pos = __src_prev->_M_next; local
224 _L_type* __pos = __prev->_M_next; local
520 _L_type* __pos = __prev->_M_next; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _slist.h | 220 iterator previous(const_iterator __pos)
221 { return iterator(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node); }
222 const_iterator previous(const_iterator __pos) const
223 { return const_iterator(const_cast<_Node_base*>(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node)); }
226 iterator insert_after(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type))
228 iterator insert_after(iterator __pos, const value_type& __x)
230 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node),
234 iterator insert_after(iterator __pos)
235 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node))._M_node);}
238 void insert_after(iterator __pos, size_type __n, const value_type& __x
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/debug/ |
| _debug.c | 127 _L_type* __pos = __prev->_M_next; local
129 while (__pos != 0) {
130 if (!(&__first == __STATIC_CAST(_Iterator*, __pos) || &__last == __STATIC_CAST(_Iterator*, __pos)) &&
131 stlp_in_range_aux(__STATIC_CAST(_Iterator*, __pos)->_M_iterator,
134 __pos->_M_owner = 0;
135 __prev->_M_next = __pos->_M_next;
138 __prev = __pos;
140 __pos = __prev->_M_next;
151 _L_type* __pos = __prev->_M_next local
179 _L_type* __pos = __src_prev->_M_next; local
224 _L_type* __pos = __prev->_M_next; local
520 _L_type* __pos = __prev->_M_next; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/pointers/ |
| _slist.h | 220 iterator previous(const_iterator __pos)
221 { return iterator(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node); }
222 const_iterator previous(const_iterator __pos) const
223 { return const_iterator(const_cast<_Node_base*>(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node)); }
226 iterator insert_after(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type))
228 iterator insert_after(iterator __pos, const value_type& __x)
230 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node),
234 iterator insert_after(iterator __pos)
235 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node))._M_node);}
238 void insert_after(iterator __pos, size_type __n, const value_type& __x
[all...] |
| /external/stlport/stlport/stl/ |
| _deque.c | 122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos,
127 if (__pos._M_cur == this->_M_start._M_cur) {
135 else if (__pos._M_cur == this->_M_finish._M_cur) {
144 _M_fill_insert_aux(__pos, __n, __x, _Movable());
150 void deque<_Tp, _Alloc>::insert(iterator __pos,
156 if (__pos._M_cur == this->_M_start._M_cur) {
164 else if (__pos._M_cur == this->_M_finish._M_cur) {
174 _M_insert_range_aux(__pos, __first, __last, __n, _Movable());
178 void deque<_Tp,_Alloc>::insert(iterator __pos,
184 if (__pos._M_cur == this->_M_start._M_cur)
[all...] |
| _bitset.h | 119 static size_t _STLP_CALL _S_whichword( size_t __pos ) {
120 return __pos / __BITS_PER_WORD;
122 static size_t _STLP_CALL _S_whichbyte( size_t __pos ) {
123 return (__pos % __BITS_PER_WORD) / CHAR_BIT;
125 static size_t _STLP_CALL _S_whichbit( size_t __pos ) {
126 return __pos % __BITS_PER_WORD;
128 static _WordT _STLP_CALL _S_maskbit( size_t __pos ) {
129 return __STATIC_CAST(_WordT,1) << _S_whichbit(__pos);
132 _WordT& _M_getword(size_t __pos) { return _M_w[_S_whichword(__pos)]; }
604 __result <<= __pos ; return __result; local
608 __result >>= __pos ; return __result; local
[all...] |
| _string_sum.h | 135 _BString& append(const _BString& __s, size_type __pos, size_type __n)
136 { return _M_get_storage().append(__s, __pos, __n); }
151 _BString& assign(const _BString& __s, size_type __pos, size_type __n) {return _M_get_storage().assign(__s, __pos, __n);}
157 _BString& insert(size_type __pos, const _BString& __s) {return _M_get_storage().insert(__pos, __s);}
158 _BString& insert(size_type __pos, const _BString& __s, size_type __beg, size_type __n)
159 {return _M_get_storage().insert(__pos, __s, __beg, __n);}
160 _BString& insert(size_type __pos, const _CharT* __s, size_type __n) {return _M_get_storage().insert(__pos, __s, __n);
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.c | 122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos,
127 if (__pos._M_cur == this->_M_start._M_cur) {
135 else if (__pos._M_cur == this->_M_finish._M_cur) {
144 _M_fill_insert_aux(__pos, __n, __x, _Movable());
150 void deque<_Tp, _Alloc>::insert(iterator __pos,
156 if (__pos._M_cur == this->_M_start._M_cur) {
164 else if (__pos._M_cur == this->_M_finish._M_cur) {
174 _M_insert_range_aux(__pos, __first, __last, __n, _Movable());
178 void deque<_Tp,_Alloc>::insert(iterator __pos,
184 if (__pos._M_cur == this->_M_start._M_cur)
[all...] |
| _bitset.h | 119 static size_t _STLP_CALL _S_whichword( size_t __pos ) {
120 return __pos / __BITS_PER_WORD;
122 static size_t _STLP_CALL _S_whichbyte( size_t __pos ) {
123 return (__pos % __BITS_PER_WORD) / CHAR_BIT;
125 static size_t _STLP_CALL _S_whichbit( size_t __pos ) {
126 return __pos % __BITS_PER_WORD;
128 static _WordT _STLP_CALL _S_maskbit( size_t __pos ) {
129 return __STATIC_CAST(_WordT,1) << _S_whichbit(__pos);
132 _WordT& _M_getword(size_t __pos) { return _M_w[_S_whichword(__pos)]; }
604 __result <<= __pos ; return __result; local
608 __result >>= __pos ; return __result; local
[all...] |
| _string_sum.h | 135 _BString& append(const _BString& __s, size_type __pos, size_type __n)
136 { return _M_get_storage().append(__s, __pos, __n); }
151 _BString& assign(const _BString& __s, size_type __pos, size_type __n) {return _M_get_storage().assign(__s, __pos, __n);}
157 _BString& insert(size_type __pos, const _BString& __s) {return _M_get_storage().insert(__pos, __s);}
158 _BString& insert(size_type __pos, const _BString& __s, size_type __beg, size_type __n)
159 {return _M_get_storage().insert(__pos, __s, __beg, __n);}
160 _BString& insert(size_type __pos, const _CharT* __s, size_type __n) {return _M_get_storage().insert(__pos, __s, __n);
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.c | 122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos,
127 if (__pos._M_cur == this->_M_start._M_cur) {
135 else if (__pos._M_cur == this->_M_finish._M_cur) {
144 _M_fill_insert_aux(__pos, __n, __x, _Movable());
150 void deque<_Tp, _Alloc>::insert(iterator __pos,
156 if (__pos._M_cur == this->_M_start._M_cur) {
164 else if (__pos._M_cur == this->_M_finish._M_cur) {
174 _M_insert_range_aux(__pos, __first, __last, __n, _Movable());
178 void deque<_Tp,_Alloc>::insert(iterator __pos,
184 if (__pos._M_cur == this->_M_start._M_cur)
[all...] |
| _bitset.h | 119 static size_t _STLP_CALL _S_whichword( size_t __pos ) {
120 return __pos / __BITS_PER_WORD;
122 static size_t _STLP_CALL _S_whichbyte( size_t __pos ) {
123 return (__pos % __BITS_PER_WORD) / CHAR_BIT;
125 static size_t _STLP_CALL _S_whichbit( size_t __pos ) {
126 return __pos % __BITS_PER_WORD;
128 static _WordT _STLP_CALL _S_maskbit( size_t __pos ) {
129 return __STATIC_CAST(_WordT,1) << _S_whichbit(__pos);
132 _WordT& _M_getword(size_t __pos) { return _M_w[_S_whichword(__pos)]; }
604 __result <<= __pos ; return __result; local
608 __result >>= __pos ; return __result; local
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.c | 122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos,
127 if (__pos._M_cur == this->_M_start._M_cur) {
135 else if (__pos._M_cur == this->_M_finish._M_cur) {
144 _M_fill_insert_aux(__pos, __n, __x, _Movable());
150 void deque<_Tp, _Alloc>::insert(iterator __pos,
156 if (__pos._M_cur == this->_M_start._M_cur) {
164 else if (__pos._M_cur == this->_M_finish._M_cur) {
174 _M_insert_range_aux(__pos, __first, __last, __n, _Movable());
178 void deque<_Tp,_Alloc>::insert(iterator __pos,
184 if (__pos._M_cur == this->_M_start._M_cur)
[all...] |
| _bitset.h | 119 static size_t _STLP_CALL _S_whichword( size_t __pos ) {
120 return __pos / __BITS_PER_WORD;
122 static size_t _STLP_CALL _S_whichbyte( size_t __pos ) {
123 return (__pos % __BITS_PER_WORD) / CHAR_BIT;
125 static size_t _STLP_CALL _S_whichbit( size_t __pos ) {
126 return __pos % __BITS_PER_WORD;
128 static _WordT _STLP_CALL _S_maskbit( size_t __pos ) {
129 return __STATIC_CAST(_WordT,1) << _S_whichbit(__pos);
132 _WordT& _M_getword(size_t __pos) { return _M_w[_S_whichword(__pos)]; }
604 __result <<= __pos ; return __result; local
608 __result >>= __pos ; return __result; local
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.c | 122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos,
127 if (__pos._M_cur == this->_M_start._M_cur) {
135 else if (__pos._M_cur == this->_M_finish._M_cur) {
144 _M_fill_insert_aux(__pos, __n, __x, _Movable());
150 void deque<_Tp, _Alloc>::insert(iterator __pos,
156 if (__pos._M_cur == this->_M_start._M_cur) {
164 else if (__pos._M_cur == this->_M_finish._M_cur) {
174 _M_insert_range_aux(__pos, __first, __last, __n, _Movable());
178 void deque<_Tp,_Alloc>::insert(iterator __pos,
184 if (__pos._M_cur == this->_M_start._M_cur)
[all...] |
| _bitset.h | 119 static size_t _STLP_CALL _S_whichword( size_t __pos ) {
120 return __pos / __BITS_PER_WORD;
122 static size_t _STLP_CALL _S_whichbyte( size_t __pos ) {
123 return (__pos % __BITS_PER_WORD) / CHAR_BIT;
125 static size_t _STLP_CALL _S_whichbit( size_t __pos ) {
126 return __pos % __BITS_PER_WORD;
128 static _WordT _STLP_CALL _S_maskbit( size_t __pos ) {
129 return __STATIC_CAST(_WordT,1) << _S_whichbit(__pos);
132 _WordT& _M_getword(size_t __pos) { return _M_w[_S_whichword(__pos)]; }
604 __result <<= __pos ; return __result; local
608 __result >>= __pos ; return __result; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.c | 122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos,
127 if (__pos._M_cur == this->_M_start._M_cur) {
135 else if (__pos._M_cur == this->_M_finish._M_cur) {
144 _M_fill_insert_aux(__pos, __n, __x, _Movable());
150 void deque<_Tp, _Alloc>::insert(iterator __pos,
156 if (__pos._M_cur == this->_M_start._M_cur) {
164 else if (__pos._M_cur == this->_M_finish._M_cur) {
174 _M_insert_range_aux(__pos, __first, __last, __n, _Movable());
178 void deque<_Tp,_Alloc>::insert(iterator __pos,
184 if (__pos._M_cur == this->_M_start._M_cur)
[all...] |
| _bitset.h | 119 static size_t _STLP_CALL _S_whichword( size_t __pos ) {
120 return __pos / __BITS_PER_WORD;
122 static size_t _STLP_CALL _S_whichbyte( size_t __pos ) {
123 return (__pos % __BITS_PER_WORD) / CHAR_BIT;
125 static size_t _STLP_CALL _S_whichbit( size_t __pos ) {
126 return __pos % __BITS_PER_WORD;
128 static _WordT _STLP_CALL _S_maskbit( size_t __pos ) {
129 return __STATIC_CAST(_WordT,1) << _S_whichbit(__pos);
132 _WordT& _M_getword(size_t __pos) { return _M_w[_S_whichword(__pos)]; }
604 __result <<= __pos ; return __result; local
608 __result >>= __pos ; return __result; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _deque.c | 122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos,
127 if (__pos._M_cur == this->_M_start._M_cur) {
135 else if (__pos._M_cur == this->_M_finish._M_cur) {
144 _M_fill_insert_aux(__pos, __n, __x, _Movable());
150 void deque<_Tp, _Alloc>::insert(iterator __pos,
156 if (__pos._M_cur == this->_M_start._M_cur) {
164 else if (__pos._M_cur == this->_M_finish._M_cur) {
174 _M_insert_range_aux(__pos, __first, __last, __n, _Movable());
178 void deque<_Tp,_Alloc>::insert(iterator __pos,
184 if (__pos._M_cur == this->_M_start._M_cur)
[all...] |
| _bitset.h | 119 static size_t _STLP_CALL _S_whichword( size_t __pos ) {
120 return __pos / __BITS_PER_WORD;
122 static size_t _STLP_CALL _S_whichbyte( size_t __pos ) {
123 return (__pos % __BITS_PER_WORD) / CHAR_BIT;
125 static size_t _STLP_CALL _S_whichbit( size_t __pos ) {
126 return __pos % __BITS_PER_WORD;
128 static _WordT _STLP_CALL _S_maskbit( size_t __pos ) {
129 return __STATIC_CAST(_WordT,1) << _S_whichbit(__pos);
132 _WordT& _M_getword(size_t __pos) { return _M_w[_S_whichword(__pos)]; }
604 __result <<= __pos ; return __result; local
608 __result >>= __pos ; return __result; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| losertree.h | 136 unsigned int __pos = _M_k + __source; local
146 _M_losers[__pos]._M_key = __key;
148 _M_losers[__pos]._M_sup = __sup;
149 _M_losers[__pos]._M_source = __source;
231 for (unsigned int __pos = (_M_k + __source) / 2; __pos > 0;
232 __pos /= 2)
235 if ((__sup && (!_M_losers[__pos]._M_sup
236 || _M_losers[__pos]._M_source < __source))
237 || (!__sup && !_M_losers[__pos]._M_su
395 unsigned int __pos = _M_k + __source; local
633 unsigned int __pos = _M_k + __source; local
878 unsigned int __pos = _M_k + __source; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| losertree.h | 136 unsigned int __pos = _M_k + __source; local
146 _M_losers[__pos]._M_key = __key;
148 _M_losers[__pos]._M_sup = __sup;
149 _M_losers[__pos]._M_source = __source;
231 for (unsigned int __pos = (_M_k + __source) / 2; __pos > 0;
232 __pos /= 2)
235 if ((__sup && (!_M_losers[__pos]._M_sup
236 || _M_losers[__pos]._M_source < __source))
237 || (!__sup && !_M_losers[__pos]._M_su
395 unsigned int __pos = _M_k + __source; local
633 unsigned int __pos = _M_k + __source; local
878 unsigned int __pos = _M_k + __source; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| losertree.h | 136 unsigned int __pos = _M_k + __source; local
146 _M_losers[__pos]._M_key = __key;
148 _M_losers[__pos]._M_sup = __sup;
149 _M_losers[__pos]._M_source = __source;
231 for (unsigned int __pos = (_M_k + __source) / 2; __pos > 0;
232 __pos /= 2)
235 if ((__sup && (!_M_losers[__pos]._M_sup
236 || _M_losers[__pos]._M_source < __source))
237 || (!__sup && !_M_losers[__pos]._M_su
395 unsigned int __pos = _M_k + __source; local
633 unsigned int __pos = _M_k + __source; local
878 unsigned int __pos = _M_k + __source; local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| losertree.h | 136 unsigned int __pos = _M_k + __source; local
146 _M_losers[__pos]._M_key = __key;
148 _M_losers[__pos]._M_sup = __sup;
149 _M_losers[__pos]._M_source = __source;
231 for (unsigned int __pos = (_M_k + __source) / 2; __pos > 0;
232 __pos /= 2)
235 if ((__sup && (!_M_losers[__pos]._M_sup
236 || _M_losers[__pos]._M_source < __source))
237 || (!__sup && !_M_losers[__pos]._M_su
395 unsigned int __pos = _M_k + __source; local
633 unsigned int __pos = _M_k + __source; local
878 unsigned int __pos = _M_k + __source; local
[all...] |
