Home
last modified time | relevance | path

Searched refs:__y (Results 1 – 25 of 96) sorted by relevance

1234

/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/
Dbeta_function.tcc81 __beta_gamma(_Tp __x, _Tp __y) in __beta_gamma() argument
86 if (__x > __y) in __beta_gamma()
89 / _GLIBCXX_MATH_NS::tgamma(__x + __y); in __beta_gamma()
90 __bet *= _GLIBCXX_MATH_NS::tgamma(__y); in __beta_gamma()
94 __bet = _GLIBCXX_MATH_NS::tgamma(__y) in __beta_gamma()
95 / _GLIBCXX_MATH_NS::tgamma(__x + __y); in __beta_gamma()
99 if (__x > __y) in __beta_gamma()
101 __bet = __gamma(__x) / __gamma(__x + __y); in __beta_gamma()
102 __bet *= __gamma(__y); in __beta_gamma()
106 __bet = __gamma(__y) / __gamma(__x + __y); in __beta_gamma()
[all …]
Dcmath559 copysign(float __x, float __y)
560 { return __builtin_copysignf(__x, __y); }
563 copysign(long double __x, long double __y)
564 { return __builtin_copysignl(__x, __y); }
569 copysign(_Tp __x, _Up __y)
572 return copysign(__type(__x), __type(__y));
641 fdim(float __x, float __y)
642 { return __builtin_fdimf(__x, __y); }
645 fdim(long double __x, long double __y)
646 { return __builtin_fdiml(__x, __y); }
[all …]
Dell_integral.tcc78 __ellint_rf(_Tp __x, _Tp __y, _Tp __z) in __ellint_rf() argument
83 if (__x < _Tp(0) || __y < _Tp(0) || __z < _Tp(0)) in __ellint_rf()
86 else if (__x + __y < __lolim || __x + __z < __lolim in __ellint_rf()
87 || __y + __z < __lolim) in __ellint_rf()
98 _Tp __yn = __y; in __ellint_rf()
316 __ellint_rd(_Tp __x, _Tp __y, _Tp __z) in __ellint_rd() argument
323 if (__x < _Tp(0) || __y < _Tp(0)) in __ellint_rd()
326 else if (__x + __y < __lolim || __z < __lolim) in __ellint_rd()
338 _Tp __yn = __y; in __ellint_rd()
494 __ellint_rc(_Tp __x, _Tp __y) in __ellint_rc() argument
[all …]
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
Dfs_fwd.h95 operator&(copy_options __x, copy_options __y) noexcept in _GLIBCXX_VISIBILITY()
99 static_cast<__utype>(__x) & static_cast<__utype>(__y)); in _GLIBCXX_VISIBILITY()
103 operator|(copy_options __x, copy_options __y) noexcept in _GLIBCXX_VISIBILITY()
107 static_cast<__utype>(__x) | static_cast<__utype>(__y)); in _GLIBCXX_VISIBILITY()
111 operator^(copy_options __x, copy_options __y) noexcept in _GLIBCXX_VISIBILITY()
115 static_cast<__utype>(__x) ^ static_cast<__utype>(__y)); in _GLIBCXX_VISIBILITY()
126 operator&=(copy_options& __x, copy_options __y) noexcept in _GLIBCXX_VISIBILITY()
127 { return __x = __x & __y; } in _GLIBCXX_VISIBILITY()
130 operator|=(copy_options& __x, copy_options __y) noexcept in _GLIBCXX_VISIBILITY()
131 { return __x = __x | __y; } in _GLIBCXX_VISIBILITY()
[all …]
Dstl_iterator.h406 const reverse_iterator<_Iter2>& __y) in _GLIBCXX_VISIBILITY()
413 auto __ytmp = __y.base(); in _GLIBCXX_VISIBILITY()
445 const reverse_iterator<_Iterator>& __y) in _GLIBCXX_VISIBILITY()
446 { return __x.base() == __y.base(); } in _GLIBCXX_VISIBILITY()
452 const reverse_iterator<_Iterator>& __y) in _GLIBCXX_VISIBILITY()
453 { return __y.base() < __x.base(); } in _GLIBCXX_VISIBILITY()
459 const reverse_iterator<_Iterator>& __y) in _GLIBCXX_VISIBILITY()
460 { return !(__x == __y); } in _GLIBCXX_VISIBILITY()
466 const reverse_iterator<_Iterator>& __y) in _GLIBCXX_VISIBILITY()
467 { return __y < __x; } in _GLIBCXX_VISIBILITY()
[all …]
Dvalarray_before.h189 _Tp operator()(const _Tp& __x, const _Tp& __y) const in _GLIBCXX_VISIBILITY()
190 { return __x + __y; } in _GLIBCXX_VISIBILITY()
196 _Tp operator()(const _Tp& __x, const _Tp& __y) const in _GLIBCXX_VISIBILITY()
197 { return __x - __y; } in _GLIBCXX_VISIBILITY()
203 _Tp operator()(const _Tp& __x, const _Tp& __y) const in _GLIBCXX_VISIBILITY()
204 { return __x * __y; } in _GLIBCXX_VISIBILITY()
210 _Tp operator()(const _Tp& __x, const _Tp& __y) const in _GLIBCXX_VISIBILITY()
211 { return __x / __y; } in _GLIBCXX_VISIBILITY()
217 _Tp operator()(const _Tp& __x, const _Tp& __y) const in _GLIBCXX_VISIBILITY()
218 { return __x % __y; } in _GLIBCXX_VISIBILITY()
[all …]
Dstl_relops.h88 operator!=(const _Tp& __x, const _Tp& __y) in _GLIBCXX_VISIBILITY()
89 { return !(__x == __y); } in _GLIBCXX_VISIBILITY()
101 operator>(const _Tp& __x, const _Tp& __y) in _GLIBCXX_VISIBILITY()
102 { return __y < __x; } in _GLIBCXX_VISIBILITY()
114 operator<=(const _Tp& __x, const _Tp& __y) in _GLIBCXX_VISIBILITY()
115 { return !(__y < __x); } in _GLIBCXX_VISIBILITY()
127 operator>=(const _Tp& __x, const _Tp& __y) in _GLIBCXX_VISIBILITY()
128 { return !(__x < __y); } in _GLIBCXX_VISIBILITY()
Dstl_deque.h147 _Deque_iterator(_Elt_pointer __x, _Map_pointer __y) _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
148 : _M_cur(__x), _M_first(*__y), in _GLIBCXX_VISIBILITY()
149 _M_last(*__y + _S_buffer_size()), _M_node(__y) { } in _GLIBCXX_VISIBILITY()
272 operator==(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
273 { return __x._M_cur == __y._M_cur; } in _GLIBCXX_VISIBILITY()
282 const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) in _GLIBCXX_VISIBILITY()
284 { return __x._M_cur == __y._M_cur; } in _GLIBCXX_VISIBILITY()
289 operator<=>(const _Self& __x, const _Self& __y) noexcept in _GLIBCXX_VISIBILITY()
291 if (const auto __cmp = __x._M_node <=> __y._M_node; __cmp != 0) in _GLIBCXX_VISIBILITY()
293 return __x._M_cur <=> __y._M_cur; in _GLIBCXX_VISIBILITY()
[all …]
Dstl_stack.h356 operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
357 { return __x.c == __y.c; } in _GLIBCXX_VISIBILITY()
375 operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
376 { return __x.c < __y.c; } in _GLIBCXX_VISIBILITY()
382 operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
383 { return !(__x == __y); } in _GLIBCXX_VISIBILITY()
389 operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
390 { return __y < __x; } in _GLIBCXX_VISIBILITY()
396 operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
397 { return !(__y < __x); } in _GLIBCXX_VISIBILITY()
[all …]
Dstl_bvector.h84 _Bit_reference(_Bit_type * __x, _Bit_type __y) in _GLIBCXX_VISIBILITY()
85 : _M_p(__x), _M_mask(__y) { } in _GLIBCXX_VISIBILITY()
132 swap(_Bit_reference __x, _Bit_reference __y) noexcept in _GLIBCXX_VISIBILITY()
135 __x = __y; in _GLIBCXX_VISIBILITY()
136 __y = __tmp; in _GLIBCXX_VISIBILITY()
141 swap(_Bit_reference __x, bool& __y) noexcept in _GLIBCXX_VISIBILITY()
144 __x = __y; in _GLIBCXX_VISIBILITY()
145 __y = __tmp; in _GLIBCXX_VISIBILITY()
150 swap(bool& __x, _Bit_reference __y) noexcept in _GLIBCXX_VISIBILITY()
153 __x = __y; in _GLIBCXX_VISIBILITY()
[all …]
Dstl_function.h189 operator()(const _Tp& __x, const _Tp& __y) const in _GLIBCXX_VISIBILITY()
190 { return __x + __y; } in _GLIBCXX_VISIBILITY()
199 operator()(const _Tp& __x, const _Tp& __y) const in _GLIBCXX_VISIBILITY()
200 { return __x - __y; } in _GLIBCXX_VISIBILITY()
209 operator()(const _Tp& __x, const _Tp& __y) const in _GLIBCXX_VISIBILITY()
210 { return __x * __y; } in _GLIBCXX_VISIBILITY()
219 operator()(const _Tp& __x, const _Tp& __y) const in _GLIBCXX_VISIBILITY()
220 { return __x / __y; } in _GLIBCXX_VISIBILITY()
229 operator()(const _Tp& __x, const _Tp& __y) const in _GLIBCXX_VISIBILITY()
230 { return __x % __y; } in _GLIBCXX_VISIBILITY()
[all …]
Dstl_pair.h271 pair(const _T1& __x, const _T2& __y) in _GLIBCXX_VISIBILITY()
274 : first(__x), second(__y) in _GLIBCXX_VISIBILITY()
281 pair(_U1&& __x, _U2&& __y) in _GLIBCXX_VISIBILITY()
283 : first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y)) in _GLIBCXX_VISIBILITY()
513 pair(__zero_as_null_pointer_constant, _U2&& __y, ...) in _GLIBCXX_VISIBILITY()
514 : first(nullptr), second(std::forward<_U2>(__y)) { } in _GLIBCXX_VISIBILITY()
525 pair(__zero_as_null_pointer_constant, _U2&& __y, ...) in _GLIBCXX_VISIBILITY()
526 : first(nullptr), second(std::forward<_U2>(__y)) { } in _GLIBCXX_VISIBILITY()
536 constexpr pair(_U1&& __x, _U2&& __y) in _GLIBCXX_VISIBILITY()
537 : first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y)) { } in _GLIBCXX_VISIBILITY()
[all …]
Dstl_tree.h315 operator==(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
316 { return __x._M_node == __y._M_node; } in _GLIBCXX_VISIBILITY()
320 operator!=(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
321 { return __x._M_node != __y._M_node; } in _GLIBCXX_VISIBILITY()
396 operator==(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
397 { return __x._M_node == __y._M_node; } in _GLIBCXX_VISIBILITY()
401 operator!=(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
402 { return __x._M_node != __y._M_node; } in _GLIBCXX_VISIBILITY()
848 _M_insert_(_Base_ptr __x, _Base_ptr __y, _Arg&& __v, _NodeGen&); in _GLIBCXX_VISIBILITY()
851 _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z); in _GLIBCXX_VISIBILITY()
[all …]
Dstl_queue.h380 operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
381 { return __x.c == __y.c; } in _GLIBCXX_VISIBILITY()
399 operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
400 { return __x.c < __y.c; } in _GLIBCXX_VISIBILITY()
406 operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
407 { return !(__x == __y); } in _GLIBCXX_VISIBILITY()
413 operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
414 { return __y < __x; } in _GLIBCXX_VISIBILITY()
420 operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
421 { return !(__y < __x); } in _GLIBCXX_VISIBILITY()
[all …]
Dstl_multiset.h974 const multiset<_Key, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
975 { return __x._M_t == __y._M_t; } in _GLIBCXX_VISIBILITY()
995 const multiset<_Key, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
996 { return __x._M_t <=> __y._M_t; } in _GLIBCXX_VISIBILITY()
1012 const multiset<_Key, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
1013 { return __x._M_t < __y._M_t; } in _GLIBCXX_VISIBILITY()
1019 const multiset<_Key, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
1020 { return !(__x == __y); } in _GLIBCXX_VISIBILITY()
1026 const multiset<_Key,_Compare,_Alloc>& __y) in _GLIBCXX_VISIBILITY()
1027 { return __y < __x; } in _GLIBCXX_VISIBILITY()
[all …]
Dstl_list.h87 swap(_List_node_base& __x, _List_node_base& __y) _GLIBCXX_USE_NOEXCEPT; in _GLIBCXX_VISIBILITY()
318 operator==(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
319 { return __x._M_node == __y._M_node; } in _GLIBCXX_VISIBILITY()
324 operator!=(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
325 { return __x._M_node != __y._M_node; } in _GLIBCXX_VISIBILITY()
408 operator==(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
409 { return __x._M_node == __y._M_node; } in _GLIBCXX_VISIBILITY()
414 operator!=(const _Self& __x, const _Self& __y) _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
415 { return __x._M_node != __y._M_node; } in _GLIBCXX_VISIBILITY()
2124 operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
[all …]
Dstl_multimap.h143 bool operator()(const value_type& __x, const value_type& __y) const in _GLIBCXX_VISIBILITY()
144 { return comp(__x.first, __y.first); } in _GLIBCXX_VISIBILITY()
1135 const multimap<_Key, _Tp, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
1136 { return __x._M_t == __y._M_t; } in _GLIBCXX_VISIBILITY()
1156 const multimap<_Key, _Tp, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
1157 { return __x._M_t <=> __y._M_t; } in _GLIBCXX_VISIBILITY()
1173 const multimap<_Key, _Tp, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
1174 { return __x._M_t < __y._M_t; } in _GLIBCXX_VISIBILITY()
1180 const multimap<_Key, _Tp, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
1181 { return !(__x == __y); } in _GLIBCXX_VISIBILITY()
[all …]
Dstl_set.h988 const set<_Key, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
989 { return __x._M_t == __y._M_t; } in _GLIBCXX_VISIBILITY()
1009 const set<_Key, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
1010 { return __x._M_t <=> __y._M_t; } in _GLIBCXX_VISIBILITY()
1026 const set<_Key, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
1027 { return __x._M_t < __y._M_t; } in _GLIBCXX_VISIBILITY()
1033 const set<_Key, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
1034 { return !(__x == __y); } in _GLIBCXX_VISIBILITY()
1040 const set<_Key, _Compare, _Alloc>& __y) in _GLIBCXX_VISIBILITY()
1041 { return __y < __x; } in _GLIBCXX_VISIBILITY()
[all …]
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/std/
Dchrono149 // Compute the remainder of the Euclidean division of __x + __y divided by
151 // weekday/month with a shift in [0, d - 1] and __y is a duration count.
154 __add_modulo(unsigned __x, _Tp __y)
157 // For __y >= 0, _Up(__y) has the same mathematical value as __y and
158 // this function simply returns (__x + _Up(__y)) % d. Typically, this
160 // values than _Tp's. For __y < 0, _Up(__y) has a mathematical value in
162 // might overflow. Moreover, most likely, _Up(__y) != __y mod d. To
163 // fix both issues we subtract from _Up(__y) an __offset >=
166 auto const __offset = __y >= 0 ? _Up(0) : __modulo_offset<__d, _Tp>();
167 return (__x + _Up(__y) - __offset) % __d;
[all …]
Dstring_view542 basic_string_view<_CharT, _Traits> __y) noexcept
543 { return __x.size() == __y.size() && __x.compare(__y) == 0; }
548 __type_identity_t<basic_string_view<_CharT, _Traits>> __y)
550 { return __x.size() == __y.size() && __x.compare(__y) == 0; }
556 basic_string_view<_CharT, _Traits> __y) noexcept
558 { return __detail::__char_traits_cmp_cat<_Traits>(__x.compare(__y)); }
563 __type_identity_t<basic_string_view<_CharT, _Traits>> __y)
566 { return __detail::__char_traits_cmp_cat<_Traits>(__x.compare(__y)); }
571 basic_string_view<_CharT, _Traits> __y) noexcept
572 { return __x.size() == __y.size() && __x.compare(__y) == 0; }
[all …]
Dcomplex342 operator+(const complex<_Tp>& __x, const complex<_Tp>& __y)
345 __r += __y;
351 operator+(const complex<_Tp>& __x, const _Tp& __y)
354 __r += __y;
360 operator+(const _Tp& __x, const complex<_Tp>& __y)
362 complex<_Tp> __r = __y;
372 operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
375 __r -= __y;
381 operator-(const complex<_Tp>& __x, const _Tp& __y)
384 __r -= __y;
[all …]
Dthread65 operator<=>(thread::id __x, thread::id __y) noexcept
66 { return __x._M_thread <=> __y._M_thread; }
69 operator!=(thread::id __x, thread::id __y) noexcept
70 { return !(__x == __y); }
73 operator<(thread::id __x, thread::id __y) noexcept
77 return __x._M_thread < __y._M_thread;
81 operator<=(thread::id __x, thread::id __y) noexcept
82 { return !(__y < __x); }
85 operator>(thread::id __x, thread::id __y) noexcept
86 { return __y < __x; }
[all …]
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/c_global/
Dcmath144 atan2(float __y, float __x)
145 { return __builtin_atan2f(__y, __x); }
148 atan2(long double __y, long double __x)
149 { return __builtin_atan2l(__y, __x); }
155 atan2(_Tp __y, _Up __x)
158 return atan2(__type(__y), __type(__x));
279 fmod(float __x, float __y)
280 { return __builtin_fmodf(__x, __y); }
283 fmod(long double __x, long double __y)
284 { return __builtin_fmodl(__x, __y); }
[all …]
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/
Dfor_each_selectors.h315 operator()(_It __x, _It __y) in operator()
316 { return (__comp(*__x, *__y)) ? __x : __y; } in operator()
329 operator()(_It __x, _It __y) in operator()
330 { return (__comp(*__x, *__y)) ? __y : __x; } in operator()
344 operator()(const _Result& __x, const _Addend& __y) in operator()
345 { return __binop(__x, __y); } in operator()
Dbase.h200 __binder1st(const _Operation& __x, const _FirstArgumentType& __y) in __binder1st() argument
201 : _M_op(__x), _M_value(__y) { } in __binder1st()
228 __binder2nd(const _Operation& __x, const _SecondArgumentType& __y) in __binder2nd() argument
229 : _M_op(__x), _M_value(__y) { } in __binder2nd()
275 operator()(const _Tp1& __x, const _Tp2& __y) const
276 { return __x + __y; }
291 operator()(const _Tp1& __x, const _Tp2& __y) const
292 { return __x * __y; }

1234