Home
last modified time | relevance | path

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

/external/libcxx/src/
Dvalarray.cpp39 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init() local
40 __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/
Dfunctional281 difference_type __j = __pattern_length_;
282 while (__pred_(__first_ [__j-1], __cur [__j-1])) {
283 __j--;
285 if ( __j == 0 )
290 difference_type __k = __skip[__cur [ __j - 1 ]];
291 difference_type __m = __j - __k - 1;
292 if (__k < __j && __m > __suffix[ __j ])
295 __cur += __suffix[ __j ];
338 const std::size_t __j = __count - __scratch[__i];
341 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))
1320 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1321 if (__pred(*__i, *__j))
1327 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1328 if (__pred(*__i, *__j))
1385 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1386 if (__pred(*__i, *__j))
1392 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1393 if (__pred(*__i, *__j))
[all …]
Dforward_list1079 iterator __j = _VSTD::next(__i);
1081 for (; __j != __e && __f != __l; ++__i, (void) ++__j, ++__f)
1082 *__j = *__f;
1083 if (__j == __e)
1094 iterator __j = _VSTD::next(__i);
1096 for (; __j != __e && __n > 0; --__n, ++__i, ++__j)
1097 *__j = __v;
1098 if (__j == __e)
1515 iterator __j = _VSTD::next(__i, 2);
1516 for (; __j != __e && *__j == __v; ++__j)
[all …]
Dvalarray716 result_type operator[](size_t __j) const
718 ptrdiff_t __i = static_cast<ptrdiff_t>(__j);
1682 size_t __j = 0;
1683 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1684 __vp_[*__i] = __v[__j];
1698 size_t __j = 0;
1699 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1700 __vp_[*__i] *= __v[__j];
1714 size_t __j = 0;
1715 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
[all …]
Dlist2066 iterator* __j = static_cast<iterator*>((*__ip)->__i_);
2067 if (__j->__ptr_ == __f)
2120 iterator* __j = static_cast<iterator*>((*__ip)->__i_);
2124 if (__j->__ptr_ == __k)
2147 const_iterator __j = _VSTD::next(__i);
2148 for (; __j != __e && *__j == __x; ++__j)
2150 __deleted_nodes.splice(__deleted_nodes.end(), *this, __i, __j);
2151 __i = __j;
2169 iterator __j = _VSTD::next(__i);
2170 for (; __j != __e && __pred(*__j); ++__j)
[all …]
Drandom2377 const size_t __j = (__i_ + 1) % __n;
2380 const result_type _Yp = (__x_[__i_] & ~__mask) | (__x_[__j] & __mask);
2384 __i_ = __j;
2403 size_t __j = _VSTD::min(_Np - __x.__i_, _Np - __y.__i_);
2404 if (!_VSTD::equal(__x.__x_ + __x.__i_, __x.__x_ + __x.__i_ + __j,
2408 return _VSTD::equal(__x.__x_ + __j, __x.__x_ + _Np, __y.__x_);
2409 return _VSTD::equal(__x.__x_, __x.__x_ + (_Np - __j), __y.__x_ + __j);
2413 size_t __j = _Np - __y.__i_;
2414 if (!_VSTD::equal(__x.__x_ + __x.__i_, __x.__x_ + (__x.__i_ + __j),
2417 if (!_VSTD::equal(__x.__x_ + (__x.__i_ + __j), __x.__x_ + _Np,
[all …]
Dcharconv252 int __j = digits - 1;
261 __a = __inner_product(__cprod + __i + 1, __cprod + __j, __pow() + 1,
263 if (__mul_overflowed(__cprod[__j], __pow()[__j - __i], __b))
D__hash_table2747 iterator __j = __i;
2749 ++__j;
2750 return pair<iterator, iterator>(__i, __j);
2761 const_iterator __j = __i;
2763 ++__j;
2764 return pair<const_iterator, const_iterator>(__i, __j);
2775 iterator __j = __i;
2781 ++__j;
2782 } while (__j != __e && key_eq()(*__j, __k));
2784 return pair<iterator, iterator>(__i, __j);
[all …]
Ddeque2199 for (_BiIter __j = __m; __j != __f; --__base::__start_, ++__base::size())
2200 __alloc_traits::construct(__a, _VSTD::addressof(*--__i), *--__j);
2206 for (iterator __j = __obn; __j != __old_begin;)
2208 __alloc_traits::construct(__a, _VSTD::addressof(*--__i), _VSTD::move(*--__j));
2230 for (_BiIter __j = __m; __j != __l; ++__i, (void) ++__j, ++__base::size())
2231 __alloc_traits::construct(__a, _VSTD::addressof(*__i), *__j);
2237 for (iterator __j = __oen; __j != __old_end; ++__i, ++__j, ++__base::size())
2238 __alloc_traits::construct(__a, _VSTD::addressof(*__i), _VSTD::move(*__j));
2727 // for (iterator __j = __l; __j != __f;)
2729 // __alloc_traitsconstruct(__a, _VSTD::addressof(*--__r), _VSTD::move(*--__j));
Dunordered_set963 const_iterator __j = __y.find(*__i);
964 if (__j == __ey || !(*__i == *__j))
Dunordered_map1654 const_iterator __j = __y.find(__i->first);
1655 if (__j == __ey || !(*__i == *__j))
Dregex5754 ptrdiff_t __j = 0;
5815 __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);