Home
last modified time | relevance | path

Searched refs:__j (Results 1 – 9 of 9) sorted by relevance

/external/stlport/stlport/stl/
D_bitset.c93 for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) { in _M_do_find_first() local
97 return __i*__BITS_PER_WORD + __j*CHAR_BIT + in _M_do_find_first()
130 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); ++__j ) { in _M_do_find_next() local
134 return __i*__BITS_PER_WORD + __j*CHAR_BIT + in _M_do_find_next()
147 for ( size_t __j = 0; __j < sizeof(_WordT); ++__j ) { in _M_do_find_next() local
151 return __i*__BITS_PER_WORD + __j*CHAR_BIT + in _M_do_find_next()
D_rope.h259 size_t __j = 0;
260 for (; __j < __len; __i++, __j++) {
261 _M_buffer[__i] = __s[__j];
1766 void insert(size_t __p, const _CharT* __i, const _CharT* __j) {
1767 _Self __r(__i, __j);
1772 const const_iterator& __j) {
1773 _Self __r(__i, __j);
1778 const iterator& __j) {
1779 _Self __r(__i, __j);
1806 const _CharT* __i, const _CharT* __j) {
[all …]
D_bitset.h281 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);
392 reference& operator=(const reference& __j) {
393 if ( (*(__j._M_wp) & _Bitset_base::_S_maskbit(__j._M_bpos)) )
D_deque.c754 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j) in _M_new_elements_at_front()
755 this->_M_map_size.deallocate(*(this->_M_start._M_node - __j), this->buffer_size())) in _M_new_elements_at_front()
768 _STLP_UNWIND(for (size_type __j = 1; __j < __i; ++__j) in _M_new_elements_at_back()
769 … this->_M_map_size.deallocate(*(this->_M_finish._M_node + __j), this->buffer_size())) in _M_new_elements_at_back()
D_tree.c414 iterator __j = iterator(__y); in insert_unique() local
416 if (__j == begin()) in insert_unique()
419 --__j; in insert_unique()
421 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__val))) { in insert_unique()
424 return pair<iterator,bool>(__j, false); in insert_unique()
D_algo.c468 for (_Distance __j = 0; __j < __l/__d; __j++) { in __rotate_aux() local
480 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) { in __rotate_aux() local
1877 _BidirectionalIter __j = __last; in __next_permutation()
1878 while (!__comp(*__i, *--__j)) {} in __next_permutation()
1879 iter_swap(__i, __j); in __next_permutation()
1928 _BidirectionalIter __j = __last; in __prev_permutation()
1929 while (!__comp(*--__j, *__i)) {} in __prev_permutation()
1930 iter_swap(__i, __j); in __prev_permutation()
D_list.h611 iterator __j = __i;
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);
D_rope.c193 int __j = __curr_depth + 1 - _S_path_cache_len; in _S_setcache() local
195 if (__j < 0) __j = 0; in _S_setcache()
196 while (__j <= __curr_depth) { in _S_setcache()
197 __x._M_path_end._M_data[++__i] = __path[__j++]; in _S_setcache()
Dconcept_checks.h470 __difference_operator_requirement_violation(_Iterator __i, _Iterator __j,
472 __n = __i - __j;