| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/bits/ |
| 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...] |
| mathcalls.h | 355 __MATHCALL (fma,, (_Mdouble_ __x, _Mdouble_ __y, _Mdouble_ __z));
|
| /external/stlport/stlport/stl/ |
| _complex.h | 46 complex(const _Self& __z)
47 : _M_re(__z._M_re), _M_im(__z._M_im) {}
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)
58 : _M_re(__z._M_re), _M_im(__z._M_im) {}
61 _Self& operator=(const complex<_Tp2>& __z) {
[all...] |
| _complex.c | 92 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);
|
| _tree.c | 143 _Rb_global<_Dummy>::_Rebalance_for_erase(_Rb_tree_node_base* __z,
147 _Rb_tree_node_base* __y = __z;
151 if (__y->_M_left == 0) // __z has at most one non-null child. y == z.
154 if (__y->_M_right == 0) // __z has exactly one non-null child. y == z.
156 else { // __z has two non-null children. Set __y to
157 __y = _Rb_tree_node_base::_S_minimum(__y->_M_right); // __z's successor. __x might be null.
162 if (__y != __z) { // relink y in place of z. y is z's successor
163 __z->_M_left->_M_parent = __y;
164 __y->_M_left = __z->_M_left;
165 if (__y != __z->_M_right)
[all...] |
| _function.h | 306 const _Operation3& __z)
307 : _M_fn1(__x), _M_fn2(__y), _M_fn3(__z) { }
|
| _hashtable.h | 402 void max_load_factor(float __z) {
403 _M_max_load_factor = __z;
|
| _bvector.h | 656 _STLP_PRIV _Bit_iterator __z(__q, 0);
657 this->_M_finish = _STLP_STD::copy(begin(), end(), __z);
|
| _tree.h | 118 static _Base_ptr _STLP_CALL _Rebalance_for_erase(_Base_ptr __z,
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _complex.h | 46 complex(const _Self& __z)
47 : _M_re(__z._M_re), _M_im(__z._M_im) {}
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)
58 : _M_re(__z._M_re), _M_im(__z._M_im) {}
61 _Self& operator=(const complex<_Tp2>& __z) {
[all...] |
| _complex.c | 92 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);
|
| _tree.c | 143 _Rb_global<_Dummy>::_Rebalance_for_erase(_Rb_tree_node_base* __z,
147 _Rb_tree_node_base* __y = __z;
151 if (__y->_M_left == 0) // __z has at most one non-null child. y == z.
154 if (__y->_M_right == 0) // __z has exactly one non-null child. y == z.
156 else { // __z has two non-null children. Set __y to
157 __y = _Rb_tree_node_base::_S_minimum(__y->_M_right); // __z's successor. __x might be null.
162 if (__y != __z) { // relink y in place of z. y is z's successor
163 __z->_M_left->_M_parent = __y;
164 __y->_M_left = __z->_M_left;
165 if (__y != __z->_M_right)
[all...] |
| _function.h | 306 const _Operation3& __z)
307 : _M_fn1(__x), _M_fn2(__y), _M_fn3(__z) { }
|
| _hashtable.h | 402 void max_load_factor(float __z) {
403 _M_max_load_factor = __z;
|
| _bvector.h | 656 _STLP_PRIV _Bit_iterator __z(__q, 0);
657 this->_M_finish = _STLP_STD::copy(begin(), end(), __z);
|
| /external/stlport/src/ |
| complex_io.cpp | 30 operator<< (basic_ostream<char, char_traits<char> >& __os, const complex<float>& __z)
31 { return __os << '(' << (double)__z.real() << ',' << (double)__z.imag() << ')'; }
35 operator<< (basic_ostream<char, char_traits<char> >& __os, const complex<double>& __z)
36 { return __os << '(' << __z.real() << ',' << __z.imag() << ')'; }
41 operator<< (basic_ostream<char, char_traits<char> >& __os, const complex<long double>& __z)
42 { return __os << '(' << __z.real() << ',' << __z.imag() << ')'; }
48 operator>>(basic_istream<char, char_traits<char> >& __is, complex<float>& __z) {
[all...] |
| complex.cpp | 40 _STLP_DECLSPEC float _STLP_CALL abs(const complex<float>& __z)
41 { return ::hypot(__z._M_re, __z._M_im); }
43 _STLP_DECLSPEC double _STLP_CALL abs(const complex<double>& __z)
44 { return ::hypot(__z._M_re, __z._M_im); }
48 _STLP_DECLSPEC long double _STLP_CALL abs(const complex<long double>& __z)
49 { return ::hypot(__z._M_re, __z._M_im); }
55 _STLP_DECLSPEC float _STLP_CALL arg(const complex<float>& __z)
[all...] |
| /ndk/sources/cxx-stl/stlport/src/ |
| complex_io.cpp | 30 operator<< (basic_ostream<char, char_traits<char> >& __os, const complex<float>& __z)
31 { return __os << '(' << (double)__z.real() << ',' << (double)__z.imag() << ')'; }
35 operator<< (basic_ostream<char, char_traits<char> >& __os, const complex<double>& __z)
36 { return __os << '(' << __z.real() << ',' << __z.imag() << ')'; }
41 operator<< (basic_ostream<char, char_traits<char> >& __os, const complex<long double>& __z)
42 { return __os << '(' << __z.real() << ',' << __z.imag() << ')'; }
48 operator>>(basic_istream<char, char_traits<char> >& __is, complex<float>& __z) {
[all...] |
| complex.cpp | 40 _STLP_DECLSPEC float _STLP_CALL abs(const complex<float>& __z)
41 { return ::hypot(__z._M_re, __z._M_im); }
43 _STLP_DECLSPEC double _STLP_CALL abs(const complex<double>& __z)
44 { return ::hypot(__z._M_re, __z._M_im); }
48 _STLP_DECLSPEC long double _STLP_CALL abs(const complex<long double>& __z)
49 { return ::hypot(__z._M_re, __z._M_im); }
55 _STLP_DECLSPEC float _STLP_CALL arg(const complex<float>& __z)
[all...] |
| /external/kernel-headers/original/linux/ |
| mmzone.h | 86 #define zone_pcp(__z, __cpu) ((__z)->pageset[(__cpu)])
88 #define zone_pcp(__z, __cpu) (&(__z)->pageset[(__cpu)])
|
| /external/stlport/stlport/stl/debug/ |
| _hashtable.h | 326 void max_load_factor(float __z) {
327 _STLP_VERBOSE_ASSERT((__z > 0.0f), _StlMsg_INVALID_ARGUMENT)
328 _M_non_dbg_impl.max_load_factor(__z);
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 326 void max_load_factor(float __z) {
327 _STLP_VERBOSE_ASSERT((__z > 0.0f), _StlMsg_INVALID_ARGUMENT)
328 _M_non_dbg_impl.max_load_factor(__z);
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ |
| stdatomic.h | 141 __atomic_flag_for_address(const volatile void* __z) __attribute__((const));
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| hashtable_policy.h | 417 _Prime_rehash_policy(float __z = 1.0)
418 : _M_max_load_factor(__z), _M_growth_factor(2.f), _M_next_resize(0) { }
633 max_load_factor(float __z)
636 __this->__rehash_policy(_Prime_rehash_policy(__z));
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_tree.h | 316 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
909 _Link_type __z = _M_create_node(__v); local
911 _Rb_tree_insert_and_rebalance(__insert_left, __z,
915 return iterator(__z);
928 _Link_type __z = _M_create_node(__v); local
930 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
933 return iterator(__z);
[all...] |
