| /external/stlport/stlport/stl/ |
| _bitset.c | 93 for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) {
97 return __i*__BITS_PER_WORD + __j*CHAR_BIT +
130 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); ++__j ) {
134 return __i*__BITS_PER_WORD + __j*CHAR_BIT +
147 for ( size_t __j = 0; __j < sizeof(_WordT); ++__j )
[all...] |
| _rope.h | 259 size_t __j = 0; local
260 for (; __j < __len; __i++, __j++) {
261 _M_buffer[__i] = __s[__j];
[all...] |
| _bitset.h | 281 for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) {
285 return __j*CHAR_BIT + _Bs_G::_S_first_one(__this_byte);
314 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); __j++ ) {
318 return __j*CHAR_BIT + _Bs_G::_S_first_one(__this_byte);
391 // for b[i] = b[__j];
392 reference& operator=(const reference& __j) {
[all...] |
| _deque.c | 754 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j)
755 this->_M_map_size.deallocate(*(this->_M_start._M_node - __j), this->buffer_size()))
768 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j)
769 this->_M_map_size.deallocate(*(this->_M_finish._M_node + __j), this->buffer_size()))
|
| _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);
|
| concept_checks.h | 470 __difference_operator_requirement_violation(_Iterator __i, _Iterator __j,
472 __n = __i - __j;
|
| _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...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _bitset.c | 93 for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) {
97 return __i*__BITS_PER_WORD + __j*CHAR_BIT +
130 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); ++__j ) {
134 return __i*__BITS_PER_WORD + __j*CHAR_BIT +
147 for ( size_t __j = 0; __j < sizeof(_WordT); ++__j )
[all...] |
| _rope.h | 259 size_t __j = 0; local
260 for (; __j < __len; __i++, __j++) {
261 _M_buffer[__i] = __s[__j];
[all...] |
| _bitset.h | 281 for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) {
285 return __j*CHAR_BIT + _Bs_G::_S_first_one(__this_byte);
314 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); __j++ ) {
318 return __j*CHAR_BIT + _Bs_G::_S_first_one(__this_byte);
391 // for b[i] = b[__j];
392 reference& operator=(const reference& __j) {
[all...] |
| _deque.c | 754 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j)
755 this->_M_map_size.deallocate(*(this->_M_start._M_node - __j), this->buffer_size()))
768 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j)
769 this->_M_map_size.deallocate(*(this->_M_finish._M_node + __j), this->buffer_size()))
|
| _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);
|
| concept_checks.h | 470 __difference_operator_requirement_violation(_Iterator __i, _Iterator __j,
472 __n = __i - __j;
|
| _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...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| valarray_array.h | 243 for (size_t __j = 0; __j < __n; ++__j, ++__i)
315 for (size_t __j = 0; __j < __n; ++__j, ++__b, ++__i)
325 for (size_t __j = 0; __j < __n; ++__j, ++__a, ++__i)
330 // another indexed array __dst[<__j>]
[all...] |
| stl_tree.h | 1201 iterator __j = iterator(__y); local
1449 iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); local
1462 const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k); local
[all...] |
| 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...] |
| locale_facets.h | 124 for (int __j = 0; __j < __len; __j++, ++__s)
125 *__s = __ws[__j];
[all...] |
| stl_algo.h | 3641 _BidirectionalIterator __j = __last; local
3699 _BidirectionalIterator __j = __last; local
3754 _BidirectionalIterator __j = __last; local
3812 _BidirectionalIterator __j = __last; local
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
| ropeimpl.h | 174 int __j = __curr_depth + 1 - int(_S_path_cache_len); local
176 if (__j < 0) __j = 0;
177 while (__j <= __curr_depth)
178 __x._M_path_end[++__i] = __path[__j++];
[all...] |
