/haiku/headers/cpp/ |
H A D | stl_relops.h | 37 inline bool operator!=(const _Tp& __x, const _Tp& __y) { argument 38 return !(__x == __y); 42 inline bool operator>(const _Tp& __x, const _Tp& __y) { argument 43 return __y < __x; 47 inline bool operator<=(const _Tp& __x, const _Tp& __y) { argument 48 return !(__y < __x); 52 inline bool operator>=(const _Tp& __x, const _Tp& __y) { argument 53 return !(__x < __y);
|
H A D | stl_pair.h | 53 inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument 55 return __x.first == __y.first && __x.second == __y.second; 59 inline bool operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) argument 61 return __x.first < __y.first || 62 (!(__y.first < __x.first) && __x.second < __y.second); 66 inline pair<_T1, _T2> make_pair(const _T1& __x, const _T2& __y) argument 68 return pair<_T1, _T2>(__x, __y);
|
H A D | stl_stack.h | 66 bool operator==(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument 68 return __x._M_c == __y._M_c; 72 bool operator<(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument 74 return __x._M_c < __y._M_c; 80 bool operator!=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument 82 return !(__x == __y); 86 bool operator>(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument 88 return __y < __x; 92 bool operator<=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument 94 return !(__y < __ 98 operator >=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y) argument [all...] |
H A D | stl_tree.h | 117 _Base_ptr __y = _M_node->_M_parent; local 118 while (_M_node == __y->_M_right) { 119 _M_node = __y; 120 __y = __y->_M_parent; 122 if (_M_node->_M_right != __y) 123 _M_node = __y; 133 _Base_ptr __y = _M_node->_M_left; local 134 while (__y->_M_right != 0) 135 __y 139 _Base_ptr __y = _M_node->_M_parent; local 187 operator ==(const _Rb_tree_base_iterator& __x, const _Rb_tree_base_iterator& __y) argument 192 operator !=(const _Rb_tree_base_iterator& __x, const _Rb_tree_base_iterator& __y) argument 219 _Rb_tree_node_base* __y = __x->_M_right; local 238 _Rb_tree_node_base* __y = __x->_M_left; local 260 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right; local 278 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left; local 305 _Rb_tree_node_base* __y = __z; local 762 operator ==(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x, const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) argument 772 operator <(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x, const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) argument 784 swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x, _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) argument 826 _Link_type __y = (_Link_type) __y_; local 861 _Link_type __y = _M_header; local 879 _Link_type __y = _M_header; local 1028 _Link_type __y = local 1065 _Link_type __y = _M_clone_node(__x); local 1087 _Link_type __y = _S_left(__x); local 1117 _Link_type __y = _M_header; // Last node which is not less than __k. local 1136 _Link_type __y = _M_header; /* Last node which is not less than __k. */ local 1168 _Link_type __y = _M_header; /* Last node which is not less than __k. */ local 1186 _Link_type __y = _M_header; /* Last node which is not less than __k. */ local 1204 _Link_type __y = _M_header; /* Last node which is greater than __k. */ local 1222 _Link_type __y = _M_header; /* Last node which is greater than __k. */ local [all...] |
H A D | stl_queue.h | 69 operator==(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument 71 return __x.c == __y.c; 76 operator<(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument 78 return __x.c < __y.c; 85 operator!=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument 87 return !(__x == __y); 92 operator>(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument 94 return __y < __x; 99 operator<=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument 101 return !(__y < __ 106 operator >=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) argument [all...] |
H A D | stl_function.h | 51 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x + __y; } 56 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x - __y; } 61 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x * __y; } 66 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x / __y; } 81 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x % __y; } 194 binder1st(const _Operation& __x, const typename _Operation::first_argument_type& __y) argument 219 binder2nd(const _Operation& __x, const typename _Operation::second_argument_type& __y) argument 247 unary_compose(const _Operation1& __x, const _Operation2& __y) argument 271 binary_compose(const _Operation1& __x, const _Operation2& __y, const _Operation3& __z) argument [all...] |
H A D | stl_map.h | 66 bool operator()(const value_type& __x, const value_type& __y) const { 67 return _M_comp(__x.first, __y.first); 211 const map<_Key,_Tp,_Compare,_Alloc>& __y) { 212 return __x._M_t == __y._M_t; 217 const map<_Key,_Tp,_Compare,_Alloc>& __y) { 218 return __x._M_t < __y._M_t; 225 map<_Key,_Tp,_Compare,_Alloc>& __y) { 226 __x.swap(__y); 210 operator ==(const map<_Key,_Tp,_Compare,_Alloc>& __x, const map<_Key,_Tp,_Compare,_Alloc>& __y) argument 216 operator <(const map<_Key,_Tp,_Compare,_Alloc>& __x, const map<_Key,_Tp,_Compare,_Alloc>& __y) argument 224 swap(map<_Key,_Tp,_Compare,_Alloc>& __x, map<_Key,_Tp,_Compare,_Alloc>& __y) argument
|
H A D | stl_multimap.h | 65 bool operator()(const value_type& __x, const value_type& __y) const { 66 return _M_comp(__x.first, __y.first); 201 const multimap<_Key,_Tp,_Compare,_Alloc>& __y) { 202 return __x._M_t == __y._M_t; 207 const multimap<_Key,_Tp,_Compare,_Alloc>& __y) { 208 return __x._M_t < __y._M_t; 215 multimap<_Key,_Tp,_Compare,_Alloc>& __y) { 216 __x.swap(__y); 200 operator ==(const multimap<_Key,_Tp,_Compare,_Alloc>& __x, const multimap<_Key,_Tp,_Compare,_Alloc>& __y) argument 206 operator <(const multimap<_Key,_Tp,_Compare,_Alloc>& __x, const multimap<_Key,_Tp,_Compare,_Alloc>& __y) argument 214 swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x, multimap<_Key,_Tp,_Compare,_Alloc>& __y) argument
|
H A D | stl_multiset.h | 193 const multiset<_Key,_Compare,_Alloc>& __y) { 194 return __x._M_t == __y._M_t; 199 const multiset<_Key,_Compare,_Alloc>& __y) { 200 return __x._M_t < __y._M_t; 207 multiset<_Key,_Compare,_Alloc>& __y) { 208 __x.swap(__y); 192 operator ==(const multiset<_Key,_Compare,_Alloc>& __x, const multiset<_Key,_Compare,_Alloc>& __y) argument 198 operator <(const multiset<_Key,_Compare,_Alloc>& __x, const multiset<_Key,_Compare,_Alloc>& __y) argument 206 swap(multiset<_Key,_Compare,_Alloc>& __x, multiset<_Key,_Compare,_Alloc>& __y) argument
|
H A D | stl_set.h | 185 const set<_Key,_Compare,_Alloc>& __y) { 186 return __x._M_t == __y._M_t; 191 const set<_Key,_Compare,_Alloc>& __y) { 192 return __x._M_t < __y._M_t; 199 set<_Key,_Compare,_Alloc>& __y) { 200 __x.swap(__y); 184 operator ==(const set<_Key,_Compare,_Alloc>& __x, const set<_Key,_Compare,_Alloc>& __y) argument 190 operator <(const set<_Key,_Compare,_Alloc>& __x, const set<_Key,_Compare,_Alloc>& __y) argument 198 swap(set<_Key,_Compare,_Alloc>& __x, set<_Key,_Compare,_Alloc>& __y) argument
|
H A D | stl_iterator.h | 556 const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __y) 558 return __x.base() == __y.base(); 647 const reverse_iterator<_Iterator>& __y) { 648 return __x.base() == __y.base(); 653 const reverse_iterator<_Iterator>& __y) { 654 return __y.base() < __x.base(); 660 const reverse_iterator<_Iterator>& __y) { 661 return __y.base() - __x.base(); 770 _Reference, _Distance>& __y) 772 return __x.base() == __y 554 operator ==( const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __x, const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __y) argument 646 operator ==(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 652 operator <(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 659 operator -(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) argument 767 operator ==(const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __y) argument 778 operator <(const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __y) argument 789 operator -(const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __x, const reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>& __y) argument 867 operator ==(const istream_iterator<_Tp, _Distance>& __x, const istream_iterator<_Tp, _Distance>& __y) argument [all...] |
H A D | stl_bvector.h | 46 _Bit_reference(unsigned int* __x, unsigned int __y) argument 47 : _M_p(__x), _M_mask(__y) {} 68 inline void swap(_Bit_reference __x, _Bit_reference __y) argument 71 __x = __y; 72 __y = __tmp; 96 _Bit_iterator(unsigned int* __x, unsigned int __y) argument 97 : _M_p(__x), _M_offset(__y) {} 179 _Bit_const_iterator(unsigned int* __x, unsigned int __y) argument 180 : _M_p(__x), _M_offset(__y) {} 809 operator==(const bit_vector& __x, const bit_vector& __y) argument 816 operator <(const bit_vector& __x, const bit_vector& __y) argument [all...] |
H A D | stl_rope.h | 837 const _Rope_char_ptr_proxy<_CharT,_Alloc>& __y); 1022 const _Rope_const_iterator<_CharT,_Alloc>& __y); 1025 const _Rope_const_iterator<_CharT,_Alloc>& __y); 1028 const _Rope_const_iterator<_CharT,_Alloc>& __y); 1133 const _Rope_iterator<_CharT,_Alloc>& __y); 1136 const _Rope_iterator<_CharT,_Alloc>& __y); 1139 const _Rope_iterator<_CharT,_Alloc>& __y); 1533 rope operator() (const rope& __x, const rope& __y) { argument 1534 return __x + __y; 1601 // Return -1, 0, or 1 if __x < __y, __ 1925 append(const rope& __y) argument 2312 operator ==(const _Rope_const_iterator<_CharT,_Alloc>& __x, const _Rope_const_iterator<_CharT,_Alloc>& __y) argument 2319 operator <(const _Rope_const_iterator<_CharT,_Alloc>& __x, const _Rope_const_iterator<_CharT,_Alloc>& __y) argument 2325 operator -(const _Rope_const_iterator<_CharT,_Alloc>& __x, const _Rope_const_iterator<_CharT,_Alloc>& __y) argument 2352 operator ==(const _Rope_iterator<_CharT,_Alloc>& __x, const _Rope_iterator<_CharT,_Alloc>& __y) argument 2359 operator <(const _Rope_iterator<_CharT,_Alloc>& __x, const _Rope_iterator<_CharT,_Alloc>& __y) argument 2365 operator -(const _Rope_iterator<_CharT,_Alloc>& __x, const _Rope_iterator<_CharT,_Alloc>& __y) argument 2470 operator ==(const _Rope_char_ptr_proxy<_CharT,_Alloc>& __x, const _Rope_char_ptr_proxy<_CharT,_Alloc>& __y) argument 2494 swap(rope<_CharT,_Alloc>& __x, rope<_CharT,_Alloc>& __y) argument 2500 swap(crope __x, crope __y) argument 2501 swap(wrope __x, wrope __y) argument [all...] |
H A D | stl_list.h | 512 const list& __x, const list& __y); 517 const list<_Tp,_Alloc>& __y) 521 _Node* __e2 = __y._M_node; 533 const list<_Tp,_Alloc>& __y) 536 __y.begin(), __y.end()); 543 swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) argument 545 __x.swap(__y); 516 operator ==(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) argument 532 operator <(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) argument
|
H A D | stl_vector.h | 493 operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument 495 return __x.size() == __y.size() && 496 equal(__x.begin(), __x.end(), __y.begin()); 501 operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) argument 504 __y.begin(), __y.end()); 510 inline void swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) argument 512 __x.swap(__y);
|
H A D | bitset | 866 const bitset<_Nb,_WordT>& __y) { 868 __result &= __y; 875 const bitset<_Nb,_WordT>& __y) { 877 __result |= __y; 883 const bitset<_Nb,_WordT>& __y) { 885 __result ^= __y;
|
H A D | stl_deque.h | 128 _Deque_iterator(_Tp* __x, _Map_pointer __y) argument 129 : _M_cur(__x), _M_first(*__y), 130 _M_last(*__y + _S_buffer_size()), _M_node(__y) {} 1659 const deque<_Tp, _Alloc, __bufsiz>& __y) 1661 return __x.size() == __y.size() && 1662 equal(__x.begin(), __x.end(), __y.begin()); 1667 const deque<_Tp, _Alloc, __bufsiz>& __y) 1670 __y.begin(), __y 1658 operator ==(const deque<_Tp, _Alloc, __bufsiz>& __x, const deque<_Tp, _Alloc, __bufsiz>& __y) argument 1666 operator <(const deque<_Tp, _Alloc, __bufsiz>& __x, const deque<_Tp, _Alloc, __bufsiz>& __y) argument 1680 swap(deque<_Tp,_Alloc,__bufsiz>& __x, deque<_Tp,_Alloc,__bufsiz>& __y) argument [all...] |
H A D | stl_slist.h | 769 inline void swap(slist<_Tp,_Alloc>& __x, slist<_Tp,_Alloc>& __y) { argument 770 __x.swap(__y);
|
/haiku/src/system/libroot/posix/glibc/include/arch/m68k/ |
H A D | mathimpl.h | 37 __m81_defun (double, __ieee754_remainder, (double __x, double __y)) argument 40 __asm ("frem%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x)); 44 __m81_defun (float, __ieee754_remainderf, (float __x, float __y)) argument 47 __asm ("frem%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x)); 52 __ieee754_remainderl, (long double __x, long double __y)) 55 __asm ("frem%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x)); 59 __m81_defun (double, __ieee754_fmod, (double __x, double __y)) argument 62 __asm ("fmod%.x %1, %0" : "=f" (__result) : "f" (__y), "0" (__x)); 66 __m81_defun (float, __ieee754_fmodf, (float __x, float __y)) argument 69 __asm ("fmod%.x %1, %0" : "=f" (__result) : "f" (__y), " 51 __m81_defun(long double, __ieee754_remainderl, (long double __x, long double __y)) argument 73 __m81_defun(long double, __ieee754_fmodl, (long double __x, long double __y)) argument [all...] |
/haiku/src/system/libroot/posix/glibc/math/bits/ |
H A D | mathcalls.h | 60 __MATHCALL (atan2,, (_Mdouble_ __y, _Mdouble_ __x)); 143 __MATHCALL (pow,, (_Mdouble_ __x, _Mdouble_ __y)); 150 __MATHCALL (hypot,, (_Mdouble_ __x, _Mdouble_ __y)); 171 __MATHCALL (fmod,, (_Mdouble_ __x, _Mdouble_ __y)); 193 __MATHCALL (drem,, (_Mdouble_ __x, _Mdouble_ __y)); 202 __MATHCALLX (copysign,, (_Mdouble_ __x, _Mdouble_ __y), (__const__)); 261 __MATHCALLX (nextafter,, (_Mdouble_ __x, _Mdouble_ __y), (__const__)); 263 __MATHCALLX (nexttoward,, (_Mdouble_ __x, long double __y), (__const__)); 267 __MATHCALL (remainder,, (_Mdouble_ __x, _Mdouble_ __y)); 302 __MATHCALL (remquo,, (_Mdouble_ __x, _Mdouble_ __y, in [all...] |
H A D | cmathcalls.h | 102 __MATHCALL (cpow, (_Mdouble_complex_ __x, _Mdouble_complex_ __y));
|
/haiku/src/system/libroot/posix/glibc/arch/generic/ |
H A D | mpa.h | 85 extern void __mpexp (mp_no *, mp_no *__y, int);
|
/haiku/src/system/libroot/posix/glibc/math/ |
H A D | math_private.h | 198 extern double __copysign (double x, double __y); 241 extern float __copysignf (float x, float __y); 316 extern double __halfulp (double __x, double __y); 324 extern double __slowpow (double __x, double __y, double __z);
|
/haiku/headers/cpp/std/ |
H A D | std_valarray.h | 239 _Tp operator() (_Tp __x, _Tp __y) const { return __x & __y; } 243 _Tp operator() (_Tp __x, _Tp __y) const { return __x | __y; } 247 _Tp operator() (_Tp __x, _Tp __y) const { return __x ^ __y; } 255 _Tp operator() (_Tp __x, _Tp __y) const { return __x << __y; } 259 _Tp operator() (_Tp __x, _Tp __y) const { return __x >> __y; } [all...] |