| /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...] |
| _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...] |
| /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...] |
| /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...] |
| _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...] |
| /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...] |
| _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...] |
| /external/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...] |
| /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...] |
| /prebuilt/ndk/android-ndk-r5/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...] |
| /prebuilt/ndk/android-ndk-r6/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...] |
| /external/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...] |
