Home
last modified time | relevance | path

Searched refs:__x (Results 1 – 25 of 109) sorted by relevance

12345

/reactos/sdk/include/c++/
H A Dcmath35 abs(double __x)
39 abs(float __x)
47 acos(float __x)
55 asin(float __x)
63 atan(float __x)
79 ceil(float __x)
87 cos(float __x)
95 cosh(float __x)
103 exp(float __x)
111 fabs(float __x)
[all …]
/reactos/sdk/include/c++/stlport/stl/
H A D_valarray.h107 uninitialized_copy(__x._M_first, __x._M_first + __x._M_size, in valarray()
139 copy(__x._M_first, __x._M_first + __x._M_size, this->_M_first);
1198 : _M_slice(__x._M_slice), _M_array(__x._M_array) in slice_array()
1225 *this = __x; in valarray()
1395 : _M_gslice(__x._M_gslice), _M_array(__x._M_array)
1424 *this = __x;
1522 : _M_mask(__x._M_mask), _M_array(__x._M_array)
1548 *this = __x;
1556 if (__x._M_mask[__i]) (*this)[__idx++] = __x._M_array[__i];
1637 : _M_addr(__x._M_addr), _M_array(__x._M_array)
[all …]
H A D_tree.c70 else if (__x == __x->_M_parent->_M_left) in _Rotate_left()
89 else if (__x == __x->_M_parent->_M_right) in _Rotate_right()
108 __x = __x->_M_parent->_M_parent; in _Rebalance()
112 __x = __x->_M_parent; in _Rebalance()
126 __x = __x->_M_parent->_M_parent; in _Rebalance()
130 __x = __x->_M_parent; in _Rebalance()
393 __x = _S_left(__x); in insert_equal()
396 __x = _S_right(__x); in insert_equal()
412 __x = __comp ? _S_left(__x) : _S_right(__x); in insert_unique()
634 __x = _S_left(__x); in _M_copy()
[all …]
H A D_tree.h94 while (__x->_M_left != 0) __x = __x->_M_left; in _S_minimum()
95 return __x; in _S_minimum()
99 while (__x->_M_right != 0) __x = __x->_M_right; in _S_maximum()
100 return __x; in _S_maximum()
142 _Rb_tree_base_iterator(_Base_ptr __x) : _M_node(__x) {} in _Rb_tree_base_iterator()
554 __y = __x, __x = _S_left(__x);
556 __x = _S_right(__x);
573 __y = __x, __x = _S_left(__x);
575 __x = _S_right(__x);
587 __y = __x, __x = _S_left(__x);
[all …]
H A D_hash_fun.h72 size_t operator()(char __x) const { return __x; }
75 size_t operator()(unsigned char __x) const { return __x; }
79 size_t operator()(unsigned char __x) const { return __x; }
83 size_t operator()(short __x) const { return __x; }
86 size_t operator()(unsigned short __x) const { return __x; }
89 size_t operator()(int __x) const { return __x; }
94 size_t operator()(unsigned int __x) const { return __x; }
104 size_t operator()(size_t __x) const { return __x; }
109 size_t operator()(long __x) const { return __x; }
112 size_t operator()(unsigned long __x) const { return __x; }
[all …]
H A D_map.h146 map(const _Self& __x) : _M_t(__x._M_t) {} in _STLP_CREATE_ITERATOR_TRAITS()
154 _M_t = __x._M_t; in _STLP_CREATE_ITERATOR_TRAITS()
182 void swap(_Self& __x) { _M_t.swap(__x._M_t); } in _STLP_CREATE_ITERATOR_TRAITS()
184 void _M_swap_workaround(_Self& __x) { swap(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
210 iterator find(const _KT& __x) { return _M_t.find(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
331 multimap(const _Self& __x) : _M_t(__x._M_t) {} in _STLP_CREATE_ITERATOR_TRAITS()
360 void swap(_Self& __x) { _M_t.swap(__x._M_t); } in _STLP_CREATE_ITERATOR_TRAITS()
362 void _M_swap_workaround(_Self& __x) { swap(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
379 size_type erase(const key_type& __x) { return _M_t.erase(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
386 iterator find(const _KT& __x) { return _M_t.find(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
H A D_set.h134 set(const _Self& __x) : _M_t(__x._M_t) {} in _STLP_CREATE_ITERATOR_TRAITS()
142 _M_t = __x._M_t; in _STLP_CREATE_ITERATOR_TRAITS()
162 void swap(_Self& __x) { _M_t.swap(__x._M_t); } in _STLP_CREATE_ITERATOR_TRAITS()
164 void _M_swap_workaround(_Self& __x) { swap(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
191 iterator find(const _KT& __x) { return _M_t.find(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
306 multiset(const _Self& __x) : _M_t(__x._M_t) {} in _STLP_CREATE_ITERATOR_TRAITS()
333 void swap(_Self& __x) { _M_t.swap(__x._M_t); } in _STLP_CREATE_ITERATOR_TRAITS()
335 void _M_swap_workaround(_Self& __x) { swap(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
355 size_type erase(const key_type& __x) { return _M_t.erase(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
361 iterator find(const _KT& __x) { return _M_t.find(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
H A D_iterator.h64 explicit reverse_iterator(iterator_type __x) : current(__x) {} in reverse_iterator() argument
65 reverse_iterator(const _Self& __x) : current(__x.current) {} in reverse_iterator() argument
66 _Self& operator = (const _Self& __x) { current = __x.base(); return *this; }
69 reverse_iterator(const reverse_iterator<_Iter>& __x) : current(__x.base()) {} in reverse_iterator() argument
71 _Self& operator = (const reverse_iterator<_Iter>& __x) { current = __x.base(); return *this; }
126 { return !(__x == __y); }
131 { return __y < __x; }
136 { return !(__y < __x); }
141 { return !(__x < __y); }
171 explicit back_insert_iterator(_Container& __x) : container(&__x) {} in back_insert_iterator() argument
[all …]
H A D_pair.h78 { return __x.first == __y.first && __x.second == __y.second; }
82 return __x.first < __y.first ||
83 (!(__y.first < __x.first) && __x.second < __y.second);
89 { return !(__x == __y); }
93 { return __y < __x; }
97 { return !(__y < __x); }
101 { return !(__x < __y); }
134 { return !(__x == __y); }
138 { return __y < __x; }
142 { return !(__y < __x); }
[all …]
H A D_bvector.h70 if (__x)
75 if (!__x)
87 __x = __y; in swap()
127 _Bit_iterator_base( const _Bit_iterator_base& __x) : _M_p(__x._M_p), _M_offset(__x._M_offset) {}
148 return __y._M_p == __x._M_p && __y._M_offset == __x._M_offset;
151 return __y._M_p != __x._M_p || __y._M_offset != __x._M_offset;
155 return __x._M_p < __y._M_p || (__x._M_p == __y._M_p && __x._M_offset < __y._M_offset);
526 _STLP_STD::copy(__x.begin(), __x.end(), this->_M_start);
587 _STLP_STD::copy(__x.begin(), __x.end(), begin());
607 void assign(size_t __n, bool __x) { _M_fill_assign(__n, __x); }
[all …]
H A D_function.h45 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x != __y; } in operator()
50 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x > __y; } in operator()
55 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x >= __y; } in operator()
60 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x <= __y; } in operator()
65 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x / __y; } in operator()
70 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x % __y; } in operator()
75 _Tp operator()(const _Tp& __x) const { return -__x; } in operator()
90 bool operator()(const _Tp& __x) const { return !__x; } in operator()
146 explicit unary_negate(const _Predicate& __x) : _M_pred(__x) {} in unary_negate() argument
175 explicit binary_negate(const _Predicate& __x) : _M_pred(__x) {} in binary_negate() argument
[all …]
H A D_slist.h72 _Slist_iterator_base(_Slist_node_base *__x) : _M_node(__x) {} in _Slist_iterator_base()
97 explicit _Slist_iterator(_Slist_node_base *__x) : _Slist_iterator_base(__x) {} in _Slist_iterator() argument
100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} in _Slist_iterator() argument
331 { _M_insert_after_range(&this->_M_head._M_data, __x.begin(), __x.end()); }
430 void swap(_Self& __x)
433 void _M_swap_workaround(_Self& __x) { swap(__x); }
731 this->insert_after(__pos, __x.begin(), __x.end());
732 __x.clear();
745 insert(__pos, __x.begin(), __x.end());
746 __x.clear();
[all …]
H A D_function_base.h66 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x == __y; } in operator()
79 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x < __y; } in operator()
115 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x + __y; }
120 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x - __y; }
135 _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x * __y; }
143 return __x.first;
150 return __x.second;
157 _Arg1 operator()(const _Arg1& __x, const _Arg2&) const { return __x; }
172 # define _STLP_SELECT1ST(__x,__y) _STLP_PRIV __Select1st_hint< __x, __y >
174 # define _STLP_SELECT1ST(__x, __y) _STLP_PRIV _Select1st< __x >
[all …]
H A D_list.h89 _List_iterator_base(_List_node_base* __x) : _M_node(__x) {} in _List_iterator_base()
113 explicit _List_iterator(_List_node_base* __x) : _List_iterator_base(__x) {} in _List_iterator()
116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} in _List_iterator()
356 { _M_insert(begin(), __x.begin(), __x.end()); }
394 __x._M_node._M_data._M_next->_M_prev = &__x._M_node._M_data;
396 __x._M_node._M_data._M_prev->_M_next = &__x._M_node._M_data;
416 void _M_swap_workaround(_Self& __x) { swap(__x); }
508 void push_front(const_reference __x) { insert(begin(), __x); }
509 void push_back (const_reference __x) { insert(end(), __x); }
605 insert(__pos, __x.begin(), __x.end());
[all …]
H A D_string_operators.h87 _Str __result = _Str(_Reserve_t(), __x.size() + __n, __x.get_allocator());
89 _Str __result(_Reserve_t(), __x.size() + __n, __x.get_allocator());
91 __result.append(__x);
103 _Str __result = _Str(_Reserve_t(), __x.size() + 1, __x.get_allocator());
105 _Str __result(_Reserve_t(), __x.size() + 1, __x.get_allocator());
107 __result.append(__x);
289 return __x.size() == __y.size() && _Traits::compare(__x.data(), __y.data(), __x.size()) == 0;
297 return __x.size() == __y.size() && _Traits::compare(__x.data(), __y.data(), __x.size()) == 0;
304 return __x.size() == __y.size() && _Traits::compare(__x.data(), __y.data(), __x.size()) == 0;
510 return __s < __x;
[all …]
H A D_cmath.h391 inline double __stlp_fabs(double __x) { return fabs(__x); } in _STLP_DMATH_INLINE()
393 inline double fabs(double __x) { return __stlp_fabs(__x); } in fabs() argument
396 inline double __stlp_cos(double __x) { return cos(__x); } in __stlp_cos() argument
398 inline double cos(double __x) { return __stlp_cos(__x); } in cos() argument
401 inline double __stlp_sin(double __x) { return sin(__x); } in __stlp_sin() argument
403 inline double sin(double __x) { return __stlp_sin(__x); } in sin() argument
406 inline double __stlp_sqrt(double __x) { return sqrt(__x); } in __stlp_sqrt() argument
408 inline double sqrt(double __x) { return __stlp_sqrt(__x); } in sqrt() argument
411 inline double __stlp_ldexp(double __x, int __y) { return ldexp(__x, __y); } in __stlp_ldexp() argument
429 inline float abs(float __x) { return ::fabsf(__x); } in _STLP_DEF_MATH_INLINE()
[all …]
H A D_complex.h75 _M_re = __x;
80 _M_re += __x;
84 _M_re -= __x;
88 _M_re *= __x;
89 _M_im *= __x;
93 _M_re /= __x;
94 _M_im /= __x;
201 _M_re = __x;
645 { return complex<_Tp>(__x * __z._M_re, __x * __z._M_im); }
649 { return complex<_Tp>(__z._M_re * __x, __z._M_im * __x); }
[all …]
H A D_vector.c94 _Copy_Construct(__new_finish, __x); in _M_insert_overflow_aux()
124 if (_M_is_inside(__x)) { in _M_fill_insert_aux()
125 _Tp __x_copy = __x; in _M_fill_insert_aux()
135 _STLP_PRIV __uninitialized_fill_n(__pos, __n, __x); in _M_fill_insert_aux()
145 if (_M_is_inside(__x)) { in _M_fill_insert_aux()
146 _Tp __x_copy = __x; in _M_fill_insert_aux()
156 _STLP_STD::fill(__pos, __pos + __n, __x); in _M_fill_insert_aux()
161 _STLP_STD::fill(__pos, __old_finish, __x); in _M_fill_insert_aux()
185 if (&__x != this) {
186 const size_type __xlen = __x.size();
[all …]
H A D_rope.h226 _STLP_STD::copy(__x._M_buffer, __x._M_buffer + __x._M_buf_count, _M_buffer);
229 __x.flush();
235 __x.flush();
243 _STLP_STD::copy(__x._M_buffer, __x._M_buffer + __x._M_buf_count, _M_buffer);
723 : _M_pos(__x._M_pos), _M_root(__x._M_root) {}
725 : _M_pos(__x._M_pos), _M_root(__x._M_root) {}
827 if (__x._M_buf_start == __x._M_tmp_buf._M_data) {
1476 : _M_tree_ptr(__x._M_tree_ptr, __x._M_tree_ptr._M_data) {
1705 void _M_swap_workaround(_Self& __x) { swap(__x); }
2316 inline void swap(crope& __x, crope& __y) { __x.swap(__y); }
[all …]
/reactos/sdk/include/c++/stlport/stl/debug/
H A D_slist.h165 slist(const _Self& __x) : in slist() argument
166 _ConstructCheck(__x), in slist()
170 if (this != &__x) {
203 void swap(_Self& __x) { in swap() argument
208 void _M_swap_workaround(_Self& __x) { swap(__x); } in _M_swap_workaround() argument
219 void push_front(const_reference __x) { _M_non_dbg_impl.push_front(__x); } in push_front() argument
411 __x._Invalidate_iterators(__x.begin(), __x.end()); in splice_after()
463 __x._Invalidate_iterators(__x.begin(), __x.end()); in splice()
528 void merge(_Self& __x) { in merge() argument
542 __x._Invalidate_iterators(__x.begin(), __x.end()); in merge()
[all …]
H A D_list.h148 list(const _Self& __x) : in list() argument
149 _ConstructCheck(__x), in list()
153 if (this != &__x) {
197 void swap(_Self& __x) { in swap() argument
202 void _M_swap_workaround(_Self& __x) { swap(__x); } in _M_swap_workaround() argument
262 void push_back(const_reference __x) { _M_non_dbg_impl.push_back(__x); } in push_back() argument
269 void push_front(const_reference __x) { _M_non_dbg_impl.push_front(__x); } in push_front() argument
368 __x._Invalidate_iterators(__x.begin(), __x.end()); in splice()
399 void merge(_Self& __x) { in merge() argument
409 __x._Invalidate_iterators(__x.begin(), __x.end()); in merge()
[all …]
H A D_tree.h127 _Rb_tree(const _Self& __x) in _Rb_tree() argument
144 _Self& operator=(const _Self& __x) {
145 if (this != &__x) {
148 _M_non_dbg_impl = __x._M_non_dbg_impl;
170 size_type count(const _KT& __x) const { return _M_non_dbg_impl.count(__x); } in count() argument
185 iterator lower_bound(const _KT& __x) in lower_bound() argument
188 const_iterator lower_bound(const _KT& __x) const in lower_bound() argument
192 iterator upper_bound(const _KT& __x) in upper_bound() argument
227 iterator insert_equal(const value_type& __x) in insert_equal() argument
275 size_type erase(const key_type& __x) { in erase() argument
[all …]
/reactos/sdk/lib/crt/math/
H A Dmodf.c36 x.__x = &__x; in modfl()
46 return __x; in modfl()
52 __x = 0.0L; in modfl()
54 return __x; in modfl()
64 *__i = __x; in modfl()
65 if ( _isnanl(__x) || _isinfl(__x) ) in modfl()
66 return __x; in modfl()
68 __x = 0.0L; in modfl()
70 return __x; in modfl()
76 __x = 0.0L; in modfl()
[all …]
/reactos/sdk/lib/fslib/vfatlib/check/
H A Dbyteswap1.h37 if (__builtin_constant_p (__x)) \
38 __v = __bswap_constant_16 (__x); \
42 : "0" (__x) \
49 ({ register unsigned short int __x = (x); __bswap_constant_16 (__x); }))
72 ({ register unsigned int __v, __x = (x); \
73 if (__builtin_constant_p (__x)) \
74 __v = __bswap_constant_32 (__x); \
80 : "0" (__x) \
87 if (__builtin_constant_p (__x)) \
88 __v = __bswap_constant_32 (__x); \
[all …]
/reactos/sdk/include/c++/stlport/stl/pointers/
H A D_set.h193 set(const _Self& __x) : _M_t(__x._M_t) {}
201 _M_t = __x._M_t;
222 void swap(_Self& __x) { _M_t.swap(__x._M_t); }
224 void _M_swap_workaround(_Self& __x) { swap(__x); }
266 iterator find(const _KT& __x)
445 multiset(const _Self& __x)
446 : _M_t(__x._M_t) {}
449 _M_t = __x._M_t;
475 void swap(_Self& __x) { _M_t.swap(__x._M_t); }
477 void _M_swap_workaround(_Self& __x) { swap(__x); }
[all …]

12345