Home
last modified time | relevance | path

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

/NextBSD/contrib/libstdc++/include/std/
Dstd_complex.h200 complex<_Tp>::complex(const complex<_Up>& __z) in complex() argument
201 : _M_real(__z.real()), _M_imag(__z.imag()) { } in complex()
253 complex<_Tp>::operator=(const complex<_Up>& __z)
255 _M_real = __z.real();
256 _M_imag = __z.imag();
264 complex<_Tp>::operator+=(const complex<_Up>& __z)
266 _M_real += __z.real();
267 _M_imag += __z.imag();
275 complex<_Tp>::operator-=(const complex<_Up>& __z)
277 _M_real -= __z.real();
[all …]
/NextBSD/contrib/libstdc++/include/tr1/
Dcomplex55 /// @brief acos(__z) [8.1.2].
60 __complex_acos(const std::complex<_Tp>& __z)
62 const std::complex<_Tp> __t = std::tr1::asin(__z);
69 __complex_acos(__complex__ float __z)
70 { return __builtin_cacosf(__z); }
73 __complex_acos(__complex__ double __z)
74 { return __builtin_cacos(__z); }
77 __complex_acos(const __complex__ long double& __z)
78 { return __builtin_cacosl(__z); }
82 acos(const std::complex<_Tp>& __z)
[all …]
Drandom.tcc258 result_type __z = _M_x[_M_p++]; in operator ()() local
259 __z ^= (__z >> __u); in operator ()()
260 __z ^= (__z << __s) & __b; in operator ()()
261 __z ^= (__z << __t) & __c; in operator ()()
262 __z ^= (__z >> __l); in operator ()()
264 return __z; in operator ()()
1226 const _IntType __z = _M_waiting(__urng, _M_t - _IntType(__x)); in operator ()() local
1227 __ret = _IntType(__x) + __z; in operator ()()
1495 const result_type __z = __u * __v * __v; in operator ()() local
1498 __reject = __r < result_type(4.5) * __z - __k; in operator ()()
[all …]
Dhashtable_policy.h492 _Prime_rehash_policy(float __z = 1.0); in _GLIBCXX_BEGIN_NAMESPACE()
520 _Prime_rehash_policy(float __z) in _GLIBCXX_BEGIN_NAMESPACE()
521 : _M_max_load_factor(__z), _M_growth_factor(2.f), _M_next_resize(0) in _GLIBCXX_BEGIN_NAMESPACE()
669 max_load_factor(float __z) in _GLIBCXX_BEGIN_NAMESPACE()
672 __this->__rehash_policy(_Prime_rehash_policy(__z)); in _GLIBCXX_BEGIN_NAMESPACE()
Dcmath529 fma(float __x, float __y, float __z)
530 { return __builtin_fmaf(__x, __y, __z); }
533 fma(long double __x, long double __y, long double __z)
534 { return __builtin_fmal(__x, __y, __z); }
538 fma(_Tp __x, _Up __y, _Vp __z)
541 return fma(__type(__x), __type(__y), __type(__z));
/NextBSD/contrib/libstdc++/src/
Dtree.cc257 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z, in _Rb_tree_rebalance_for_erase() argument
263 _Rb_tree_node_base* __y = __z; in _Rb_tree_rebalance_for_erase()
280 if (__y != __z) in _Rb_tree_rebalance_for_erase()
283 __z->_M_left->_M_parent = __y; in _Rb_tree_rebalance_for_erase()
284 __y->_M_left = __z->_M_left; in _Rb_tree_rebalance_for_erase()
285 if (__y != __z->_M_right) in _Rb_tree_rebalance_for_erase()
290 __y->_M_right = __z->_M_right; in _Rb_tree_rebalance_for_erase()
291 __z->_M_right->_M_parent = __y; in _Rb_tree_rebalance_for_erase()
295 if (__root == __z) in _Rb_tree_rebalance_for_erase()
297 else if (__z->_M_parent->_M_left == __z) in _Rb_tree_rebalance_for_erase()
[all …]
Dvalarray-inst.cc83 const size_t __z = __i.size(); in __gslice_to_index() local
85 for (size_t __j = 0; __j < __z; ++__j) in __gslice_to_index()
/NextBSD/contrib/llvm/tools/clang/lib/Headers/
HDtgmath.h59 #define __tg_promote3(__x, __y, __z) (__typeof__(__tg_promote(__x) + \ argument
61 __tg_promote(__z)))
735 __tg_fma(float __x, float __y, float __z) in __tg_fma() argument
736 {return fmaf(__x, __y, __z);} in __tg_fma()
740 __tg_fma(double __x, double __y, double __z) in __tg_fma() argument
741 {return fma(__x, __y, __z);} in __tg_fma()
745 __tg_fma(long double __x,long double __y, long double __z) in __tg_fma() argument
746 {return fmal(__x, __y, __z);} in __tg_fma()
749 #define fma(__x, __y, __z) \ argument
750 __tg_fma(__tg_promote3((__x), (__y), (__z))(__x), \
[all …]
HDxmmintrin.h603 _mm_set_ps(float __z, float __y, float __x, float __w) in _mm_set_ps() argument
605 return (__m128){ __w, __x, __y, __z }; in _mm_set_ps()
609 _mm_setr_ps(float __z, float __y, float __x, float __w) in _mm_setr_ps() argument
611 return (__m128){ __z, __y, __x, __w }; in _mm_setr_ps()
/NextBSD/contrib/libc++/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__tree303 // Precondition: __root != nullptr && __z != nullptr.
305 // __z == __root or == a direct or indirect child of __root.
306 // Effects: unlinks __z from the tree rooted at __root, rebalancing as needed.
308 // nor any of its children refer to __z. end_node->__left_
312 __tree_remove(_NodePtr __root, _NodePtr __z) _NOEXCEPT
314 // __z will be removed from the tree. Client still needs to destruct/deallocate it
315 // __y is either __z, or if __z has two children, __tree_next(__z).
318 _NodePtr __y = (__z->__left_ == nullptr || __z->__right_ == nullptr) ?
319 __z : __tree_next(__z);
342 // If we didn't remove __z, do so now by splicing in __y for __z,
[all …]
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 …]
Dmemory3259 const uint32_t __z = __len + (static_cast<uint32_t>(__c) << 2);
3260 return __shift_mix(__y * __k2 ^ __z * __k3) * __k2;
3277 _Size __w, _Size __x, _Size __y, _Size __z, _Size __a, _Size __b) {
3279 __b = __rotate(__b + __a + __z, 21);
3284 return pair<_Size, _Size>(__a + __z, __b + __c);
3300 _Size __z = __loadword<_Size>(__s + 24);
3303 _Size __b = __rotate(__a + __z, 52);
3308 _Size __vf = __a + __z;
3311 __z += __loadword<_Size>(__s + __len - 8);
3312 __b = __rotate(__a + __z, 52);
[all …]
Dalgorithm3602 __sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c)
3607 if (!__c(*__z, *__y)) // if y <= z
3610 swap(*__y, *__z); // x <= z && y < z
3619 if (__c(*__z, *__y)) // x > y, if y > z
3621 swap(*__x, *__z); // x < y && y < z
3627 if (__c(*__z, *__y)) // if y > z
3629 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);
Dlocale3274 char_type __z = __ct.widen('0');
3277 if (*__w != __z)
3414 char_type __z = __f > 0 ? __ct.widen('0') : char_type();
3416 *__me++ = __z;
/NextBSD/contrib/libstdc++/include/bits/
Dstl_tree.h325 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
855 _Link_type __z = _M_create_node(__v);
857 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
860 return iterator(__z);
873 _Link_type __z = _M_create_node(__v);
875 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
878 return iterator(__z);
891 _Link_type __z = _M_create_node(__v);
893 _Rb_tree_insert_and_rebalance(__insert_left, __z,
897 return const_iterator(__z);
/NextBSD/contrib/libstdc++/include/ext/
Dfunctional164 const _Operation3& __z)
165 : _M_fn1(__x), _M_fn2(__y), _M_fn3(__z) { }
/NextBSD/contrib/libstdc++/
DChangeLog-20043246 * include/std/std_complex.h (sin(const complex<_Tp>& __z)): Make