| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_uninitialized.h | 71 _ForwardIterator __cur = __result; local
74 for (; __first != __last; ++__first, ++__cur)
75 std::_Construct(std::__addressof(*__cur), *__first);
76 return __cur;
80 std::_Destroy(__result, __cur);
138 _ForwardIterator __cur = __first; local
141 for (; __cur != __last; ++__cur)
142 std::_Construct(std::__addressof(*__cur), __x);
146 std::_Destroy(__first, __cur);
198 _ForwardIterator __cur = __first; local
260 _ForwardIterator __cur = __result; local
310 _ForwardIterator __cur = __first; local
336 _ForwardIterator __cur = __first; local
477 _ForwardIterator __cur = __first; local
512 _ForwardIterator __cur = __first; local
584 _ForwardIterator __cur = __first; local
614 _ForwardIterator __cur = __first; local
641 _ForwardIterator __cur = __result; local
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/ |
| _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);
|
| _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...] |
| _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());
|
| /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_uninitialized.h | 71 _ForwardIterator __cur = __result; local
74 for (; __first != __last; ++__first, ++__cur)
75 std::_Construct(std::__addressof(*__cur), *__first);
76 return __cur;
80 std::_Destroy(__result, __cur);
138 _ForwardIterator __cur = __first; local
141 for (; __cur != __last; ++__cur)
142 std::_Construct(std::__addressof(*__cur), __x);
146 std::_Destroy(__first, __cur);
198 _ForwardIterator __cur = __first; local
260 _ForwardIterator __cur = __result; local
310 _ForwardIterator __cur = __first; local
336 _ForwardIterator __cur = __first; local
477 _ForwardIterator __cur = __first; local
512 _ForwardIterator __cur = __first; local
584 _ForwardIterator __cur = __first; local
614 _ForwardIterator __cur = __first; local
641 _ForwardIterator __cur = __result; local
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/ |
| _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);
|
| _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...] |
| _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());
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/backward/ |
| hashtable.h | 551 for (const _Node* __cur = _M_buckets[__n]; __cur;
552 __cur = __cur->_M_next)
553 if (_M_equals(_M_get_key(__cur->_M_val), __key))
767 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
768 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))
891 _Node* __cur = __first; local
946 _Node* __cur = _M_buckets[__n]; local
1071 _Node* __cur = _M_buckets[__n]; local
1096 _Node* __cur = _M_buckets[__n]; local
1117 _Node* __cur = _M_buckets[__i]; local
1140 const _Node* __cur = __ht._M_buckets[__i]; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_deque.h | 623 _Tp** __cur; local
626 for (__cur = __nstart; __cur < __nfinish; ++__cur)
627 *__cur = this->_M_allocate_node();
631 _M_destroy_nodes(__nstart, __cur);
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| hashtable.h | 952 _Node* __cur = *__b; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/backward/ |
| hashtable.h | 551 for (const _Node* __cur = _M_buckets[__n]; __cur;
552 __cur = __cur->_M_next)
553 if (_M_equals(_M_get_key(__cur->_M_val), __key))
767 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
768 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))
891 _Node* __cur = __first; local
946 _Node* __cur = _M_buckets[__n]; local
1071 _Node* __cur = _M_buckets[__n]; local
1096 _Node* __cur = _M_buckets[__n]; local
1117 _Node* __cur = _M_buckets[__i]; local
1140 const _Node* __cur = __ht._M_buckets[__i]; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_deque.h | 623 _Tp** __cur; local
626 for (__cur = __nstart; __cur < __nfinish; ++__cur)
627 *__cur = this->_M_allocate_node();
631 _M_destroy_nodes(__nstart, __cur);
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| hashtable.h | 952 _Node* __cur = *__b; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/backward/ |
| hashtable.h | 551 for (const _Node* __cur = _M_buckets[__n]; __cur;
552 __cur = __cur->_M_next)
553 if (_M_equals(_M_get_key(__cur->_M_val), __key))
767 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
768 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))
891 _Node* __cur = __first; local
946 _Node* __cur = _M_buckets[__n]; local
1071 _Node* __cur = _M_buckets[__n]; local
1096 _Node* __cur = _M_buckets[__n]; local
1117 _Node* __cur = _M_buckets[__i]; local
1140 const _Node* __cur = __ht._M_buckets[__i]; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_deque.h | 623 _Tp** __cur; local
626 for (__cur = __nstart; __cur < __nfinish; ++__cur)
627 *__cur = this->_M_allocate_node();
631 _M_destroy_nodes(__nstart, __cur);
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
| hashtable.h | 952 _Node* __cur = *__b; local
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/backward/ |
| hashtable.h | 552 for (const _Node* __cur = _M_buckets[__n]; __cur;
553 __cur = __cur->_M_next)
554 if (_M_equals(_M_get_key(__cur->_M_val), __key))
768 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
769 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))
892 _Node* __cur = __first; local
947 _Node* __cur = _M_buckets[__n]; local
1072 _Node* __cur = _M_buckets[__n]; local
1097 _Node* __cur = _M_buckets[__n]; local
1118 _Node* __cur = _M_buckets[__i]; local
1141 const _Node* __cur = __ht._M_buckets[__i]; local
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_deque.h | 628 _Tp** __cur; local
631 for (__cur = __nstart; __cur < __nfinish; ++__cur)
632 *__cur = this->_M_allocate_node();
636 _M_destroy_nodes(__nstart, __cur);
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| hashtable.h | 952 _Node* __cur = *__b; local
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/ |
| _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;
|
| _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...] |
| _vector.h | 349 iterator __cur = begin(); local
350 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
351 *__cur = *__first;
353 erase(__cur, end());
|
