| /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);
|
| _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);
|
| _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...] |
| _rope.c | 193 int __j = __curr_depth + 1 - _S_path_cache_len; local
195 if (__j < 0) __j = 0;
196 while (__j <= __curr_depth) {
197 __x._M_path_end._M_data[++__i] = __path[__j++];
[all...] |
| /prebuilts/ndk/current/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);
|
| _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);
|
| _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...] |
| _rope.c | 193 int __j = __curr_depth + 1 - _S_path_cache_len; local
195 if (__j < 0) __j = 0;
196 while (__j <= __curr_depth) {
197 __x._M_path_end._M_data[++__i] = __path[__j++];
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| random_shuffle.h | 374 int __j = __pus[__i]._M_bins_begin = __bin_cursor; local
381 for (; __j < __bin_cursor; ++__j)
382 __sd._M_bin_proc[__j] = __i;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| random_shuffle.h | 374 int __j = __pus[__i]._M_bins_begin = __bin_cursor; local
381 for (; __j < __bin_cursor; ++__j)
382 __sd._M_bin_proc[__j] = __i;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| random_shuffle.h | 374 int __j = __pus[__i]._M_bins_begin = __bin_cursor; local
381 for (; __j < __bin_cursor; ++__j)
382 __sd._M_bin_proc[__j] = __i;
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| random_shuffle.h | 374 int __j = __pus[__i]._M_bins_begin = __bin_cursor; local
381 for (; __j < __bin_cursor; ++__j)
382 __sd._M_bin_proc[__j] = __i;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_list.h | 1283 iterator __j = __i; local
[all...] |
| stl_algo.h | 3679 _BidirectionalIterator __j = __last; local
3737 _BidirectionalIterator __j = __last; local
3792 _BidirectionalIterator __j = __last; local
3850 _BidirectionalIterator __j = __last; local
[all...] |
| stl_tree.h | 1327 iterator __j = iterator(__y); local
1792 iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); local
1805 const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_list.h | 1283 iterator __j = __i; local
[all...] |
| stl_algo.h | 3679 _BidirectionalIterator __j = __last; local
3737 _BidirectionalIterator __j = __last; local
3792 _BidirectionalIterator __j = __last; local
3850 _BidirectionalIterator __j = __last; local
[all...] |
| stl_tree.h | 1327 iterator __j = iterator(__y); local
1792 iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); local
1805 const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_list.h | 1283 iterator __j = __i; local
[all...] |
| stl_algo.h | 3679 _BidirectionalIterator __j = __last; local
3737 _BidirectionalIterator __j = __last; local
3792 _BidirectionalIterator __j = __last; local
3850 _BidirectionalIterator __j = __last; local
[all...] |
| stl_tree.h | 1327 iterator __j = iterator(__y); local
1792 iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); local
1805 const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/ |
| ropeimpl.h | 175 int __j = __curr_depth + 1 - int(_S_path_cache_len); local
177 if (__j < 0) __j = 0;
178 while (__j <= __curr_depth)
179 __x._M_path_end[++__i] = __path[__j++];
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/ |
| ropeimpl.h | 175 int __j = __curr_depth + 1 - int(_S_path_cache_len); local
177 if (__j < 0) __j = 0;
178 while (__j <= __curr_depth)
179 __x._M_path_end[++__i] = __path[__j++];
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/ |
| ropeimpl.h | 175 int __j = __curr_depth + 1 - int(_S_path_cache_len); local
177 if (__j < 0) __j = 0;
178 while (__j <= __curr_depth)
179 __x._M_path_end[++__i] = __path[__j++];
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/ |
| ropeimpl.h | 175 int __j = __curr_depth + 1 - int(_S_path_cache_len); local
177 if (__j < 0) __j = 0;
178 while (__j <= __curr_depth)
179 __x._M_path_end[++__i] = __path[__j++];
[all...] |
