| /external/stlport/stlport/stl/ |
| _hashtable.c | 172 _ElemsIte __cur(*__bcur);
173 _ElemsIte __prev = __cur++;
174 for (; __cur != __pos; ++__prev, ++__cur);
201 _ElemsIte __cur(_M_buckets[__n]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur) {
206 if (_M_equals(_M_get_key(*__cur), _M_get_key(__obj))) {
209 _STLP_ASSERT(_M_hash(_M_get_key(*__cur)) == _M_hash(_M_get_key(__obj))
460 _ElemsIte __cur, __last(_M_elems.end()); local
[all...] |
| _slist.c | 46 _Slist_node_base* __cur = __before_first->_M_next; local
47 while (__cur != __last_node) {
48 _Node* __tmp = __STATIC_CAST(_Node*, __cur);
49 __cur = __cur->_M_next;
107 _Node_base* __cur = &this->_M_head._M_data; local
108 while (__cur->_M_next != 0 && __len > 0) {
110 __cur = __cur->_M_next;
112 if (__cur->_M_next
120 _Node_base* __cur = &this->_M_head._M_data; local
[all...] |
| _uninitialized.h | 54 _OutputIter __cur = __result; local
56 for ( ; __first != __last; ++__first, ++__cur)
57 _Param_Construct(&*__cur, *__first);
58 return __cur;
60 _STLP_UNWIND(_STLP_STD::_Destroy_Range(__result, __cur))
61 _STLP_RET_AFTER_THROW(__cur)
84 _OutputIter __cur = __result; local
87 _Param_Construct(&*__cur, *__first);
89 ++__cur;
91 return __cur;
164 _ForwardIter __cur = __result; local
219 _ForwardIter __cur = __first; local
247 _ForwardIter __cur = __first; local
286 _ForwardIter __cur = __first; local
[all...] |
| _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)
[all...] |
| _list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next); local
70 __cur &&
72 __cur != &(_M_node._M_data)) {
73 _Node* __tmp = __cur;
74 __cur = __STATIC_CAST(_Node*, __cur->_M_next);
|
| _deque.c | 71 _Tp** __cur = __nstart; local
73 for (; __cur < __nfinish; ++__cur)
74 *__cur = _M_map_size.allocate(this->buffer_size());
76 _STLP_UNWIND(_M_destroy_nodes(__nstart, __cur))
370 _Map_pointer __cur = this->_M_start._M_node; local
372 for (; __cur < this->_M_finish._M_node; ++__cur)
373 uninitialized_fill(*__cur, *__cur + this->buffer_size(), __val)
[all...] |
| _fstream.c | 370 streamoff __cur = _M_base._M_seek(0, ios_base::cur); local
373 if (__cur != -1 && __cur + __adj >= 0)
374 return __off == 0 ? pos_type(__cur + __adj)
375 : _M_seek_return(__cur + __adj, __state);
|
| _slist.h | 795 _Node_base* __cur = &this->_M_head._M_data; local
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;
|
| _bvector.h | 627 iterator __cur = begin(); local
628 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
629 *__cur = *__first;
631 erase(__cur, end());
|
| _string_workaround.h | 284 pointer __cur = this->_M_Start(); local
285 while (__f != __l && __cur != this->_M_Finish()) {
286 _Traits::assign(*__cur, *__f);
288 ++__cur;
291 _Base::erase(__cur, this->_M_Finish());
|
| _vector.h | 349 iterator __cur = begin(); local
350 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
351 *__cur = *__first;
353 erase(__cur, end());
|
| _deque.h | 624 iterator __cur = begin(); local
625 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
626 *__cur = *__first;
628 erase(__cur, end());
[all...] |
| _string.h | 578 pointer __cur = this->_M_Start(); local
579 while (__f != __l && __cur != this->_M_Finish()) {
580 _Traits::assign(*__cur, *__f);
582 ++__cur;
585 erase(__cur, this->end());
[all...] |
| /external/stlport/src/ |
| fstream.cpp | 66 streamoff __cur = __this->_M_base._M_seek(0, ios_base::cur); local
68 if (__size > 0 && __cur >= 0 && __cur < __size) {
69 streamoff __offset = (__cur / __this->_M_base.__page_size()) * __this->_M_base.__page_size();
70 streamoff __remainder = __cur - __offset;
|
