Home
last modified time | relevance | path

Searched refs:__w (Results 1 – 12 of 12) sorted by relevance

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_tree.c216 _Rb_tree_node_base* __w = __x_parent->_M_right; in _Rebalance_for_erase() local
217 if (__w->_M_color == _S_rb_tree_red) { in _Rebalance_for_erase()
218 __w->_M_color = _S_rb_tree_black; in _Rebalance_for_erase()
221 __w = __x_parent->_M_right; in _Rebalance_for_erase()
223 if ((__w->_M_left == 0 || in _Rebalance_for_erase()
224 __w->_M_left->_M_color == _S_rb_tree_black) && (__w->_M_right == 0 || in _Rebalance_for_erase()
225 __w->_M_right->_M_color == _S_rb_tree_black)) { in _Rebalance_for_erase()
226 __w->_M_color = _S_rb_tree_red; in _Rebalance_for_erase()
230 if (__w->_M_right == 0 || in _Rebalance_for_erase()
231 __w->_M_right->_M_color == _S_rb_tree_black) { in _Rebalance_for_erase()
[all …]
D_string_io.c45 const streamsize __w = __os.width(0); variable
48 … __need_pad = (((sizeof(streamsize) > sizeof(size_t)) && (__STATIC_CAST(streamsize, __n) < __w)) ||
49 … ((sizeof(streamsize) <= sizeof(size_t)) && (__n < __STATIC_CAST(size_t, __w))));
50 streamsize __pad_len = __need_pad ? __w - __n : 0;
D_rope.c853 streamsize __w = __o.width(); in _S_io_get() local
858 …_pad = (((sizeof(streamsize) > sizeof(size_t)) && (__STATIC_CAST(streamsize, __rope_len) < __w)) || in _S_io_get()
859 … ((sizeof(streamsize) <= sizeof(size_t)) && (__rope_len < __STATIC_CAST(size_t, __w)))); in _S_io_get()
860 streamsize __pad_len = __need_pad ? __w - __rope_len : 0; in _S_io_get()
875 streamsize __w = __o.width(); in _S_io_get() local
879 __o.width(__w /__rope_len); in _S_io_get()
882 __o.width(__w); in _S_io_get()
884 _STLP_UNWIND(__o.width(__w)) in _S_io_get()
/ndk/sources/android/support/src/msun/
Dmath_private.h322 __typeof(a) __s, __w; \
324 __w = (a) + (b); \
325 __s = __w - (a); \
326 (b) = ((a) - (__w - __s)) + ((b) - __s); \
327 (a) = __w; \
360 __typeof(a) __w; \
367 __w = (a) + (b); \
368 (b) = ((a) - __w) + (b); \
369 (a) = __w; \
380 __typeof(a) __w; \
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
D__tree330 // __w is __x's possibly null uncle (will become __x's sibling)
331 _NodePtr __w = nullptr;
332 // link __x to __y's parent, and find __w
339 __w = __y->__parent_->__right_;
341 __root = __x; // __w == nullptr
347 __w = __y->__parent_->__left_;
351 // but copy __z's color. This does not impact __x or __w.
390 // be null. __w can not be null here, else the parent would
392 // of 1 on the __w side (__w must be a non-null black or a red
396 if (!__tree_is_left_child(__w)) // if x is left child
[all …]
Dcwctype164 …e _LIBCPP_INLINE_VISIBILITY int __libcpp_iswctype(wint_t __w, wctype_t __d) {return iswctype(__w, …
166 …nline _LIBCPP_INLINE_VISIBILITY int iswctype(wint_t __w, wctype_t __d) {return __libcpp_iswctype(_…
Drandom2011 template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
2053 template <class _UIntType, size_t __w, size_t __n, size_t __m, size_t __r,
2069 static_assert(__w <= _Dt, "mersenne_twister_engine invalid parameters");
2070 static_assert( 2 <= __w, "mersenne_twister_engine invalid parameters");
2071 static_assert(__r <= __w, "mersenne_twister_engine invalid parameters");
2072 static_assert(__u <= __w, "mersenne_twister_engine invalid parameters");
2073 static_assert(__s <= __w, "mersenne_twister_engine invalid parameters");
2074 static_assert(__t <= __w, "mersenne_twister_engine invalid parameters");
2075 static_assert(__l <= __w, "mersenne_twister_engine invalid parameters");
2078 static _LIBCPP_CONSTEXPR const result_type _Max = __w == _Dt ? result_type(~0) :
[all …]
Dcomplex260 template<class _Tp> complex<_Tp> operator*(const complex<_Tp>& __z, const complex<_Tp>& __w);
587 operator*(const complex<_Tp>& __z, const complex<_Tp>& __w)
591 _Tp __c = __w.real();
592 _Tp __d = __w.imag();
666 operator/(const complex<_Tp>& __z, const complex<_Tp>& __w)
671 _Tp __c = __w.real();
672 _Tp __d = __w.imag();
Dlocale2027 void __get_weekday(int& __w,
2031 void __get_day_year_num(int& __w,
2045 time_get<_CharT, _InputIterator>::__get_weekdayname(int& __w,
2054 __w = __i % 7;
2187 time_get<_CharT, _InputIterator>::__get_weekday(int& __w,
2194 __w = __t;
3235 for (const char_type* __w = __wb.get(); __w < __wn; ++__w, ++__nc)
3236 *__nc = __src[find(__atoms, _VSTD::end(__atoms), *__w) - __atoms];
3268 char_type* __w;
3269 for (__w = __wb.get(); __w < __wn-1; ++__w)
[all …]
Dmemory3192 _Size __w, _Size __x, _Size __y, _Size __z, _Size __a, _Size __b) {
3193 __a += __w;
3263 pair<_Size, _Size> __w = __weak_hash_len_32_with_seeds(__s + __len - 32, __y + __k1, __x);
3271 __x ^= __w.second;
3273 __z = __rotate(__z + __w.first, 33) * __k1;
3274 __v = __weak_hash_len_32_with_seeds(__s, __v.second * __k1, __x + __w.first);
3275 __w = __weak_hash_len_32_with_seeds(__s + 32, __z + __w.second,
3282 __hash_len_16(__v.first, __w.first) + __shift_mix(__y) * __k1 + __z,
3283 __hash_len_16(__v.second, __w.second) + __x);
5350 atomic_compare_exchange_strong(shared_ptr<_Tp>* __p, shared_ptr<_Tp>* __v, shared_ptr<_Tp> __w)
[all …]
Diterator1202 {__wrap_iter __w(*this); __w += __n; return __w;}
Dalgorithm2862 __independent_bits_engine(_Engine& __e, size_t __w);
2874 ::__independent_bits_engine(_Engine& __e, size_t __w)
2876 __w_(__w)
3026 size_t __w = _Dt - __clz(_Rp) - 1;
3027 if ((_Rp & (_UIntType(~0) >> (_Dt - __w))) != 0)
3028 ++__w;
3029 _Eng __e(__g, __w);