| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| boost_concept_check.h | 430 *__i = *__j; // require dereference and assignment
432 _Tp __i, __j;
536 __n = __i - __j; // require difference operator
540 _Tp __i, __j;
|
| stl_list.h | 1179 iterator __j = __i; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| boost_concept_check.h | 430 *__i = *__j; // require dereference and assignment
432 _Tp __i, __j;
536 __n = __i - __j; // require difference operator
540 _Tp __i, __j;
|
| stl_list.h | 1179 iterator __j = __i; local
[all...] |
| /external/qemu/hw/ |
| apic.c | 193 int __i, __j, __mask;\
197 for(__j = 0; __j < 32; __j++) {\
198 if (__mask & (1 << __j)) {\
199 apic = local_apics[__i * 32 + __j];\
|
| /external/stlport/stlport/stl/ |
| _tree.c | 414 iterator __j = iterator(__y); local
416 if (__j == begin())
419 --__j;
421 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__val))) {
424 return pair<iterator,bool>(__j, false);
|
| _algo.c | 468 for (_Distance __j = 0; __j < __l/__d; __j++) {
480 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
1877 _BidirectionalIter __j = __last; local
1928 _BidirectionalIter __j = __last; local
[all...] |
| _list.h | 611 iterator __j = __i; local
612 ++__j;
613 if (__pos == __i || __pos == __j) return;
615 _STLP_PRIV _List_global_inst::_Transfer(__pos._M_node, __i._M_node, __j._M_node);
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 414 iterator __j = iterator(__y); local
416 if (__j == begin())
419 --__j;
421 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__val))) {
424 return pair<iterator,bool>(__j, false);
|
| _algo.c | 468 for (_Distance __j = 0; __j < __l/__d; __j++) {
480 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
1877 _BidirectionalIter __j = __last; local
1928 _BidirectionalIter __j = __last; local
[all...] |
| _list.h | 611 iterator __j = __i; local
612 ++__j;
613 if (__pos == __i || __pos == __j) return;
615 _STLP_PRIV _List_global_inst::_Transfer(__pos._M_node, __i._M_node, __j._M_node);
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 414 iterator __j = iterator(__y); local
416 if (__j == begin())
419 --__j;
421 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__val))) {
424 return pair<iterator,bool>(__j, false);
|
| _algo.c | 468 for (_Distance __j = 0; __j < __l/__d; __j++) {
480 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
1877 _BidirectionalIter __j = __last; local
1928 _BidirectionalIter __j = __last; local
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 414 iterator __j = iterator(__y); local
416 if (__j == begin())
419 --__j;
421 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__val))) {
424 return pair<iterator,bool>(__j, false);
|
| _algo.c | 468 for (_Distance __j = 0; __j < __l/__d; __j++) {
480 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
1877 _BidirectionalIter __j = __last; local
1928 _BidirectionalIter __j = __last; local
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 414 iterator __j = iterator(__y); local
416 if (__j == begin())
419 --__j;
421 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__val))) {
424 return pair<iterator,bool>(__j, false);
|
| _algo.c | 468 for (_Distance __j = 0; __j < __l/__d; __j++) {
480 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
1877 _BidirectionalIter __j = __last; local
1928 _BidirectionalIter __j = __last; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 414 iterator __j = iterator(__y); local
416 if (__j == begin())
419 --__j;
421 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__val))) {
424 return pair<iterator,bool>(__j, false);
|
| _algo.c | 468 for (_Distance __j = 0; __j < __l/__d; __j++) {
480 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
1877 _BidirectionalIter __j = __last; local
1928 _BidirectionalIter __j = __last; local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| locale_facets.h | 124 for (int __j = 0; __j < __len; __j++, ++__s)
125 *__s = __ws[__j];
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| regex_nfa.h | 74 virtual void _M_set_pos(int __i, int __j, const _PatternCursor& __p) = 0;
|
| stl_list.h | 1270 iterator __j = __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/ |
| regex_nfa.h | 74 virtual void _M_set_pos(int __i, int __j, const _PatternCursor& __p) = 0;
|
| stl_list.h | 1270 iterator __j = __i; local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| locale_facets.h | 124 for (int __j = 0; __j < __len; __j++, ++__s)
125 *__s = __ws[__j];
[all...] |
