| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/backward/ |
| hashtable.h | 553 for (const _Node* __cur = _M_buckets[__n]; __cur;
554 __cur = __cur->_M_next)
555 if (_M_equals(_M_get_key(__cur->_M_val), __key))
769 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
770 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))
893 _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/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| hashtable.h | 1054 _Node* __cur = *__it._M_cur_bucket; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/ |
| hashtable.h | 952 _Node* __cur = *__b; local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/backward/ |
| hashtable.h | 533 for (const _Node* __cur = _M_buckets[__n]; __cur;
534 __cur = __cur->_M_next)
535 if (_M_equals(_M_get_key(__cur->_M_val), __key))
749 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
750 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))
873 _Node* __cur = __first; local
927 _Node* __cur = _M_buckets[__n]; local
1052 _Node* __cur = _M_buckets[__n]; local
1077 _Node* __cur = _M_buckets[__n]; local
1098 _Node* __cur = _M_buckets[__i]; local
1121 const _Node* __cur = __ht._M_buckets[__i]; local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_bvector.h | 940 iterator __cur = begin(); local
941 for (; __first != __last && __cur != end(); ++__cur, ++__first)
942 *__cur = *__first;
944 _M_erase_at_end(__cur);
|
| /prebuilts/ndk/5/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());
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/backward/ |
| hashtable.h | 533 for (const _Node* __cur = _M_buckets[__n]; __cur;
534 __cur = __cur->_M_next)
535 if (_M_equals(_M_get_key(__cur->_M_val), __key))
749 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
750 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))
873 _Node* __cur = __first; local
927 _Node* __cur = _M_buckets[__n]; local
1052 _Node* __cur = _M_buckets[__n]; local
1077 _Node* __cur = _M_buckets[__n]; local
1098 _Node* __cur = _M_buckets[__i]; local
1121 const _Node* __cur = __ht._M_buckets[__i]; local
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_bvector.h | 940 iterator __cur = begin(); local
941 for (; __first != __last && __cur != end(); ++__cur, ++__first)
942 *__cur = *__first;
944 _M_erase_at_end(__cur);
|
| /prebuilts/ndk/6/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());
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/backward/ |
| hashtable.h | 533 for (const _Node* __cur = _M_buckets[__n]; __cur;
534 __cur = __cur->_M_next)
535 if (_M_equals(_M_get_key(__cur->_M_val), __key))
749 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
750 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))
873 _Node* __cur = __first; local
927 _Node* __cur = _M_buckets[__n]; local
1052 _Node* __cur = _M_buckets[__n]; local
1077 _Node* __cur = _M_buckets[__n]; local
1098 _Node* __cur = _M_buckets[__i]; local
1121 const _Node* __cur = __ht._M_buckets[__i]; local
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_bvector.h | 940 iterator __cur = begin(); local
941 for (; __first != __last && __cur != end(); ++__cur, ++__first)
942 *__cur = *__first;
944 _M_erase_at_end(__cur);
|
| /prebuilts/ndk/7/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());
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/backward/ |
| hashtable.h | 533 for (const _Node* __cur = _M_buckets[__n]; __cur;
534 __cur = __cur->_M_next)
535 if (_M_equals(_M_get_key(__cur->_M_val), __key))
749 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
750 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))
873 _Node* __cur = __first; local
927 _Node* __cur = _M_buckets[__n]; local
1052 _Node* __cur = _M_buckets[__n]; local
1077 _Node* __cur = _M_buckets[__n]; local
1098 _Node* __cur = _M_buckets[__i]; local
1121 const _Node* __cur = __ht._M_buckets[__i]; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| stl_bvector.h | 936 iterator __cur = begin(); local
937 for (; __first != __last && __cur != end(); ++__cur, ++__first)
938 *__cur = *__first;
940 _M_erase_at_end(__cur);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/backward/ |
| hashtable.h | 553 for (const _Node* __cur = _M_buckets[__n]; __cur;
554 __cur = __cur->_M_next)
555 if (_M_equals(_M_get_key(__cur->_M_val), __key))
769 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
770 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))
893 _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/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| hashtable.h | 1054 _Node* __cur = *__it._M_cur_bucket; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
| hashtable.h | 952 _Node* __cur = *__b; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/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/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_deque.h | 624 _Tp** __cur; local
627 for (__cur = __nstart; __cur < __nfinish; ++__cur)
628 *__cur = this->_M_allocate_node();
632 _M_destroy_nodes(__nstart, __cur);
[all...] |
