Searched refs:__pos (Results 1 - 25 of 46) sorted by relevance

12

/external/stlport/test/unit/
H A Dbitset_test.cpp53 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/debug/
H A D_string_sum_methods.h30 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
29 basic_string(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, size_type __pos, size_type __n = npos, const allocator_type& __a = allocator_type()) argument
64 _M_append_fast_pos(_CharT const* __s, size_type __s_size, _Base &__str, size_type __pos, size_type __n) argument
67 _M_append_fast_pos(_STLP_PRIV __cstr_wrapper<_CharT> const& __s, _Base &__str, size_type __pos, size_type __n) argument
70 _M_append_fast_pos(_STLP_PRIV __bstr_wrapper<_CharT, _Traits, _Alloc> __s, _Base &__str, size_type __pos, size_type __n) argument
73 _M_append_fast_pos(_Self const& __s, _Base &__str, size_type __pos, size_type __n) argument
80 _M_append_fast_pos(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, _Base &__str, size_type __pos, size_type __n) argument
106 _M_append_sum_pos(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, size_type __pos, size_type __n, _Base &__impl) argument
[all...]
H A D_slist.h224 iterator previous(const_iterator __pos) { argument
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()) { argument
240 iterator insert_after(iterator __pos, cons
248 insert_after(iterator __pos) argument
253 insert_after(iterator __pos, size_type __n, const value_type& __x) argument
281 insert_after(iterator __pos, _InIter __first, _InIter __last) argument
290 insert(iterator __pos, _InIter __first, _InIter __last) argument
298 insert_after(iterator __pos, const_iterator __first, const_iterator __last) argument
305 insert_after(iterator __pos, const value_type* __first, const value_type* __last) argument
313 insert(iterator __pos, const_iterator __first, const_iterator __last) argument
319 insert(iterator __pos, const value_type* __first, const value_type* __last) argument
329 insert(iterator __pos, const value_type& __x = _Tp()) argument
339 insert(iterator __pos) argument
344 insert(iterator __pos, size_type __n, const value_type& __x) argument
351 erase_after(iterator __pos) argument
368 erase(iterator __pos) argument
402 splice_after(iterator __pos, _Self& __x) argument
417 splice_after(iterator __pos, _Self& __x, iterator __prev) argument
434 splice_after(iterator __pos, _Self& __x, iterator __before_first, iterator __before_last) argument
454 splice(iterator __pos, _Self& __x) argument
467 splice(iterator __pos, _Self& __x, iterator __i) argument
484 splice(iterator __pos, _Self& __x, iterator __first, iterator __last) argument
[all...]
H A D_debug.c127 _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 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...]
H A D_string.h101 basic_string(const _Self& __s, size_type __pos, size_type __n = npos, argument
103 : _M_non_dbg_impl(__s._M_non_dbg_impl, __pos, __n, __a),
280 _Self& append(const _Self& __s, size_type __pos, size_type __n) { argument
282 _M_non_dbg_impl.append(__s._M_non_dbg_impl, __pos, __n);
330 _Self& assign(const _Self& __s, size_type __pos, size_type __n) { argument
331 if (__pos < __s.size()) {
334 _M_non_dbg_impl.assign(__s._M_non_dbg_impl, __pos, __n);
389 _Self& insert(size_type __pos, const _Self& __s) { argument
391 _M_non_dbg_impl.insert(__pos, __s._M_non_dbg_impl);
396 _Self& insert(size_type __pos, cons argument
404 insert(size_type __pos, const _CharT* __s, size_type __n) argument
413 insert(size_type __pos, const _CharT* __s) argument
419 insert(size_type __pos, size_type __n, _CharT __c) argument
498 erase(iterator __pos) argument
515 replace(size_type __pos, size_type __n, const _Self& __s) argument
530 replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) argument
539 replace(size_type __pos, size_type __n1, const _CharT* __s) argument
548 replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) argument
653 compare(size_type __pos, size_type __n, const _Self& __s) const argument
662 compare(size_type __pos, size_type __n, const _CharT* __s) const argument
700 find(const _CharT* __s, size_type __pos, size_type __n) const argument
718 rfind(const _CharT* __s, size_type __pos, size_type __n) const argument
734 find_first_of(const _CharT* __s, size_type __pos, size_type __n) const argument
750 find_last_of(const _CharT* __s, size_type __pos, size_type __n) const argument
766 find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const argument
782 find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const argument
[all...]
H A D_deque.h286 iterator insert(iterator __pos, const value_type& __x = _Tp()) {
288 iterator insert(iterator __pos, const value_type& __x) {
290 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos))
292 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator, __x));
296 iterator insert(iterator __pos) {
297 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos))
299 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator));
303 void insert(iterator __pos, size_type __n, const value_type& __x) {
304 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos))
306 _M_non_dbg_impl.insert(__pos
[all...]
H A D_vector.h274 iterator insert(iterator __pos, const _Tp& __x = _Tp()) {
276 iterator insert(iterator __pos, const _Tp& __x) {
278 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos))
280 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator, __x));
284 iterator insert(iterator __pos)
285 { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
291 void insert(iterator __pos,
294 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos))
296 _M_non_dbg_impl.insert(__pos._M_iterator,
302 void insert (iterator __pos,
[all...]
H A D_list.h206 iterator insert(iterator __pos, const _Tp& __x = _Tp()) { argument
208 iterator insert(iterator __pos, const _Tp& __x) {
210 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__pos))
211 return iterator(&_M_iter_list,_M_non_dbg_impl.insert(__pos._M_iterator, __x) );
215 iterator insert(iterator __pos) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); } argument
220 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { argument
221 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos))
223 _M_non_dbg_impl.insert(__pos._M_iterator,
229 void insert(iterator __pos, cons argument
237 insert(iterator __pos, const_iterator __first, const_iterator __last) argument
246 insert(iterator __pos, iterator __first, iterator __last) argument
257 insert(iterator __pos, size_type __n, const _Tp& __x) argument
276 erase(iterator __pos) argument
358 splice(iterator __pos, _Self& __x) argument
371 splice(iterator __pos, _Self& __x, iterator __i) argument
385 splice(iterator __pos, _Self& __x, iterator __first, iterator __last) argument
[all...]
/external/stlport/stlport/stl/
H A D_slist_base.c48 _Sl_global<_Dummy>::__splice_after(_Slist_node_base* __pos, _Slist_node_base* __head) { argument
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, argument
63 if (__pos != __before_first && __pos != __before_last) {
65 _Slist_node_base* __after = __pos->_M_next;
67 __pos->_M_next = __first;
H A D_string_sum_methods.h30 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
29 basic_string(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, size_type __pos, size_type __n = npos, const allocator_type& __a = allocator_type()) argument
65 _M_append_fast_pos(_CharT const* __s, size_type __s_size, _CharT *__buf, size_type __pos, size_type __n) argument
68 _M_append_fast_pos(_STLP_PRIV __cstr_wrapper<_CharT> const& __s, _CharT *__buf, size_type __pos, size_type __n) argument
71 _M_append_fast_pos(_STLP_PRIV __bstr_wrapper<_CharT, _Traits, _Alloc> __s, _CharT *__buf, size_type __pos, size_type __n) argument
74 _M_append_fast_pos(_Self const& __s, _CharT *__buf, size_type __pos, size_type __n) argument
82 _M_append_fast_pos(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, _CharT *__buf, size_type __pos, size_type __n) argument
124 _M_append_sum_pos(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, size_type __pos, size_type __n) argument
148 _M_append_sum_no_overflow(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, size_type __pos, size_type __n) argument
[all...]
H A D_bitset.h119 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)]; } argument
430 bitset(const basic_string<_CharT, _Traits, _Alloc>& __s, size_t __pos, size_t __n) argument
465 operator <<=(size_t __pos) argument
471 operator >>=(size_t __pos) argument
482 _Unchecked_set(size_t __pos) argument
487 _Unchecked_set(size_t __pos, int __val) argument
496 _Unchecked_reset(size_t __pos) argument
501 _Unchecked_flip(size_t __pos) argument
518 set(size_t __pos) argument
524 set(size_t __pos, int __val) argument
535 reset(size_t __pos) argument
548 flip(size_t __pos) argument
561 operator [](size_t __pos) argument
604 __result <<= __pos ; return __result; local
608 __result >>= __pos ; return __result; local
632 _M_copy_from_string(const basic_string<_CharT,_Traits,_Alloc>& __s, size_t __pos, size_t __n) argument
[all...]
H A D_string_sum.h135 _BString& append(const _BString& __s, size_type __pos, size_type __n) argument
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);} argument
157 _BString& insert(size_type __pos, const _BString& __s) {return _M_get_storage().insert(__pos, __s);} argument
158 _BString& insert(size_type __pos, const _BString& __s, size_type __beg, size_type __n) argument
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, __ argument
161 insert(size_type __pos, const _CharT* __s) argument
162 insert(size_type __pos, size_type __n, _CharT __c) argument
168 replace(size_type __pos, size_type __n, const _BString& __s) argument
172 replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) argument
174 replace(size_type __pos, size_type __n1, const _CharT* __s) argument
176 replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) argument
191 find(const _CharT* __s, size_type __pos, size_type __n) const argument
196 rfind(const _CharT* __s, size_type __pos, size_type __n) const argument
203 find_first_of(const _CharT* __s, size_type __pos, size_type __n) const argument
212 find_last_of(const _CharT* __s, size_type __pos, size_type __n) const argument
221 find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const argument
230 find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const argument
[all...]
H A D_vector.c81 void vector<_Tp, _Alloc>::_M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type& /*DO NOT USE!!*/, argument
91 __new_finish = _STLP_PRIV __uninitialized_move(this->_M_start, __pos, __new_start, _TrivialUCopy(), _Movable());
99 __new_finish = _STLP_PRIV __uninitialized_move(__pos, this->_M_finish, __new_finish, _TrivialUCopy(), _Movable()); // copy remainder
108 void vector<_Tp, _Alloc>::_M_insert_overflow(pointer __pos, const _Tp& __x, const __true_type& /*_TrivialCopy*/, argument
112 pointer __new_finish = __STATIC_CAST(pointer, _STLP_PRIV __copy_trivial(this->_M_start, __pos, __new_start));
116 __new_finish = __STATIC_CAST(pointer, _STLP_PRIV __copy_trivial(__pos, this->_M_finish, __new_finish)); // copy remainder
122 void vector<_Tp, _Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, argument
126 _M_fill_insert_aux(__pos, __n, __x_copy, __true_type());
131 for (; __src >= __pos; --__dst, --__src) {
135 _STLP_PRIV __uninitialized_fill_n(__pos, __
140 _M_fill_insert_aux(iterator __pos, size_type __n, const _Tp& __x, const __false_type& ) argument
166 _M_fill_insert(iterator __pos, size_type __n, const _Tp& __x) argument
223 insert(iterator __pos, const _Tp& __x) argument
[all...]
H A D_slist.h173 _Slist_node_base* _M_erase_after(_Slist_node_base* __pos) { argument
174 _Node* __next = __STATIC_CAST(_Node*, __pos->_M_next);
176 __pos->_M_next = __next_next;
458 iterator previous(const_iterator __pos) { argument
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()) { argument
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_nod
477 _M_insert_after(_Node_base* __pos) argument
482 _M_insert_after_fill(_Node_base* __pos, size_type __n, const value_type& __x) argument
491 _M_insert_after_range(_Node_base* __pos, _InIter __first, _InIter __last) argument
498 _M_insert_after_range(_Node_base* __pos, _Integer __n, _Integer __x, const __true_type&) argument
504 _M_insert_after_range(_Node_base* __pos, _InIter __first, _InIter __last, const __false_type&) argument
528 _M_splice_after_range(_Node_base* __pos, _InIter __first, _InIter __last) argument
535 _M_splice_after_range(_Node_base* __pos, _Integer __n, _Integer __x, const __true_type&) argument
541 _M_splice_after_range(_Node_base* __pos, _InIter __first, _InIter __last, const __false_type&) argument
564 _M_splice_range(_Node_base* __pos, _InIter __first, _InIter __last) argument
571 _M_splice_range(_Node_base* __pos, _Integer __n, _Integer __x, const __true_type&) argument
578 _M_splice_range(_Node_base* __pos, _InIter __first, _InIter __last, const __false_type&) argument
601 insert_after(iterator __pos, const value_type& __x = _Tp()) argument
609 insert_after(iterator __pos) argument
614 insert_after(iterator __pos, size_type __n, const value_type& __x) argument
622 insert_after(iterator __pos, _InIter __first, _InIter __last) argument
635 insert(iterator __pos, const value_type& __x = _Tp()) argument
644 insert(iterator __pos) argument
650 insert(iterator __pos, size_type __n, const value_type& __x) argument
658 insert(iterator __pos, _InIter __first, _InIter __last) argument
671 erase_after(iterator __pos) argument
676 erase(iterator __pos) argument
697 splice_after(iterator __pos, _Self& __x, iterator __before_first, iterator __before_last) argument
713 splice_after(iterator __pos, _Self& __x, iterator __prev) argument
727 splice_after(iterator __pos, _Self& __x) argument
737 splice(iterator __pos, _Self& __x) argument
752 splice(iterator __pos, _Self& __x, iterator __i) argument
766 splice(iterator __pos, _Self& __x, iterator __first, iterator __last) argument
[all...]
H A D_string.h183 basic_string(const _Self& __s, size_type __pos, size_type __n = npos, argument
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_typ
519 append(const _Self& __s, size_type __pos, size_type __n) argument
551 assign(const _Self& __s, size_type __pos, size_type __n) argument
608 insert(size_type __pos, const _Self& __s) argument
617 insert(size_type __pos, const _Self& __s, size_type __beg, size_type __n) argument
628 insert(size_type __pos, const _CharT* __s, size_type __n) argument
638 insert(size_type __pos, const _CharT* __s) argument
649 insert(size_type __pos, size_type __n, _CharT __c) argument
689 _M_insert_overflow(iterator __pos, _ForwardIter __first, _ForwardIter __last, size_type __n) argument
711 _M_insertT(iterator __pos, _ForwardIter __first, _ForwardIter __last, const forward_iterator_tag &) argument
795 erase(iterator __pos) argument
813 replace(size_type __pos, size_type __n, const _Self& __s) argument
838 replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) argument
851 replace(size_type __pos, size_type __n1, const _CharT* __s) argument
856 replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) argument
[all...]
H A D_deque.c122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos, argument
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, argument
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, argument
184 if (__pos
208 _M_erase(iterator __pos, const __true_type& ) argument
243 _M_erase(iterator __pos, const __false_type& ) argument
464 _M_fill_insert_aux(iterator __pos, size_type __n, const value_type& __x, const __true_type& ) argument
506 _M_fill_insert_aux(iterator __pos, size_type __n, const value_type& __x, const __false_type& ) argument
562 _M_insert_range_aux(iterator __pos, const value_type* __first, const value_type* __last, size_type __n, const __true_type& ) argument
601 _M_insert_range_aux(iterator __pos, const value_type* __first, const value_type* __last, size_type __n, const __false_type& ) argument
654 _M_insert_range_aux(iterator __pos, const_iterator __first, const_iterator __last, size_type __n, const __true_type& ) argument
693 _M_insert_range_aux(iterator __pos, const_iterator __first, const_iterator __last, size_type __n, const __false_type& ) argument
[all...]
H A D_vector.h144 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type& /*_Movable*/,
146 void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __true_type& /*_Movable*/, argument
151 _M_insert_overflow_aux(__pos, __x_copy, __false_type(), __fill_len, __atend);
154 _M_insert_overflow_aux(__pos, __x, __false_type(), __fill_len, __atend);
157 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __false_type& /*_TrivialCopy*/, argument
162 _M_insert_overflow_aux(__pos, __x, _Movable(), __fill_len, __atend);
164 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __true_type& /*_TrivialCopy*/,
391 iterator insert(iterator __pos, const _Tp& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp));
393 iterator insert(iterator __pos, const _Tp& __x);
398 iterator insert(iterator __pos) { retur argument
421 _M_range_insert_realloc(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) argument
448 _M_range_insert_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n, const __true_type& ) argument
467 _M_range_insert_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n, const __false_type& ) argument
502 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, const __true_type&) argument
507 _M_insert_dispatch(iterator __pos, _InputIterator __first, _InputIterator __last, const __false_type&) argument
515 insert(iterator __pos, _InputIterator __first, _InputIterator __last) argument
522 _M_range_insert(iterator __pos, _InputIterator __first, _InputIterator __last, const input_iterator_tag &) argument
532 _M_range_insert(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, const forward_iterator_tag &) argument
559 insert(iterator __pos, size_type __n, const _Tp& __x) argument
568 _M_erase(iterator __pos, const __true_type& ) argument
579 _M_erase(iterator __pos, const __false_type& ) argument
620 erase(iterator __pos) argument
[all...]
H A D_string.c280 void basic_string<_CharT,_Traits,_Alloc>::insert(iterator __pos, argument
284 const size_type __elems_after = this->_M_finish - __pos;
289 _Traits::move(__pos + __n, __pos, (__elems_after - __n) + 1);
290 _Traits::assign(__pos, __n, __c);
295 _STLP_PRIV __ucopy(__pos, __old_finish + 1, this->_M_finish);
297 _Traits::assign(__pos, __elems_after + 1, __c);
303 pointer __new_finish = _STLP_PRIV __ucopy(this->_M_Start(), __pos, __new_start);
305 __new_finish = _STLP_PRIV __ucopy(__pos, this->_M_finish, __new_finish);
314 void basic_string<_CharT,_Traits,_Alloc>::_M_insert(iterator __pos, argument
420 find( const _CharT* __s, size_type __pos, size_type __n) const argument
451 rfind(const _CharT* __s, size_type __pos, size_type __n) const argument
482 find_first_of(const _CharT* __s, size_type __pos, size_type __n) const argument
496 find_last_of(const _CharT* __s, size_type __pos, size_type __n) const argument
513 find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const argument
540 find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const argument
[all...]
H A D_list.h66 static void _STLP_CALL _Transfer(_Node_base* __pos,
420 iterator insert(iterator __pos, const_reference __x = value_type()) argument
422 iterator insert(iterator __pos, const_reference __x)
426 _Node_base* __n = __pos._M_node;
438 void _M_insert(iterator __pos, _InputIterator __first, _InputIterator __last) { argument
440 _M_insert_dispatch(__pos, __first, __last, _Integral());
445 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, argument
447 _M_fill_insert(__pos, __n, __x);
450 void _M_insert_dispatch(iterator __pos, argument
454 void _M_insert(iterator __pos, cons
468 insert(iterator __pos, _InputIterator __first, _InputIterator __last) argument
476 _M_splice_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, const __true_type& ) argument
481 _M_splice_insert_dispatch(iterator __pos, _InputIter __first, _InputIter __last, const __false_type& ) argument
498 insert(iterator __pos, size_type __n, const_reference __x) argument
502 _M_fill_insert(iterator __pos, size_type __n, const_reference __x) argument
512 insert(iterator __pos) argument
518 erase(iterator __pos) argument
599 splice(iterator __pos, _Self& __x) argument
610 splice(iterator __pos, _Self& __x, iterator __i) argument
622 splice(iterator __pos, _Self& __x, iterator __first, iterator __last) argument
[all...]
H A D_string_workaround.h58 basic_string(const _Self& __s, size_type __pos, size_type __n = npos, argument
60 : _STLP_NO_MEM_T_STRING_BASE(__s, __pos, __n, __a) {}
168 size_type __pos, size_type __n) {
169 _Base::append(__s, __pos, __n);
254 size_type __pos, size_type __n) {
255 _Base::assign(__s, __pos, __n);
319 _Self& insert(size_type __pos, const _Self& __s) { argument
320 _Base::insert(__pos, __s);
324 _Self& insert(size_type __pos, const _Self& __s, argument
326 _Base::insert(__pos, __
167 append(const _Self& __s, size_type __pos, size_type __n) argument
253 assign(const _Self& __s, size_type __pos, size_type __n) argument
329 insert(size_type __pos, const _CharT* __s, size_type __n) argument
335 insert(size_type __pos, const _CharT* __s) argument
341 insert(size_type __pos, size_type __n, _CharT __c) argument
375 _M_insert_overflow(iterator __pos, _ForwardIter __first, _ForwardIter __last, size_type __n) argument
397 _M_insertT(iterator __pos, _ForwardIter __first, _ForwardIter __last, const forward_iterator_tag &) argument
460 erase(iterator __pos) argument
472 replace(size_type __pos, size_type __n, const _Self& __s) argument
483 replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) argument
490 replace(size_type __pos, size_type __n1, const _CharT* __s) argument
496 replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) argument
[all...]
H A D_deque.h730 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp)) { argument
732 iterator insert(iterator __pos, const value_type& __x) {
737 if (__pos._M_cur == this->_M_start._M_cur) {
741 else if (__pos._M_cur == this->_M_finish._M_cur) {
748 return _M_fill_insert_aux(__pos, 1, __x, _Movable());
753 iterator insert(iterator __pos) argument
754 { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
757 void insert(iterator __pos, size_type __n, const value_type& __x) argument
758 { _M_fill_insert(__pos, __n, __x); }
761 iterator _M_fill_insert_aux(iterator __pos, size_typ
768 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, const __true_type& ) argument
774 _M_insert_dispatch(iterator __pos, _InputIterator __first, _InputIterator __last, const __false_type& ) argument
783 insert(iterator __pos, _InputIterator __first, _InputIterator __last) argument
835 erase(iterator __pos) argument
909 _M_insert(iterator __pos, _InputIterator __first, _InputIterator __last, const input_iterator_tag &) argument
917 _M_insert(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, const forward_iterator_tag &) argument
945 _M_insert_range_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n, const __true_type& ) argument
984 _M_insert_range_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n, const __false_type& ) argument
[all...]
H A D_slist_base.h58 static void _STLP_CALL __splice_after(_Slist_node_base* __pos,
62 static void _STLP_CALL __splice_after(_Slist_node_base* __pos, _Slist_node_base* __head);
/external/stlport/stlport/stl/pointers/
H A D_slist.h220 iterator previous(const_iterator __pos) argument
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)) argument
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) argument
235 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node))._M_node);}
238 void insert_after(iterator __pos, size_typ argument
245 _M_insert_after_dispatch(iterator __pos, _Integer __n, _Integer __val, const __true_type&) argument
251 _M_insert_after_dispatch(iterator __pos, _InputIterator __first, _InputIterator __last, const __false_type&) argument
263 insert_after(iterator __pos, _InputIterator __first, _InputIterator __last) argument
274 insert_after(iterator __pos, const_iterator __first, const_iterator __last) argument
278 insert_after(iterator __pos, const value_type* __first, const value_type* __last) argument
287 insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) argument
295 insert(iterator __pos) argument
299 insert(iterator __pos, size_type __n, const value_type& __x) argument
306 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, const __true_type&) argument
312 _M_insert_dispatch(iterator __pos, _InputIterator __first, _InputIterator __last, const __false_type&) argument
323 insert(iterator __pos, _InputIterator __first, _InputIterator __last) argument
334 insert(iterator __pos, const_iterator __first, const_iterator __last) argument
336 insert(iterator __pos, const value_type* __first, const value_type* __last) argument
341 erase_after(iterator __pos) argument
347 erase(iterator __pos) argument
365 splice_after(iterator __pos, _Self& __x, iterator __before_first, iterator __before_last) argument
369 splice_after(iterator __pos, _Self& __x, iterator __prev) argument
371 splice_after(iterator __pos, _Self& __x) argument
373 splice(iterator __pos, _Self& __x) argument
375 splice(iterator __pos, _Self& __x, iterator __i) argument
377 splice(iterator __pos, _Self& __x, iterator __first, iterator __last) argument
[all...]
H A D_list.h180 iterator insert(iterator __pos, const_reference __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) argument
182 iterator insert(iterator __pos, const_reference __x)
184 { return iterator(_M_impl.insert(_BaseIte(__pos._M_node),
191 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, argument
193 { _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); }
196 void _M_insert_dispatch(iterator __pos, argument
199 _M_impl.insert(_BaseIte(__pos._M_node),
208 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { argument
212 _M_insert_dispatch(__pos, __first, __last, _Integral());
214 _M_impl.insert(_BaseIte(__pos
218 insert(iterator __pos, const value_type *__first, const value_type *__last) argument
221 insert(iterator __pos, const_iterator __first, const_iterator __last) argument
225 insert(iterator __pos, size_type __n, const value_type& __x) argument
232 insert(iterator __pos) argument
237 erase(iterator __pos) argument
293 splice(iterator __pos, _Self& __x) argument
295 splice(iterator __pos, _Self& __x, iterator __i) argument
297 splice(iterator __pos, _Self& __x, iterator __first, iterator __last) argument
[all...]
H A D_vector.h176 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) argument
178 iterator insert(iterator __pos, const value_type& __x)
180 { return cast_traits::to_value_type_ptr(_M_impl.insert(cast_traits::to_storage_type_ptr(__pos),
185 iterator insert(iterator __pos) argument
186 { return _M_impl.insert(cast_traits::to_storage_type_ptr(__pos)); }
196 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) argument
197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); }
199 void insert(iterator __pos, const_iterator __first, const_iterator __last) { argument
200 _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), cast_traits::to_storage_type_cptr(__first),
205 void insert (iterator __pos, size_typ argument
210 erase(iterator __pos) argument
[all...]

Completed in 640 milliseconds

12