Home
last modified time | relevance | path

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

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_complex.h46 complex(const _Self& __z) in complex()
47 : _M_re(__z._M_re), _M_im(__z._M_im) {} in complex()
49 _Self& operator=(const _Self& __z) {
50 _M_re = __z._M_re;
51 _M_im = __z._M_im;
57 explicit complex(const complex<_Tp2>& __z) in complex()
58 : _M_re(__z._M_re), _M_im(__z._M_im) {} in complex()
61 _Self& operator=(const complex<_Tp2>& __z) {
62 _M_re = __z._M_re;
63 _M_im = __z._M_im;
[all …]
D_tree.c143 _Rb_global<_Dummy>::_Rebalance_for_erase(_Rb_tree_node_base* __z, in _Rebalance_for_erase() argument
147 _Rb_tree_node_base* __y = __z; in _Rebalance_for_erase()
162 if (__y != __z) { // relink y in place of z. y is z's successor in _Rebalance_for_erase()
163 __z->_M_left->_M_parent = __y; in _Rebalance_for_erase()
164 __y->_M_left = __z->_M_left; in _Rebalance_for_erase()
165 if (__y != __z->_M_right) { in _Rebalance_for_erase()
169 __y->_M_right = __z->_M_right; in _Rebalance_for_erase()
170 __z->_M_right->_M_parent = __y; in _Rebalance_for_erase()
174 if (__root == __z) in _Rebalance_for_erase()
176 else if (__z->_M_parent->_M_left == __z) in _Rebalance_for_erase()
[all …]
D_complex.c92 operator<<(basic_ostream<_CharT, _Traits>& __os, const complex<_Tp>& __z) {
97 __tmp << '(' << __z.real() << ',' << __z.imag() << ')';
107 operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __z) {
133 __z = complex<_Tp>(__re, __im);
D_function.h306 const _Operation3& __z) in binary_compose() argument
307 : _M_fn1(__x), _M_fn2(__y), _M_fn3(__z) { } in binary_compose()
D_hashtable.h402 void max_load_factor(float __z) {
403 _M_max_load_factor = __z;
D_bvector.h656 _STLP_PRIV _Bit_iterator __z(__q, 0);
657 this->_M_finish = _STLP_STD::copy(begin(), end(), __z);
D_tree.h118 static _Base_ptr _STLP_CALL _Rebalance_for_erase(_Base_ptr __z,
/ndk/sources/cxx-stl/stlport/src/
Dcomplex_io.cpp30 operator<< (basic_ostream<char, char_traits<char> >& __os, const complex<float>& __z) in operator <<() argument
31 { return __os << '(' << (double)__z.real() << ',' << (double)__z.imag() << ')'; } in operator <<()
35 operator<< (basic_ostream<char, char_traits<char> >& __os, const complex<double>& __z) in operator <<() argument
36 { return __os << '(' << __z.real() << ',' << __z.imag() << ')'; } in operator <<()
41 operator<< (basic_ostream<char, char_traits<char> >& __os, const complex<long double>& __z) in operator <<() argument
42 { return __os << '(' << __z.real() << ',' << __z.imag() << ')'; } in operator <<()
48 operator>>(basic_istream<char, char_traits<char> >& __is, complex<float>& __z) { in operator >>() argument
68 __z = complex<float>(__re, __im); in operator >>()
74 operator>>(basic_istream<char, char_traits<char> >& __is, complex<double>& __z) { in operator >>() argument
94 __z = complex<double>(__re, __im); in operator >>()
[all …]
Dcomplex.cpp40 _STLP_DECLSPEC float _STLP_CALL abs(const complex<float>& __z) in abs() argument
41 { return ::hypot(__z._M_re, __z._M_im); } in abs()
43 _STLP_DECLSPEC double _STLP_CALL abs(const complex<double>& __z) in abs() argument
44 { return ::hypot(__z._M_re, __z._M_im); } in abs()
48 _STLP_DECLSPEC long double _STLP_CALL abs(const complex<long double>& __z) in abs() argument
49 { return ::hypot(__z._M_re, __z._M_im); } in abs()
55 _STLP_DECLSPEC float _STLP_CALL arg(const complex<float>& __z) in arg() argument
56 { return ::atan2(__z._M_im, __z._M_re); } in arg()
59 _STLP_DECLSPEC double _STLP_CALL arg(const complex<double>& __z) in arg() argument
60 { return ::atan2(__z._M_im, __z._M_re); } in arg()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
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)
589 _Tp __a = __z.real();
590 _Tp __b = __z.imag();
666 operator/(const complex<_Tp>& __z, const complex<_Tp>& __w)
669 _Tp __a = __z.real();
670 _Tp __b = __z.imag();
1236 complex<_Tp> __z = log(__x + sqrt(pow(__x, _Tp(2)) + _Tp(1)));
1237 return complex<_Tp>(copysign(__z.real(), __x.real()), copysign(__z.imag(), __x.imag()));
1270 complex<_Tp> __z = log(__x + sqrt(pow(__x, _Tp(2)) - _Tp(1)));
[all …]
D__tree311 // Precondition: __root != nullptr && __z != nullptr.
313 // __z == __root or == a direct or indirect child of __root.
314 // Effects: unlinks __z from the tree rooted at __root, rebalancing as needed.
316 // nor any of its children refer to __z. end_node->__left_
320 __tree_remove(_NodePtr __root, _NodePtr __z) _NOEXCEPT
322 // __z will be removed from the tree. Client still needs to destruct/deallocate it
323 // __y is either __z, or if __z has two children, __tree_next(__z).
326 _NodePtr __y = (__z->__left_ == nullptr || __z->__right_ == nullptr) ?
327 __z : __tree_next(__z);
350 // If we didn't remove __z, do so now by splicing in __y for __z,
[all …]
Dcmath1214 …TY float fma(float __x, float __y, float __z) _NOEXCEPT {return fmaf(__x, …
1215 …ouble fma(long double __x, long double __y, long double __z) _NOEXCEPT {return fmal(__x, __y, __z)…
1226 fma(_A1 __x, _A2 __y, _A3 __z) _NOEXCEPT
1232 return fma((__result_type)__x, (__result_type)__y, (__result_type)__z);
1518 …Y float remquo(float __x, float __y, int* __z) _NOEXCEPT {return remquof(__x, __…
1519 … double remquo(long double __x, long double __y, int* __z) _NOEXCEPT {return remquol(__x, __y, __z…
1529 remquo(_A1 __x, _A2 __y, int* __z) _NOEXCEPT
1534 return remquo((__result_type)__x, (__result_type)__y, __z);
Drandom1890 void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
2130 void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
2380 result_type __z = __x_[__i_] ^ (__rshift<__u>(__x_[__i_]) & __d);
2382 __z ^= __lshift<__s>(__z) & __b;
2383 __z ^= __lshift<__t>(__z) & __c;
2384 return __z ^ __rshift<__l>(__z);
2587 void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
2876 void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
3087 void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
3316 void discard(unsigned long long __z) {for (; __z; --__z) operator()();}
[all …]
Dmemory3174 const uint32_t __z = __len + (static_cast<uint32_t>(__c) << 2);
3175 return __shift_mix(__y * __k2 ^ __z * __k3) * __k2;
3192 _Size __w, _Size __x, _Size __y, _Size __z, _Size __a, _Size __b) {
3194 __b = __rotate(__b + __a + __z, 21);
3199 return pair<_Size, _Size>(__a + __z, __b + __c);
3215 _Size __z = __loadword<_Size>(__s + 24);
3218 _Size __b = __rotate(__a + __z, 52);
3223 _Size __vf = __a + __z;
3226 __z += __loadword<_Size>(__s + __len - 8);
3227 __b = __rotate(__a + __z, 52);
[all …]
Dalgorithm3586 __sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c)
3591 if (!__c(*__z, *__y)) // if y <= z
3594 swap(*__y, *__z); // x <= z && y < z
3603 if (__c(*__z, *__y)) // x > y, if y > z
3605 swap(*__x, *__z); // x < y && y < z
3611 if (__c(*__z, *__y)) // if y > z
3613 swap(*__y, *__z); // x <= y && y < z
Ddeque344 difference_type __z = __block_size - 1 - __n;
345 __m_iter_ -= __z / __block_size;
346 __ptr_ = *__m_iter_ + (__block_size - 1 - __z % __block_size);
Dlocale3267 char_type __z = __ct.widen('0');
3270 if (*__w != __z)
3407 char_type __z = __f > 0 ? __ct.widen('0') : char_type();
3409 *__me++ = __z;
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/
D_hashtable.h326 void max_load_factor(float __z) { in max_load_factor() argument
327 _STLP_VERBOSE_ASSERT((__z > 0.0f), _StlMsg_INVALID_ARGUMENT) in max_load_factor()
328 _M_non_dbg_impl.max_load_factor(__z); in max_load_factor()