| /external/stlport/stlport/stl/ |
| D | _hashtable.c | 172 _ElemsIte __cur(*__bcur); in _S_before_begin()
173 _ElemsIte __prev = __cur++; in _S_before_begin()
174 for (; __cur != __pos; ++__prev, ++__cur); in _S_before_begin()
201 _ElemsIte __cur(_M_buckets[__n]); in insert_unique_noresize()
204 if (__cur != __last) { in insert_unique_noresize()
205 for (; __cur != __last; ++__cur) { in insert_unique_noresize()
206 if (_M_equals(_M_get_key(*__cur), _M_get_key(__obj))) { in insert_unique_noresize()
209 _STLP_ASSERT(_M_hash(_M_get_key(*__cur)) == _M_hash(_M_get_key(__obj))) in insert_unique_noresize()
210 return pair<iterator, bool>(iterator(__cur), false); in insert_unique_noresize()
218 __cur = _M_elems.insert_after(_ElemsIte(_M_buckets[__n]), __obj); in insert_unique_noresize()
[all …]
|
| D | _slist.c | 46 _Slist_node_base* __cur = __before_first->_M_next; in _M_erase_after() local
47 while (__cur != __last_node) { in _M_erase_after()
48 _Node* __tmp = __STATIC_CAST(_Node*, __cur); in _M_erase_after()
49 __cur = __cur->_M_next; in _M_erase_after()
107 _Node_base* __cur = &this->_M_head._M_data; in resize() local
108 while (__cur->_M_next != 0 && __len > 0) { in resize()
110 __cur = __cur->_M_next; in resize()
112 if (__cur->_M_next) in resize()
113 this->_M_erase_after(__cur, 0); in resize()
115 _M_insert_after_fill(__cur, __len, __x); in resize()
[all …]
|
| D | _uninitialized.h | 54 _OutputIter __cur = __result; in __ucopy() local
56 for ( ; __first != __last; ++__first, ++__cur) in __ucopy()
57 _Param_Construct(&*__cur, *__first); in __ucopy()
58 return __cur; in __ucopy()
60 _STLP_UNWIND(_STLP_STD::_Destroy_Range(__result, __cur)) in __ucopy()
61 _STLP_RET_AFTER_THROW(__cur) in __ucopy()
84 _OutputIter __cur = __result; in __ucopy() local
87 _Param_Construct(&*__cur, *__first); in __ucopy()
89 ++__cur; in __ucopy()
91 return __cur; in __ucopy()
[all …]
|
| D | _hashtable.h | 519 _ElemsIte __cur(_M_buckets[__n]);
521 for (; __cur != __last; ++__cur) {
522 if (_M_equals(_M_get_key(*__cur), __key)) {
524 for (++__cur;
525 __cur != __last && _M_equals(_M_get_key(*__cur), __key);
526 ++__result, ++__cur);
541 _ElemsIte __cur(__first);
542 for (++__cur; (__cur != __last) && _M_equals(_M_get_key(*__cur), __key); ++__cur);
543 return _Pii(__first, __cur);
557 _ElemsIte __cur(__first);
[all …]
|
| D | _list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next); in clear() local
70 __cur && in clear()
72 __cur != &(_M_node._M_data)) { in clear()
73 _Node* __tmp = __cur; in clear()
74 __cur = __STATIC_CAST(_Node*, __cur->_M_next); in clear()
|
| D | _deque.c | 71 _Tp** __cur = __nstart; in _M_create_nodes() local
73 for (; __cur < __nfinish; ++__cur) in _M_create_nodes()
74 *__cur = _M_map_size.allocate(this->buffer_size()); in _M_create_nodes()
76 _STLP_UNWIND(_M_destroy_nodes(__nstart, __cur)) in _M_create_nodes()
370 _Map_pointer __cur = this->_M_start._M_node; in _M_fill_initialize() local
372 for (; __cur < this->_M_finish._M_node; ++__cur) in _M_fill_initialize()
373 uninitialized_fill(*__cur, *__cur + this->buffer_size(), __val); in _M_fill_initialize()
376 _STLP_UNWIND(_STLP_STD::_Destroy_Range(this->_M_start, iterator(*__cur, __cur))) in _M_fill_initialize()
|
| D | _fstream.c | 370 streamoff __cur = _M_base._M_seek(0, ios_base::cur); in seekoff()
373 if (__cur != -1 && __cur + __adj >= 0) in seekoff()
374 return __off == 0 ? pos_type(__cur + __adj) in seekoff()
375 : _M_seek_return(__cur + __adj, __state); in seekoff()
|
| D | _string_workaround.h | 284 pointer __cur = this->_M_Start(); in _M_assign_dispatch() local
285 while (__f != __l && __cur != this->_M_Finish()) { in _M_assign_dispatch()
286 _Traits::assign(*__cur, *__f); in _M_assign_dispatch()
288 ++__cur; in _M_assign_dispatch()
291 _Base::erase(__cur, this->_M_Finish()); in _M_assign_dispatch()
|
| D | _slist.h | 795 _Node_base* __cur = &this->_M_head._M_data;
796 while (__cur->_M_next) {
797 if (__pred(__STATIC_CAST(_Node*, __cur->_M_next)->_M_data))
798 this->_M_erase_after(__cur);
800 __cur = __cur->_M_next;
|
| D | _vector.h | 349 iterator __cur = begin(); local
350 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
351 *__cur = *__first;
353 erase(__cur, end());
|
| D | _bvector.h | 627 iterator __cur = begin();
628 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
629 *__cur = *__first;
631 erase(__cur, end());
|
| D | _deque.h | 624 iterator __cur = begin();
625 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
626 *__cur = *__first;
628 erase(__cur, end());
|
| D | _string.h | 578 pointer __cur = this->_M_Start(); in _M_assign_dispatch() local
579 while (__f != __l && __cur != this->_M_Finish()) { in _M_assign_dispatch()
580 _Traits::assign(*__cur, *__f); in _M_assign_dispatch()
582 ++__cur; in _M_assign_dispatch()
585 erase(__cur, this->end()); in _M_assign_dispatch()
|
| /external/stlport/src/ |
| D | fstream.cpp | 66 streamoff __cur = __this->_M_base._M_seek(0, ios_base::cur); in _M_doit() local
68 if (__size > 0 && __cur >= 0 && __cur < __size) { in _M_doit()
69 streamoff __offset = (__cur / __this->_M_base.__page_size()) * __this->_M_base.__page_size(); in _M_doit()
70 streamoff __remainder = __cur - __offset; in _M_doit()
|
| /external/stlport/etc/ |
| D | ChangeLog-5.1 | 1571 * stlport/stl/_deque.c: Ditto with __cur in _M_fill_initialize.
|