Home
last modified time | relevance | path

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

/external/libcxx/src/
Dvalarray.cpp42 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init() local
43 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1); in __init()
Ddebug.cpp472 __libcpp_db::__less_than_comparable(const void* __i, const void* __j) const in __less_than_comparable()
478 __i_node* j = __find_iterator(__j); in __less_than_comparable()
/external/libcxx/include/experimental/
Dfunctional280 difference_type __j = __pattern_length_;
281 while (__pred_(__first_ [__j-1], __cur [__j-1])) {
282 __j--;
284 if ( __j == 0 )
289 difference_type __k = __skip[__cur [ __j - 1 ]];
290 difference_type __m = __j - __k - 1;
291 if (__k < __j && __m > __suffix[ __j ])
294 __cur += __suffix[ __j ];
337 const std::size_t __j = __count - __scratch[__i];
340 if (__suffix[__j] > __k)
[all …]
/external/libcxx/include/
D__debug189 const iterator* __j = static_cast<const iterator*>(__i);
191 return _Cp->__dereferenceable(__j);
199 const iterator* __j = static_cast<const iterator*>(__i);
201 return _Cp->__decrementable(__j);
209 const iterator* __j = static_cast<const iterator*>(__i);
211 return _Cp->__addable(__j, __n);
219 const iterator* __j = static_cast<const iterator*>(__i);
221 return _Cp->__subscriptable(__j, __n);
283 bool __less_than_comparable(const void* __i, const void* __j) const;
Dalgorithm1077 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1078 if (__pred(*__first1, *__j))
1312 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1313 if (__pred(*__j, *__i))
1318 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1319 if (__pred(*__i, *__j))
1325 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1326 if (__pred(*__i, *__j))
1375 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1376 if (__pred(*__j, *__i))
[all …]
Dforward_list1068 iterator __j = _VSTD::next(__i);
1070 for (; __j != __e && __f != __l; ++__i, (void) ++__j, ++__f)
1071 *__j = *__f;
1072 if (__j == __e)
1083 iterator __j = _VSTD::next(__i);
1085 for (; __j != __e && __n > 0; --__n, ++__i, ++__j)
1086 *__j = __v;
1087 if (__j == __e)
1514 iterator __j = _VSTD::next(__i, 2);
1515 for (; __j != __e && *__j == __v; ++__j)
[all …]
Dvalarray714 result_type operator[](size_t __j) const
716 ptrdiff_t __i = static_cast<ptrdiff_t>(__j);
1680 size_t __j = 0;
1681 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1682 __vp_[*__i] = __v[__j];
1696 size_t __j = 0;
1697 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1698 __vp_[*__i] *= __v[__j];
1712 size_t __j = 0;
1713 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
[all …]
Dlist2044 iterator* __j = static_cast<iterator*>((*__ip)->__i_);
2045 if (__j->__ptr_ == __f)
2098 iterator* __j = static_cast<iterator*>((*__ip)->__i_);
2102 if (__j->__ptr_ == __k)
2125 const_iterator __j = _VSTD::next(__i);
2126 for (; __j != __e && *__j == __x; ++__j)
2128 __deleted_nodes.splice(__deleted_nodes.end(), *this, __i, __j);
2129 __i = __j;
2147 iterator __j = _VSTD::next(__i);
2148 for (; __j != __e && __pred(*__j); ++__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_table2510 iterator __j = __i;
2512 ++__j;
2513 return pair<iterator, iterator>(__i, __j);
2524 const_iterator __j = __i;
2526 ++__j;
2527 return pair<const_iterator, const_iterator>(__i, __j);
2538 iterator __j = __i;
2544 ++__j;
2545 } while (__j != __e && key_eq()(*__j, __k));
2547 return pair<iterator, iterator>(__i, __j);
[all …]
Ddeque2193 for (_BiIter __j = __m; __j != __f; --__base::__start_, ++__base::size())
2194 __alloc_traits::construct(__a, _VSTD::addressof(*--__i), *--__j);
2200 for (iterator __j = __obn; __j != __old_begin;)
2202 __alloc_traits::construct(__a, _VSTD::addressof(*--__i), _VSTD::move(*--__j));
2224 for (_BiIter __j = __m; __j != __l; ++__i, (void) ++__j, ++__base::size())
2225 __alloc_traits::construct(__a, _VSTD::addressof(*__i), *__j);
2231 for (iterator __j = __oen; __j != __old_end; ++__i, ++__j, ++__base::size())
2232 __alloc_traits::construct(__a, _VSTD::addressof(*__i), _VSTD::move(*__j));
2716 // for (iterator __j = __l; __j != __f;)
2718 // __alloc_traitsconstruct(__a, _VSTD::addressof(*--__r), _VSTD::move(*--__j));
Dunordered_set858 const_iterator __j = __y.find(*__i);
859 if (__j == __ey || !(*__i == *__j))
Dunordered_map1494 const_iterator __j = __y.find(__i->first);
1495 if (__j == __ey || !(*__i == *__j))
Dregex5709 ptrdiff_t __j = 0;
5764 __j += __s.__current_ - __current;
/external/libcxx/include/ext/
Dhash_set419 const_iterator __j = __y.find(*__i);
420 if (__j == __ey || !(*__i == *__j))
Dhash_map721 const_iterator __j = __y.find(__i->first);
722 if (__j == __ey || !(*__i == *__j))
/external/clang/www/
Dlibstdc++4.4-clang0x.patch178 this->_M_transfer(__position, __i, __j);