Home
last modified time | relevance | path

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

/ndk/sources/cxx-stl/llvm-libc++/libcxx/src/
Dvalarray.cpp41 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init() local
42 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1); in __init()
Ddebug.cpp415 __libcpp_db::__less_than_comparable(const void* __i, const void* __j) const in __less_than_comparable()
421 __i_node* j = __find_iterator(__j); in __less_than_comparable()
/ndk/sources/cxx-stl/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];
1768 void insert(size_t __p, const _CharT* __i, const _CharT* __j) {
1769 _Self __r(__i, __j);
1774 const const_iterator& __j) {
1775 _Self __r(__i, __j);
1780 const iterator& __j) {
1781 _Self __r(__i, __j);
1808 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;
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
D__debug105 const iterator* __j = static_cast<const iterator*>(__i);
107 return _Cp->__dereferenceable(__j);
115 const iterator* __j = static_cast<const iterator*>(__i);
117 return _Cp->__decrementable(__j);
125 const iterator* __j = static_cast<const iterator*>(__i);
127 return _Cp->__addable(__j, __n);
135 const iterator* __j = static_cast<const iterator*>(__i);
137 return _Cp->__subscriptable(__j, __n);
199 bool __less_than_comparable(const void* __i, const void* __j) const;
Dalgorithm1049 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1050 if (__pred(*__first1, *__j))
1274 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1275 if (__pred(*__j, *__i))
1280 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1281 if (__pred(*__i, *__j))
1287 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1288 if (__pred(*__i, *__j))
1337 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1338 if (__pred(*__j, *__i))
[all …]
Dforward_list992 iterator __j = _VSTD::next(__i);
994 for (; __j != __e && __f != __l; ++__i, ++__j, ++__f)
995 *__j = *__f;
996 if (__j == __e)
1007 iterator __j = _VSTD::next(__i);
1009 for (; __j != __e && __n > 0; --__n, ++__i, ++__j)
1010 *__j = __v;
1011 if (__j == __e)
1429 iterator __j = _VSTD::next(__i, 2);
1430 for (; __j != __e && *__j == __v; ++__j)
[all …]
Dvalarray713 result_type operator[](size_t __j) const
715 ptrdiff_t __i = static_cast<ptrdiff_t>(__j);
1606 size_t __j = 0;
1607 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1608 __vp_[*__i] = __v[__j];
1622 size_t __j = 0;
1623 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1624 __vp_[*__i] *= __v[__j];
1638 size_t __j = 0;
1639 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
[all …]
Dlist1965 iterator* __j = static_cast<iterator*>((*__p)->__i_);
1966 if (__j->__ptr_ == __f)
2019 iterator* __j = static_cast<iterator*>((*__p)->__i_);
2023 if (__j->__ptr_ == __k)
2045 iterator __j = _VSTD::next(__i);
2046 for (; __j != __e && *__j == __x; ++__j)
2048 __i = erase(__i, __j);
2064 iterator __j = _VSTD::next(__i);
2065 for (; __j != __e && __pred(*__j); ++__j)
2067 __i = erase(__i, __j);
[all …]
Drandom2374 const size_t __j = (__i_ + 1) % __n;
2377 const result_type _Yp = (__x_[__i_] & ~__mask) | (__x_[__j] & __mask);
2381 __i_ = __j;
2400 size_t __j = _VSTD::min(_Np - __x.__i_, _Np - __y.__i_);
2401 if (!_VSTD::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j,
2405 return _VSTD::equal(__x.__x_ + __j, __x.__x_ + _Np, __y.__x_);
2406 return _VSTD::equal(__x.__x_, __x.__x_ + (_Np - __j), __y.__x_ + __j);
2410 size_t __j = _Np - __y.__i_;
2411 if (!_VSTD::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j),
2414 if (!_VSTD::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Np,
[all …]
D__hash_table2301 iterator __j = __i;
2303 ++__j;
2304 return pair<iterator, iterator>(__i, __j);
2315 const_iterator __j = __i;
2317 ++__j;
2318 return pair<const_iterator, const_iterator>(__i, __j);
2329 iterator __j = __i;
2335 ++__j;
2336 } while (__j != __e && key_eq()(*__j, __k));
2338 return pair<iterator, iterator>(__i, __j);
[all …]
Ddeque2131 for (_BiIter __j = __m; __j != __f; --__base::__start_, ++__base::size())
2132 __alloc_traits::construct(__a, _VSTD::addressof(*--__i), *--__j);
2138 for (iterator __j = __obn; __j != __old_begin;)
2140 __alloc_traits::construct(__a, _VSTD::addressof(*--__i), _VSTD::move(*--__j));
2163 for (_BiIter __j = __m; __j != __l; ++__i, ++__j, ++__base::size())
2164 __alloc_traits::construct(__a, _VSTD::addressof(*__i), *__j);
2170 for (iterator __j = __oen; __j != __old_end; ++__i, ++__j, ++__base::size())
2171 __alloc_traits::construct(__a, _VSTD::addressof(*__i), _VSTD::move(*__j));
2665 // for (iterator __j = __l; __j != __f;)
2667 // __alloc_traitsconstruct(__a, _VSTD::addressof(*--__r), _VSTD::move(*--__j));
Dunordered_set853 const_iterator __j = __y.find(*__i);
854 if (__j == __ey || !(*__i == *__j))
Dunordered_map1432 const_iterator __j = __y.find(__i->first);
1433 if (__j == __ey || !(*__i == *__j))
Dregex5748 ptrdiff_t __j = 0;
5786 __j += __s.__current_ - __current;
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ext/
Dhash_set418 const_iterator __j = __y.find(*__i);
419 if (__j == __ey || !(*__i == *__j))
Dhash_map739 const_iterator __j = __y.find(__i->first);
740 if (__j == __ey || !(*__i == *__j))
/ndk/sources/cxx-stl/llvm-libc++/patches.android/
D0013-temp-collective-ndk-hackathon-fixes.patch533 __libcpp_db::__less_than_comparable(const void* __i, const void* __j) const
539 __i_node* j = __find_iterator(__j);
541 @@ -391,7 +427,9 @@ __libcpp_db::__less_than_comparable(const void* __i, const void* __j) const