/external/stlport/stlport/stl/debug/ |
_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...] |
_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...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
_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...] |
_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...] |
/prebuilt/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/debug/ |
_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...] |
_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...] |
/prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/debug/ |
_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...] |
_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...] |
/external/stlport/test/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-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...] |
/external/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...] |
_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...] |
_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...] |
_string.h | 183 basic_string(const _Self& __s, size_type __pos, size_type __n = npos, 186 basic_string(const _Self& __s, size_type __pos) 188 if (__pos > __s.size()) 191 _M_range_initialize(__s._M_Start() + __pos, __s._M_Finish()); 193 basic_string(const _Self& __s, size_type __pos, size_type __n) 195 if (__pos > __s.size()) 198 _M_range_initialize(__s._M_Start() + __pos, 199 __s._M_Start() + __pos + (min) (__n, __s.size() - __pos)); 201 basic_string(const _Self& __s, size_type __pos, size_type __n [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...] |
_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...] |
_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...] |
_string.h | 183 basic_string(const _Self& __s, size_type __pos, size_type __n = npos, 186 basic_string(const _Self& __s, size_type __pos) 188 if (__pos > __s.size()) 191 _M_range_initialize(__s._M_Start() + __pos, __s._M_Finish()); 193 basic_string(const _Self& __s, size_type __pos, size_type __n) 195 if (__pos > __s.size()) 198 _M_range_initialize(__s._M_Start() + __pos, 199 __s._M_Start() + __pos + (min) (__n, __s.size() - __pos)); 201 basic_string(const _Self& __s, size_type __pos, size_type __n [all...] |
/prebuilt/ndk/android-ndk-r5/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...] |
_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...] |
_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...] |
/prebuilt/ndk/android-ndk-r6/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...] |
_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...] |
_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...] |