Searched refs:__z (Results 1 - 6 of 6) sorted by relevance
| /haiku/src/system/libroot/posix/glibc/math/bits/ |
| H A D | cmathcalls.h | 54 __MATHCALL (cacos, (_Mdouble_complex_ __z));
56 __MATHCALL (casin, (_Mdouble_complex_ __z));
58 __MATHCALL (catan, (_Mdouble_complex_ __z));
61 __MATHCALL (ccos, (_Mdouble_complex_ __z));
63 __MATHCALL (csin, (_Mdouble_complex_ __z));
65 __MATHCALL (ctan, (_Mdouble_complex_ __z));
71 __MATHCALL (cacosh, (_Mdouble_complex_ __z));
73 __MATHCALL (casinh, (_Mdouble_complex_ __z));
75 __MATHCALL (catanh, (_Mdouble_complex_ __z));
78 __MATHCALL (ccosh, (_Mdouble_complex_ __z));
[all...] |
| H A D | mathcalls.h | 338 __MATHCALL (fma,, (_Mdouble_ __x, _Mdouble_ __y, _Mdouble_ __z));
|
| /haiku/src/libs/stdc++/legacy/ |
| H A D | valarray.cc | 28 const size_t __z = __i.size(); local
29 __valarray_fill(&__i[0], __z, __o);
30 for (size_t __j=0; __j<__z; ++__j) {
|
| /haiku/headers/cpp/ |
| H A D | stl_tree.h | 300 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* __z, argument
305 _Rb_tree_node_base* __y = __z;
308 if (__y->_M_left == 0) // __z has at most one non-null child. y == z.
311 if (__y->_M_right == 0) // __z has exactly one non-null child. y == z.
313 else { // __z has two non-null children. Set __y to
314 __y = __y->_M_right; // __z's successor. __x might be null.
319 if (__y != __z) { // relink y in place of z. y is z's successor
320 __z->_M_left->_M_parent = __y;
321 __y->_M_left = __z->_M_left;
322 if (__y != __z
827 _Link_type __z; local
[all...] |
| H A D | stl_function.h | 272 const _Operation3& __z)
273 : _M_op1(__x), _M_op2(__y), _M_op3(__z) { }
271 binary_compose(const _Operation1& __x, const _Operation2& __y, const _Operation3& __z) argument
|
| /haiku/src/system/libroot/posix/glibc/math/ |
| H A D | math_private.h | 324 extern double __slowpow (double __x, double __y, double __z);
|
Completed in 35 milliseconds