/external/stlport/stlport/stl/pointers/ |
D | _slist.h | 220 iterator previous(const_iterator __pos) in previous() 222 const_iterator previous(const_iterator __pos) const in previous() 234 iterator insert_after(iterator __pos) in insert_after() 238 void insert_after(iterator __pos, size_type __n, const value_type& __x) in insert_after() 245 void _M_insert_after_dispatch(iterator __pos, _Integer __n, _Integer __val, in _M_insert_after_dispatch() 251 void _M_insert_after_dispatch(iterator __pos, in _M_insert_after_dispatch() 263 void insert_after(iterator __pos, _InputIterator __first, _InputIterator __last) { in insert_after() 274 void insert_after(iterator __pos, in insert_after() 278 void insert_after(iterator __pos, in insert_after() 295 iterator insert(iterator __pos) in insert() [all …]
|
D | _list.h | 191 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, in _M_insert_dispatch() 196 void _M_insert_dispatch(iterator __pos, in _M_insert_dispatch() 208 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { in insert() 218 void insert(iterator __pos, const value_type *__first, const value_type *__last) in insert() 221 void insert(iterator __pos, const_iterator __first, const_iterator __last) in insert() 225 void insert(iterator __pos, size_type __n, const value_type& __x) in insert() 232 iterator insert(iterator __pos) { return iterator(_M_impl.insert(__pos._M_node)._M_node); } in insert() 237 iterator erase(iterator __pos) in erase() 293 void splice(iterator __pos, _Self& __x) in splice() 295 void splice(iterator __pos, _Self& __x, iterator __i) in splice() [all …]
|
D | _vector.h | 185 iterator insert(iterator __pos) in insert() 196 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) in insert() 199 void insert(iterator __pos, const_iterator __first, const_iterator __last) { in insert() 205 void insert (iterator __pos, size_type __n, const value_type& __x) { in insert() 210 iterator erase(iterator __pos) in erase()
|
/external/stlport/stlport/stl/debug/ |
D | _slist.h | 224 iterator previous(const_iterator __pos) { in previous() 229 const_iterator previous(const_iterator __pos) const { in previous() 248 iterator insert_after(iterator __pos) { in insert_after() 253 void insert_after(iterator __pos, size_type __n, const value_type& __x) { in insert_after() 281 void insert_after(iterator __pos, _InIter __first, _InIter __last) { in insert_after() 290 void insert(iterator __pos, _InIter __first, _InIter __last) { in insert() 298 void insert_after(iterator __pos, in insert_after() 305 void insert_after(iterator __pos, in insert_after() 313 void insert(iterator __pos, const_iterator __first, const_iterator __last) { in insert() 319 void insert(iterator __pos, const value_type* __first, in insert() [all …]
|
D | _string.h | 280 _Self& append(const _Self& __s, size_type __pos, size_type __n) { in append() 330 _Self& assign(const _Self& __s, size_type __pos, size_type __n) { in assign() 389 _Self& insert(size_type __pos, const _Self& __s) { in insert() 396 _Self& insert(size_type __pos, const _Self& __s, in insert() 404 _Self& insert(size_type __pos, const _CharT* __s, size_type __n) { in insert() 413 _Self& insert(size_type __pos, const _CharT* __s) { in insert() 419 _Self& insert(size_type __pos, size_type __n, _CharT __c) { in insert() 498 iterator erase(iterator __pos) { in erase() 515 _Self& replace(size_type __pos, size_type __n, const _Self& __s) { in replace() 530 _Self& replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) { in replace() [all …]
|
D | _list.h | 215 iterator insert(iterator __pos) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); } in insert() 220 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { in insert() 229 void insert(iterator __pos, const _Tp* __first, const _Tp* __last) { in insert() 237 void insert(iterator __pos, in insert() 246 void insert(iterator __pos, in insert() 257 void insert(iterator __pos, size_type __n, const _Tp& __x) { in insert() 276 iterator erase(iterator __pos) { in erase() 358 void splice(iterator __pos, _Self& __x) { in splice() 371 void splice(iterator __pos, _Self& __x, iterator __i) { in splice() 385 void splice(iterator __pos, _Self& __x, iterator __first, iterator __last) { in splice()
|
D | _deque.h | 296 iterator insert(iterator __pos) { in insert() 303 void insert(iterator __pos, size_type __n, const value_type& __x) { in insert() 311 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { in insert() 323 void insert(iterator __pos, in insert() 333 void insert(iterator __pos, in insert() 343 void insert(iterator __pos, in insert() 373 iterator erase(iterator __pos) { in erase()
|
D | _string_sum_methods.h | 65 size_type __pos, size_type __n) in _M_append_fast_pos() 68 size_type __pos, size_type __n) in _M_append_fast_pos() 71 size_type __pos, size_type __n) in _M_append_fast_pos() 73 _Base& _M_append_fast_pos(_Self const& __s, _Base &__str, size_type __pos, size_type __n) in _M_append_fast_pos() 81 _Base &__str, size_type __pos, size_type __n) { in _M_append_fast_pos() 107 size_type __pos, size_type __n, _Base &__impl) { in _M_append_sum_pos()
|
D | _debug.c | 127 _L_type* __pos = __prev->_M_next; in __invalidate_range() local 151 _L_type* __pos = __prev->_M_next; in __invalidate_iterator() local 179 _L_type* __pos = __src_prev->_M_next; in __change_range_owner() local 224 _L_type* __pos = __prev->_M_next; in __change_ite_owner() local 464 for (__owned_link* __pos = (__owned_link*)__l->_M_node._M_next; in _Stamp_all() local 478 for (__owned_link* __pos = (__owned_link*)__l->_M_node._M_next; in _Verify() local 520 _L_type* __pos = __prev->_M_next; in _Set_owner() local
|
D | _tree.h | 230 iterator insert_unique(iterator __pos, const value_type& __x) { in insert_unique() 234 iterator insert_equal(iterator __pos, const value_type& __x) { in insert_equal() 269 void erase(iterator __pos) { in erase()
|
/external/stlport/stlport/stl/ |
D | _vector.c | 81 void vector<_Tp, _Alloc>::_M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type&… in _M_insert_overflow_aux() 108 void vector<_Tp, _Alloc>::_M_insert_overflow(pointer __pos, const _Tp& __x, const __true_type& /*_T… in _M_insert_overflow() 122 void vector<_Tp, _Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, in _M_fill_insert_aux() 140 void vector<_Tp, _Alloc>::_M_fill_insert_aux (iterator __pos, size_type __n, in _M_fill_insert_aux() 166 void vector<_Tp, _Alloc>::_M_fill_insert(iterator __pos, in _M_fill_insert() 223 vector<_Tp, _Alloc>::insert(iterator __pos, const _Tp& __x) { in insert()
|
D | _string_sum.h | 135 _BString& append(const _BString& __s, size_type __pos, size_type __n) in append() 151 …_BString& assign(const _BString& __s, size_type __pos, size_type __n) {return _M_get_storage().ass… in assign() 157 …_BString& insert(size_type __pos, const _BString& __s) {return _M_get_storage().insert(__pos, __s)… in insert() 158 _BString& insert(size_type __pos, const _BString& __s, size_type __beg, size_type __n) in insert() 160 …_BString& insert(size_type __pos, const _CharT* __s, size_type __n) {return _M_get_storage().inser… in insert() 161 _BString& insert(size_type __pos, const _CharT* __s) {return _M_get_storage().insert(__pos, __s);} in insert() 162 …_BString& insert(size_type __pos, size_type __n, _CharT __c) {return _M_get_storage().insert(__pos… in insert() 168 _BString& replace(size_type __pos, size_type __n, const _BString& __s) in replace() 172 _BString& replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) in replace() 174 _BString& replace(size_type __pos, size_type __n1, const _CharT* __s) in replace() [all …]
|
D | _string_workaround.h | 60 : _STLP_NO_MEM_T_STRING_BASE(__s, __pos, __n, __a) {} in _STLP_NO_MEM_T_STRING_BASE() argument 168 size_type __pos, size_type __n) { in append() 254 size_type __pos, size_type __n) { in assign() 319 _Self& insert(size_type __pos, const _Self& __s) { in insert() 324 _Self& insert(size_type __pos, const _Self& __s, in insert() 329 _Self& insert(size_type __pos, const _CharT* __s, size_type __n) { in insert() 335 _Self& insert(size_type __pos, const _CharT* __s) { in insert() 341 _Self& insert(size_type __pos, size_type __n, _CharT __c) { in insert() 375 void _M_insert_overflow(iterator __pos, _ForwardIter __first, _ForwardIter __last, in _M_insert_overflow() 397 void _M_insertT(iterator __pos, _ForwardIter __first, _ForwardIter __last, in _M_insertT() [all …]
|
D | _deque.c | 122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos, in _M_fill_insert() 150 void deque<_Tp, _Alloc>::insert(iterator __pos, in insert() 178 void deque<_Tp,_Alloc>::insert(iterator __pos, in insert() 208 __iterator__ deque<_Tp,_Alloc>::_M_erase(iterator __pos, in _M_erase() 243 __iterator__ deque<_Tp,_Alloc>::_M_erase(iterator __pos, in _M_erase() 464 __iterator__ deque<_Tp,_Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, in _M_fill_insert_aux() 506 __iterator__ deque<_Tp,_Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, in _M_fill_insert_aux() 562 void deque<_Tp,_Alloc>::_M_insert_range_aux(iterator __pos, in _M_insert_range_aux() 601 void deque<_Tp,_Alloc>::_M_insert_range_aux(iterator __pos, in _M_insert_range_aux() 654 void deque<_Tp,_Alloc>::_M_insert_range_aux(iterator __pos, in _M_insert_range_aux() [all …]
|
D | _string_sum_methods.h | 66 size_type __pos, size_type __n) in _M_append_fast_pos() 69 size_type __pos, size_type __n) in _M_append_fast_pos() 72 size_type __pos, size_type __n) in _M_append_fast_pos() 75 size_type __pos, size_type __n) in _M_append_fast_pos() 83 _CharT *__buf, size_type __pos, size_type __n) { in _M_append_fast_pos() 125 size_type __pos, size_type __n) { in _M_append_sum_pos() 149 size_type __pos, size_type __n) { in _M_append_sum_no_overflow()
|
D | _string.c | 280 void basic_string<_CharT,_Traits,_Alloc>::insert(iterator __pos, in insert() 314 void basic_string<_CharT,_Traits,_Alloc>::_M_insert(iterator __pos, in _M_insert() 420 __size_type__ basic_string<_CharT,_Traits,_Alloc>::find( const _CharT* __s, size_type __pos, in find() 438 __size_type__ basic_string<_CharT,_Traits,_Alloc>::find(_CharT __c, size_type __pos) const in find() 451 __size_type__ basic_string<_CharT,_Traits,_Alloc>::rfind(const _CharT* __s, size_type __pos, in rfind() 468 __size_type__ basic_string<_CharT,_Traits,_Alloc>::rfind(_CharT __c, size_type __pos) const in rfind() 482 basic_string<_CharT,_Traits,_Alloc> ::find_first_of(const _CharT* __s, size_type __pos, in find_first_of() 496 basic_string<_CharT,_Traits,_Alloc> ::find_last_of(const _CharT* __s, size_type __pos, in find_last_of() 513 basic_string<_CharT,_Traits,_Alloc> ::find_first_not_of(const _CharT* __s, size_type __pos, in find_first_not_of() 528 basic_string<_CharT,_Traits,_Alloc> ::find_first_not_of(_CharT __c, size_type __pos) const { in find_first_not_of() [all …]
|
D | _slist_base.c | 48 _Sl_global<_Dummy>::__splice_after(_Slist_node_base* __pos, _Slist_node_base* __head) { in __splice_after() 60 _Sl_global<_Dummy>::__splice_after(_Slist_node_base* __pos, in __splice_after()
|
D | _string.h | 186 basic_string(const _Self& __s, size_type __pos) in basic_string() 193 basic_string(const _Self& __s, size_type __pos, size_type __n) in basic_string() 201 basic_string(const _Self& __s, size_type __pos, size_type __n, in basic_string() 520 size_type __pos, size_type __n) { in append() 552 size_type __pos, size_type __n) { in assign() 608 _Self& insert(size_type __pos, const _Self& __s) { in insert() 617 _Self& insert(size_type __pos, const _Self& __s, in insert() 628 _Self& insert(size_type __pos, const _CharT* __s, size_type __n) { in insert() 638 _Self& insert(size_type __pos, const _CharT* __s) { in insert() 649 _Self& insert(size_type __pos, size_type __n, _CharT __c) { in insert() [all …]
|
D | _fstream.c | 139 streamoff __pos = _M_base._M_seek(0, ios_base::cur); in showmanyc() local 384 basic_filebuf<_CharT, _Traits>::seekpos(pos_type __pos, in seekpos()
|
D | _hashtable.c | 80 _Stl_prime<_Dummy>::_S_prev_sizes(size_t __n, size_t const*&__begin, size_t const*&__pos) { in _S_prev_sizes() 187 _ElemsIte __pos = _M_before_begin(__prev)._M_ite; in _M_insert_noresize() local
|
D | _ostream.h | 147 _Self& seekp(pos_type __pos) { in seekp()
|
D | _rope.c | 59 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>* __r, size_t __pos) in _Rope_iterator() 64 _Rope_iterator<_CharT, _Alloc>::_Rope_iterator(rope<_CharT,_Alloc>& __r, size_t __pos): in _Rope_iterator() 94 size_t __pos = __x._M_current_pos; in _S_setbuf() local 142 size_t __pos = __x._M_current_pos; in _S_setcache() local
|
D | _sstream.c | 358 ::seekpos(pos_type __pos, ios_base::openmode __mode) { in seekpos()
|
D | char_traits.h | 89 fpos(streamoff __pos) : _M_pos(__pos), _M_st(_STLP_NULL_CHAR_INIT(_StateT)) {} in fpos()
|
/external/stlport/test/unit/ |
D | bitset_test.cpp | 53 size_t __pos = b2._Find_first(); in bitset1() local
|