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.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()
/external/libcxx/include/
D__debug109 const iterator* __j = static_cast<const iterator*>(__i);
111 return _Cp->__dereferenceable(__j);
119 const iterator* __j = static_cast<const iterator*>(__i);
121 return _Cp->__decrementable(__j);
129 const iterator* __j = static_cast<const iterator*>(__i);
131 return _Cp->__addable(__j, __n);
139 const iterator* __j = static_cast<const iterator*>(__i);
141 return _Cp->__subscriptable(__j, __n);
203 bool __less_than_comparable(const void* __i, const void* __j) const;
Dalgorithm1051 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1052 if (__pred(*__first1, *__j))
1286 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1287 if (__pred(*__j, *__i))
1292 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1293 if (__pred(*__i, *__j))
1299 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1300 if (__pred(*__i, *__j))
1349 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1350 if (__pred(*__j, *__i))
[all …]
Dforward_list972 iterator __j = _VSTD::next(__i);
974 for (; __j != __e && __f != __l; ++__i, (void) ++__j, ++__f)
975 *__j = *__f;
976 if (__j == __e)
987 iterator __j = _VSTD::next(__i);
989 for (; __j != __e && __n > 0; --__n, ++__i, ++__j)
990 *__j = __v;
991 if (__j == __e)
1410 iterator __j = _VSTD::next(__i, 2);
1411 for (; __j != __e && *__j == __v; ++__j)
[all …]
Dvalarray715 result_type operator[](size_t __j) const
717 ptrdiff_t __i = static_cast<ptrdiff_t>(__j);
1609 size_t __j = 0;
1610 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1611 __vp_[*__i] = __v[__j];
1625 size_t __j = 0;
1626 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1627 __vp_[*__i] *= __v[__j];
1641 size_t __j = 0;
1642 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
[all …]
Dlist1962 iterator* __j = static_cast<iterator*>((*__p)->__i_);
1963 if (__j->__ptr_ == __f)
2016 iterator* __j = static_cast<iterator*>((*__p)->__i_);
2020 if (__j->__ptr_ == __k)
2043 const_iterator __j = _VSTD::next(__i);
2044 for (; __j != __e && *__j == __x; ++__j)
2046 __deleted_nodes.splice(__deleted_nodes.end(), *this, __i, __j);
2047 __i = __j;
2065 iterator __j = _VSTD::next(__i);
2066 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_table2295 iterator __j = __i;
2297 ++__j;
2298 return pair<iterator, iterator>(__i, __j);
2309 const_iterator __j = __i;
2311 ++__j;
2312 return pair<const_iterator, const_iterator>(__i, __j);
2323 iterator __j = __i;
2329 ++__j;
2330 } while (__j != __e && key_eq()(*__j, __k));
2332 return pair<iterator, iterator>(__i, __j);
[all …]
Ddeque2126 for (_BiIter __j = __m; __j != __f; --__base::__start_, ++__base::size())
2127 __alloc_traits::construct(__a, _VSTD::addressof(*--__i), *--__j);
2133 for (iterator __j = __obn; __j != __old_begin;)
2135 __alloc_traits::construct(__a, _VSTD::addressof(*--__i), _VSTD::move(*--__j));
2157 for (_BiIter __j = __m; __j != __l; ++__i, (void) ++__j, ++__base::size())
2158 __alloc_traits::construct(__a, _VSTD::addressof(*__i), *__j);
2164 for (iterator __j = __oen; __j != __old_end; ++__i, ++__j, ++__base::size())
2165 __alloc_traits::construct(__a, _VSTD::addressof(*__i), _VSTD::move(*__j));
2649 // for (iterator __j = __l; __j != __f;)
2651 // __alloc_traitsconstruct(__a, _VSTD::addressof(*--__r), _VSTD::move(*--__j));
Dunordered_set853 const_iterator __j = __y.find(*__i);
854 if (__j == __ey || !(*__i == *__j))
Dunordered_map1604 const_iterator __j = __y.find(__i->first);
1605 if (__j == __ey || !(*__i == *__j))
Dregex5667 ptrdiff_t __j = 0;
5710 __j += __s.__current_ - __current;
/external/libcxx/include/ext/
Dhash_set418 const_iterator __j = __y.find(*__i);
419 if (__j == __ey || !(*__i == *__j))
Dhash_map732 const_iterator __j = __y.find(__i->first);
733 if (__j == __ey || !(*__i == *__j))
/external/opencv3/modules/videoio/src/
Dcap_msmf.cpp138 unsigned char __j; member
146 inline Guid::Guid() : __a(0), __b(0), __c(0), __d(0), __e(0), __f(0), __g(0), __h(0), __i(0), __j(0… in Guid()
160 __j(reinterpret_cast<const __s_GUID&>(__guid).Data4[6]), in Guid()
224 …(__dArg), __e(__eArg), __f(__fArg), __g(__gArg), __h(__hArg), __i(__iArg), __j(__jArg), __k(__kArg) in Guid()
237 __j = __dArg[6]; in Guid()
/external/clang/www/
Dlibstdc++4.4-clang0x.patch178 this->_M_transfer(__position, __i, __j);