Home
last modified time | relevance | path

Searched refs:__pos (Results 1 – 25 of 47) sorted by relevance

12

/external/stlport/stlport/stl/debug/
D_slist.h224 iterator previous(const_iterator __pos) { in previous() argument
225 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos)) in previous()
226 …_STLP_VERBOSE_ASSERT(!(__pos._M_iterator == _M_non_dbg_impl.before_begin()), _StlMsg_INVALID_ARGUM… in previous()
227 return iterator(&_M_iter_list, _M_non_dbg_impl.previous(__pos._M_iterator)); in previous()
229 const_iterator previous(const_iterator __pos) const { in previous() argument
230 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos)) in previous()
231 …_STLP_VERBOSE_ASSERT(!(__pos._M_iterator == _M_non_dbg_impl.before_begin()), _StlMsg_INVALID_ARGUM… in previous()
232 return const_iterator(&_M_iter_list, _M_non_dbg_impl.previous(__pos._M_iterator)); in previous()
238 iterator insert_after(iterator __pos, const value_type& __x = _Tp()) {
240 iterator insert_after(iterator __pos, const value_type& __x) {
[all …]
D_debug.c127 _L_type* __pos = __prev->_M_next; in __invalidate_range() local
129 while (__pos != 0) { in __invalidate_range()
130 …if (!(&__first == __STATIC_CAST(_Iterator*, __pos) || &__last == __STATIC_CAST(_Iterator*, __pos))… in __invalidate_range()
131 stlp_in_range_aux(__STATIC_CAST(_Iterator*, __pos)->_M_iterator, in __invalidate_range()
134 __pos->_M_owner = 0; in __invalidate_range()
135 __prev->_M_next = __pos->_M_next; in __invalidate_range()
138 __prev = __pos; in __invalidate_range()
140 __pos = __prev->_M_next; in __invalidate_range()
151 _L_type* __pos = __prev->_M_next; in __invalidate_iterator() local
152 while (__pos != 0) { in __invalidate_iterator()
[all …]
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… in _Reserve_t()
35 if (__pos > __size) in _Reserve_t()
39 _M_append_sum_pos(__s, __pos, (min) (__n, __size - __pos), _M_non_dbg_impl); in _Reserve_t()
65 size_type __pos, size_type __n) in _M_append_fast_pos() argument
66 { return __str.append(__s + __pos, __s + __pos + (min)(__n, __s_size - __pos)); } in _M_append_fast_pos()
68 size_type __pos, size_type __n) in _M_append_fast_pos() argument
69 { return _M_append_fast_pos(__s.c_str(), __s.size(), __str, __pos, __n); } in _M_append_fast_pos()
71 size_type __pos, size_type __n) in _M_append_fast_pos() argument
72 { return _M_append_fast_pos(__s.b_str(), __str, __pos, __n); } in _M_append_fast_pos()
[all …]
D_string.h101 basic_string(const _Self& __s, size_type __pos, size_type __n = npos,
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) { in append() argument
282 _M_non_dbg_impl.append(__s._M_non_dbg_impl, __pos, __n); in append()
330 _Self& assign(const _Self& __s, size_type __pos, size_type __n) { in assign() argument
331 if (__pos < __s.size()) { in assign()
334 _M_non_dbg_impl.assign(__s._M_non_dbg_impl, __pos, __n); in assign()
389 _Self& insert(size_type __pos, const _Self& __s) { in insert() argument
391 _M_non_dbg_impl.insert(__pos, __s._M_non_dbg_impl); in insert()
396 _Self& insert(size_type __pos, const _Self& __s, in insert() argument
[all …]
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) { in insert() argument
297 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos)) in insert()
299 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator)); in insert()
303 void insert(iterator __pos, size_type __n, const value_type& __x) { in insert() argument
304 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos)) in insert()
306 _M_non_dbg_impl.insert(__pos._M_iterator, __n, __x); in insert()
[all …]
D_list.h206 iterator insert(iterator __pos, const _Tp& __x = _Tp()) {
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)); } in insert() argument
220 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { in insert() argument
221 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos)) in insert()
223 _M_non_dbg_impl.insert(__pos._M_iterator, in insert()
229 void insert(iterator __pos, const _Tp* __first, const _Tp* __last) { in insert() argument
230 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__pos)) in insert()
[all …]
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 …]
/external/stlport/stlport/stl/
D_bitset.h119 static size_t _STLP_CALL _S_whichword( size_t __pos ) { in _S_whichword()
120 return __pos / __BITS_PER_WORD; in _S_whichword()
122 static size_t _STLP_CALL _S_whichbyte( size_t __pos ) { in _S_whichbyte()
123 return (__pos % __BITS_PER_WORD) / CHAR_BIT; in _S_whichbyte()
125 static size_t _STLP_CALL _S_whichbit( size_t __pos ) { in _S_whichbit()
126 return __pos % __BITS_PER_WORD; in _S_whichbit()
128 static _WordT _STLP_CALL _S_maskbit( size_t __pos ) { in _S_maskbit()
129 return __STATIC_CAST(_WordT,1) << _S_whichbit(__pos); in _S_maskbit()
132 _WordT& _M_getword(size_t __pos) { return _M_w[_S_whichword(__pos)]; } in _M_getword()
133 _WordT _M_getword(size_t __pos) const { return _M_w[_S_whichword(__pos)]; } in _M_getword()
[all …]
D_string_sum.h135 _BString& append(const _BString& __s, size_type __pos, size_type __n) in append() argument
136 { return _M_get_storage().append(__s, __pos, __n); } in append()
151 …ring& assign(const _BString& __s, size_type __pos, size_type __n) {return _M_get_storage().assign(… in assign() argument
157 …_BString& insert(size_type __pos, const _BString& __s) {return _M_get_storage().insert(__pos, __s)… in insert() argument
158 _BString& insert(size_type __pos, const _BString& __s, size_type __beg, size_type __n) in insert() argument
159 {return _M_get_storage().insert(__pos, __s, __beg, __n);} in insert()
160 …_BString& insert(size_type __pos, const _CharT* __s, size_type __n) {return _M_get_storage().inser… in insert() argument
161 _BString& insert(size_type __pos, const _CharT* __s) {return _M_get_storage().insert(__pos, __s);} in insert() argument
162 …_BString& insert(size_type __pos, size_type __n, _CharT __c) {return _M_get_storage().insert(__pos… in insert() argument
165 …_BString& erase(size_type __pos = 0, size_type __n =_BString::npos) {return _M_get_storage().erase…
[all …]
D_slist.h173 _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 …]
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)) : … in _Reserve_t()
34 if (__pos > __size) in _Reserve_t()
37 _M_append_sum_pos(__s, __pos, (min) (__n, __size - __pos)); in _Reserve_t()
66 size_type __pos, size_type __n) in _M_append_fast_pos() argument
67 { return uninitialized_copy(__s + __pos, __s + __pos + (min)(__n, __s_size - __pos), __buf); } in _M_append_fast_pos()
69 size_type __pos, size_type __n) in _M_append_fast_pos() argument
70 { return _M_append_fast_pos(__s.c_str(), __s.size(), __buf, __pos, __n); } in _M_append_fast_pos()
72 size_type __pos, size_type __n) in _M_append_fast_pos() argument
73 { return _M_append_fast_pos(__s.b_str(), __buf, __pos, __n); } in _M_append_fast_pos()
[all …]
D_string.h183 basic_string(const _Self& __s, size_type __pos, size_type __n = npos,
186 basic_string(const _Self& __s, size_type __pos) in basic_string() argument
188 if (__pos > __s.size()) in basic_string()
191 _M_range_initialize(__s._M_Start() + __pos, __s._M_Finish()); in basic_string()
193 basic_string(const _Self& __s, size_type __pos, size_type __n) in basic_string() argument
195 if (__pos > __s.size()) in basic_string()
198 _M_range_initialize(__s._M_Start() + __pos, in basic_string()
199 __s._M_Start() + __pos + (min) (__n, __s.size() - __pos)); in basic_string()
201 basic_string(const _Self& __s, size_type __pos, size_type __n, in basic_string() argument
205 if (__pos > __s.size()) in basic_string()
[all …]
D_deque.c122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos, in _M_fill_insert() argument
127 if (__pos._M_cur == this->_M_start._M_cur) { in _M_fill_insert()
135 else if (__pos._M_cur == this->_M_finish._M_cur) { in _M_fill_insert()
144 _M_fill_insert_aux(__pos, __n, __x, _Movable()); in _M_fill_insert()
150 void deque<_Tp, _Alloc>::insert(iterator __pos, in insert() argument
156 if (__pos._M_cur == this->_M_start._M_cur) { in insert()
164 else if (__pos._M_cur == this->_M_finish._M_cur) { in insert()
174 _M_insert_range_aux(__pos, __first, __last, __n, _Movable()); in insert()
178 void deque<_Tp,_Alloc>::insert(iterator __pos, in insert() argument
184 if (__pos._M_cur == this->_M_start._M_cur) { in insert()
[all …]
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*/, in _M_insert_overflow_aux() argument
151 _M_insert_overflow_aux(__pos, __x_copy, __false_type(), __fill_len, __atend); in _M_insert_overflow_aux()
154 _M_insert_overflow_aux(__pos, __x, __false_type(), __fill_len, __atend); in _M_insert_overflow_aux()
157 void _M_insert_overflow(pointer __pos, const _Tp& __x, const __false_type& /*_TrivialCopy*/,
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) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
[all …]
D_vector.c81 void vector<_Tp, _Alloc>::_M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type&… in _M_insert_overflow_aux() argument
91 …__new_finish = _STLP_PRIV __uninitialized_move(this->_M_start, __pos, __new_start, _TrivialUCopy()… in _M_insert_overflow_aux()
99 …__new_finish = _STLP_PRIV __uninitialized_move(__pos, this->_M_finish, __new_finish, _TrivialUCopy… 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() argument
112 …pointer __new_finish = __STATIC_CAST(pointer, _STLP_PRIV __copy_trivial(this->_M_start, __pos, __n… in _M_insert_overflow()
116 …__new_finish = __STATIC_CAST(pointer, _STLP_PRIV __copy_trivial(__pos, this->_M_finish, __new_fini… in _M_insert_overflow()
122 void vector<_Tp, _Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, in _M_fill_insert_aux() argument
126 _M_fill_insert_aux(__pos, __n, __x_copy, __true_type()); in _M_fill_insert_aux()
131 for (; __src >= __pos; --__dst, --__src) { in _M_fill_insert_aux()
135 _STLP_PRIV __uninitialized_fill_n(__pos, __n, __x); in _M_fill_insert_aux()
[all …]
D_string_workaround.h58 basic_string(const _Self& __s, size_type __pos, size_type __n = npos,
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() argument
169 _Base::append(__s, __pos, __n); in append()
254 size_type __pos, size_type __n) { in assign() argument
255 _Base::assign(__s, __pos, __n); in assign()
319 _Self& insert(size_type __pos, const _Self& __s) { in insert() argument
320 _Base::insert(__pos, __s); in insert()
324 _Self& insert(size_type __pos, const _Self& __s, in insert() argument
326 _Base::insert(__pos, __s, __beg, __n); in insert()
[all …]
D_string.c280 void basic_string<_CharT,_Traits,_Alloc>::insert(iterator __pos, in insert() argument
284 const size_type __elems_after = this->_M_finish - __pos; in insert()
289 _Traits::move(__pos + __n, __pos, (__elems_after - __n) + 1); in insert()
290 _Traits::assign(__pos, __n, __c); in insert()
295 _STLP_PRIV __ucopy(__pos, __old_finish + 1, this->_M_finish); in insert()
297 _Traits::assign(__pos, __elems_after + 1, __c); in insert()
303 pointer __new_finish = _STLP_PRIV __ucopy(this->_M_Start(), __pos, __new_start); in insert()
305 __new_finish = _STLP_PRIV __ucopy(__pos, this->_M_finish, __new_finish); in insert()
314 void basic_string<_CharT,_Traits,_Alloc>::_M_insert(iterator __pos, in _M_insert() argument
321 const size_t __elems_after = this->_M_finish - __pos; in _M_insert()
[all …]
D_list.h66 static void _STLP_CALL _Transfer(_Node_base* __pos,
420 iterator insert(iterator __pos, const_reference __x = value_type())
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) {
440 _M_insert_dispatch(__pos, __first, __last, _Integral());
445 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
447 _M_fill_insert(__pos, __n, __x);
450 void _M_insert_dispatch(iterator __pos,
454 void _M_insert(iterator __pos, const value_type* __first, const value_type* __last) {
[all …]
D_slist_base.c48 _Sl_global<_Dummy>::__splice_after(_Slist_node_base* __pos, _Slist_node_base* __head) { in __splice_after() argument
51 _Slist_node_base* __after = __pos->_M_next; in __splice_after()
52 __pos->_M_next = __head->_M_next; in __splice_after()
60 _Sl_global<_Dummy>::__splice_after(_Slist_node_base* __pos, in __splice_after() argument
63 if (__pos != __before_first && __pos != __before_last) { in __splice_after()
65 _Slist_node_base* __after = __pos->_M_next; in __splice_after()
67 __pos->_M_next = __first; in __splice_after()
D_deque.h730 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp)) {
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)
754 { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
757 void insert(iterator __pos, size_type __n, const value_type& __x)
758 { _M_fill_insert(__pos, __n, __x); }
761 …iterator _M_fill_insert_aux(iterator __pos, size_type __n, const value_type& __x, const __true_typ…
[all …]
/external/stlport/stlport/stl/pointers/
D_slist.h220 iterator previous(const_iterator __pos) in previous() argument
221 { return iterator(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node); } in previous()
222 const_iterator previous(const_iterator __pos) const in previous() argument
223 …{ return const_iterator(const_cast<_Node_base*>(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_… in previous()
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) in insert_after() argument
235 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node))._M_node);} in insert_after()
238 void insert_after(iterator __pos, size_type __n, const value_type& __x) in insert_after() argument
[all …]
D_list.h180 iterator insert(iterator __pos, const_reference __x = _STLP_DEFAULT_CONSTRUCTED(value_type))
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, in _M_insert_dispatch() argument
193 { _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); } in _M_insert_dispatch()
196 void _M_insert_dispatch(iterator __pos, in _M_insert_dispatch() argument
199 _M_impl.insert(_BaseIte(__pos._M_node), in _M_insert_dispatch()
208 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { in insert() argument
212 _M_insert_dispatch(__pos, __first, __last, _Integral()); in insert()
214 _M_impl.insert(_BaseIte(__pos._M_node), __first, __last); in insert()
[all …]
D_deque.h289 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type))
291 iterator insert(iterator __pos, const value_type& __x)
293 …turn ite_cast_traits::to_value_type_ite(_M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos),
297 iterator insert(iterator __pos) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(value_type)); }
300 void insert(iterator __pos, size_type __n, const value_type& __x)
301 …{ _M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos), __n, cast_traits::to_storage_type_cr…
307 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
309 _M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos), __n, __val);
313 void _M_insert_dispatch(iterator __pos,
316 _M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos),
[all …]
D_vector.h176 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type))
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) in insert() argument
186 { return _M_impl.insert(cast_traits::to_storage_type_ptr(__pos)); } in insert()
196 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) in insert() argument
197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); } in insert()
199 void insert(iterator __pos, const_iterator __first, const_iterator __last) { in insert() argument
200 …_M_impl.insert(cast_traits::to_storage_type_ptr(__pos), cast_traits::to_storage_type_cptr(__first), in insert()
205 void insert (iterator __pos, size_type __n, const value_type& __x) { in insert() argument
[all …]
/external/stlport/test/unit/
Dbitset_test.cpp53 size_t __pos = b2._Find_first(); in bitset1() local
54 CPPUNIT_ASSERT( __pos == 0 ); in bitset1()
55 __pos = b2._Find_next(__pos); in bitset1()
56 CPPUNIT_ASSERT( __pos == 4 ); in bitset1()
57 __pos = b2._Find_next(__pos); in bitset1()
58 CPPUNIT_ASSERT( __pos == 8 ); in bitset1()
59 __pos = b2._Find_next(__pos); in bitset1()
60 CPPUNIT_ASSERT( __pos == 12 ); in bitset1()
61 __pos = b2._Find_next(__pos); in bitset1()
62 CPPUNIT_ASSERT( __pos == 13 ); in bitset1()

12