/ndk/tests/device/test-gnustl-full/unit/ |
bitset_test.cpp | 53 size_t __pos = b2._Find_first(); local 54 CPPUNIT_ASSERT( __pos == 0 ); 55 __pos = b2._Find_next(__pos); 56 CPPUNIT_ASSERT( __pos == 4 ); 57 __pos = b2._Find_next(__pos); 58 CPPUNIT_ASSERT( __pos == 8 ); 59 __pos = b2._Find_next(__pos); [all...] |
/ndk/tests/device/test-stlport/unit/ |
bitset_test.cpp | 53 size_t __pos = b2._Find_first(); local 54 CPPUNIT_ASSERT( __pos == 0 ); 55 __pos = b2._Find_next(__pos); 56 CPPUNIT_ASSERT( __pos == 4 ); 57 __pos = b2._Find_next(__pos); 58 CPPUNIT_ASSERT( __pos == 8 ); 59 __pos = b2._Find_next(__pos); [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
_string_sum_methods.h | 30 size_type __pos, size_type __n = npos, 32 : _STLP_STRING_SUM_BASE(_Reserve_t(), (__pos <= __s.size()) ? ((min) (__n, __s.size() - __pos)) : 0, __a) { 34 if (__pos > __size) 37 _M_append_sum_pos(__s, __pos, (min) (__n, __size - __pos)); 59 _CharT* _M_append_fast_pos(_STLP_PRIV __char_wrapper<_CharT> __c, _CharT *__buf, size_type /*__pos*/, size_type __n) { 66 size_type __pos, size_type __n) 67 { return uninitialized_copy(__s + __pos, __s + __pos + (min)(__n, __s_size - __pos), __buf); [all...] |
_slist_base.c | 48 _Sl_global<_Dummy>::__splice_after(_Slist_node_base* __pos, _Slist_node_base* __head) { 51 _Slist_node_base* __after = __pos->_M_next; 52 __pos->_M_next = __head->_M_next; 60 _Sl_global<_Dummy>::__splice_after(_Slist_node_base* __pos, 63 if (__pos != __before_first && __pos != __before_last) { 65 _Slist_node_base* __after = __pos->_M_next; 67 __pos->_M_next = __first;
|
_slist.h | 173 _Slist_node_base* _M_erase_after(_Slist_node_base* __pos) { 174 _Node* __next = __STATIC_CAST(_Node*, __pos->_M_next); 176 __pos->_M_next = __next_next; 458 iterator previous(const_iterator __pos) { 459 return iterator(_STLP_PRIV _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node)); 461 const_iterator previous(const_iterator __pos) const { 464 __pos._M_node))); 469 _Node* _M_insert_after(_Node_base* __pos, const value_type& __x = _Tp()) { 471 _Node* _M_insert_after(_Node_base* __pos, const value_type& __x) { 473 return __STATIC_CAST(_Node*, _STLP_PRIV __slist_make_link(__pos, _M_create_node(__x))) [all...] |
_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/current/sources/cxx-stl/stlport/stlport/stl/ |
_string_sum_methods.h | 30 size_type __pos, size_type __n = npos, 32 : _STLP_STRING_SUM_BASE(_Reserve_t(), (__pos <= __s.size()) ? ((min) (__n, __s.size() - __pos)) : 0, __a) { 34 if (__pos > __size) 37 _M_append_sum_pos(__s, __pos, (min) (__n, __size - __pos)); 59 _CharT* _M_append_fast_pos(_STLP_PRIV __char_wrapper<_CharT> __c, _CharT *__buf, size_type /*__pos*/, size_type __n) { 66 size_type __pos, size_type __n) 67 { return uninitialized_copy(__s + __pos, __s + __pos + (min)(__n, __s_size - __pos), __buf); [all...] |
_slist_base.c | 48 _Sl_global<_Dummy>::__splice_after(_Slist_node_base* __pos, _Slist_node_base* __head) { 51 _Slist_node_base* __after = __pos->_M_next; 52 __pos->_M_next = __head->_M_next; 60 _Sl_global<_Dummy>::__splice_after(_Slist_node_base* __pos, 63 if (__pos != __before_first && __pos != __before_last) { 65 _Slist_node_base* __after = __pos->_M_next; 67 __pos->_M_next = __first;
|
_slist.h | 173 _Slist_node_base* _M_erase_after(_Slist_node_base* __pos) { 174 _Node* __next = __STATIC_CAST(_Node*, __pos->_M_next); 176 __pos->_M_next = __next_next; 458 iterator previous(const_iterator __pos) { 459 return iterator(_STLP_PRIV _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node)); 461 const_iterator previous(const_iterator __pos) const { 464 __pos._M_node))); 469 _Node* _M_insert_after(_Node_base* __pos, const value_type& __x = _Tp()) { 471 _Node* _M_insert_after(_Node_base* __pos, const value_type& __x) { 473 return __STATIC_CAST(_Node*, _STLP_PRIV __slist_make_link(__pos, _M_create_node(__x))) [all...] |
_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...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
_string_sum_methods.h | 30 size_type __pos, size_type __n = npos, 32 : _M_non_dbg_impl(_Reserve_t(), (__pos <= __s.size()) ? ((min) (__n, __s.size() - __pos)) : 0, __a), 35 if (__pos > __size) 39 _M_append_sum_pos(__s, __pos, (min) (__n, __size - __pos), _M_non_dbg_impl); 59 _Base& _M_append_fast_pos(_STLP_PRIV __char_wrapper<_CharT> __c, _Base &__str, size_type /*__pos*/, size_type __n) { 65 size_type __pos, size_type __n) 66 { return __str.append(__s + __pos, __s + __pos + (min)(__n, __s_size - __pos)); [all...] |
_slist.h | 224 iterator previous(const_iterator __pos) { 225 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos)) 226 _STLP_VERBOSE_ASSERT(!(__pos._M_iterator == _M_non_dbg_impl.before_begin()), _StlMsg_INVALID_ARGUMENT) 227 return iterator(&_M_iter_list, _M_non_dbg_impl.previous(__pos._M_iterator)); 229 const_iterator previous(const_iterator __pos) const { 230 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos)) 231 _STLP_VERBOSE_ASSERT(!(__pos._M_iterator == _M_non_dbg_impl.before_begin()), _StlMsg_INVALID_ARGUMENT) 232 return const_iterator(&_M_iter_list, _M_non_dbg_impl.previous(__pos._M_iterator)); 238 iterator insert_after(iterator __pos, const value_type& __x = _Tp()) { 240 iterator insert_after(iterator __pos, const value_type& __x) [all...] |
_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/current/sources/cxx-stl/stlport/stlport/stl/debug/ |
_string_sum_methods.h | 30 size_type __pos, size_type __n = npos, 32 : _M_non_dbg_impl(_Reserve_t(), (__pos <= __s.size()) ? ((min) (__n, __s.size() - __pos)) : 0, __a), 35 if (__pos > __size) 39 _M_append_sum_pos(__s, __pos, (min) (__n, __size - __pos), _M_non_dbg_impl); 59 _Base& _M_append_fast_pos(_STLP_PRIV __char_wrapper<_CharT> __c, _Base &__str, size_type /*__pos*/, size_type __n) { 65 size_type __pos, size_type __n) 66 { return __str.append(__s + __pos, __s + __pos + (min)(__n, __s_size - __pos)); [all...] |
_slist.h | 224 iterator previous(const_iterator __pos) { 225 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos)) 226 _STLP_VERBOSE_ASSERT(!(__pos._M_iterator == _M_non_dbg_impl.before_begin()), _StlMsg_INVALID_ARGUMENT) 227 return iterator(&_M_iter_list, _M_non_dbg_impl.previous(__pos._M_iterator)); 229 const_iterator previous(const_iterator __pos) const { 230 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos)) 231 _STLP_VERBOSE_ASSERT(!(__pos._M_iterator == _M_non_dbg_impl.before_begin()), _StlMsg_INVALID_ARGUMENT) 232 return const_iterator(&_M_iter_list, _M_non_dbg_impl.previous(__pos._M_iterator)); 238 iterator insert_after(iterator __pos, const value_type& __x = _Tp()) { 240 iterator insert_after(iterator __pos, const value_type& __x) [all...] |
_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...] |
/external/mesa3d/src/gallium/auxiliary/rbug/ |
rbug_internal.h | 66 PAD(__pos, size); \ 67 *((type *)(&__data[__pos])) = name; \ 68 __pos += size; \ 74 PAD(__pos, size); \ 75 memcpy(&__data[__pos], name, size * name##_len); \ 76 __pos += size * name##_len; \
|
/prebuilts/misc/common/swig/include/2.0.11/std/ |
std_basic_string.i | 70 append(const basic_string& __str, size_type __pos, size_type __n); 82 assign(const basic_string& __str, size_type __pos, size_type __n); 95 insert(size_type __pos, const _CharT* __s, size_type __n); 98 insert(size_type __pos, size_type __n, _CharT __c); 101 erase(size_type __pos = 0, size_type __n = npos); 104 replace(size_type __pos, size_type __n, const basic_string& __str); 111 replace(size_type __pos, size_type __n1, const _CharT* __s, 115 replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c); 119 copy(_CharT* __s, size_type __n, size_type __pos = 0) const; 125 find(const _CharT* __s, size_type __pos, size_type __n) const [all...] |
/ndk/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/current/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/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-linux-glibc2.15-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/current/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...] |