| /prebuilts/ndk/r11/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/r11/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/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| hashtable.h | 952 _Node* __cur = *__b; local
[all...] |
| /prebuilts/ndk/r11/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());
|
| _bvector.h | 627 iterator __cur = begin(); local
628 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
629 *__cur = *__first;
631 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...] |
| /prebuilts/ndk/r13/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/r13/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/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| hashtable.h | 952 _Node* __cur = *__b; local
[all...] |
| /prebuilts/ndk/r13/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());
|
| _bvector.h | 627 iterator __cur = begin(); local
628 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
629 *__cur = *__first;
631 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...] |
| /prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/ |
| _bvector.h | 627 iterator __cur = begin(); local
628 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
629 *__cur = *__first;
631 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...] |
