Home
last modified time | relevance | path

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

123456

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_valarray.h102 valarray(const value_type& __x, size_t __n) : _Valarray_base<_Tp>(__n) in valarray() argument
103 { uninitialized_fill_n(this->_M_first, this->_M_size, __x); } in valarray()
106 valarray(const valarray<_Tp>& __x) : _Valarray_base<_Tp>(__x._M_size) { in valarray() argument
107 uninitialized_copy(__x._M_first, __x._M_first + __x._M_size, in valarray()
136 valarray<_Tp>& operator=(const valarray<_Tp>& __x) {
137 _STLP_ASSERT(__x.size() == this->size())
138 if (this != &__x)
139 copy(__x._M_first, __x._M_first + __x._M_size, this->_M_first);
144 valarray<_Tp>& operator=(const value_type& __x) {
145 fill_n(this->_M_first, this->_M_size, __x);
[all …]
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 …]
D_tree.c60 _Rb_global<_Dummy>::_Rotate_left(_Rb_tree_node_base* __x, in _Rotate_left() argument
62 _Rb_tree_node_base* __y = __x->_M_right; in _Rotate_left()
63 __x->_M_right = __y->_M_left; in _Rotate_left()
65 __y->_M_left->_M_parent = __x; in _Rotate_left()
66 __y->_M_parent = __x->_M_parent; in _Rotate_left()
68 if (__x == __root) in _Rotate_left()
70 else if (__x == __x->_M_parent->_M_left) in _Rotate_left()
71 __x->_M_parent->_M_left = __y; in _Rotate_left()
73 __x->_M_parent->_M_right = __y; in _Rotate_left()
74 __y->_M_left = __x; in _Rotate_left()
[all …]
D_tree.h93 static _Base_ptr _STLP_CALL _S_minimum(_Base_ptr __x) { in _S_minimum()
94 while (__x->_M_left != 0) __x = __x->_M_left; in _S_minimum()
95 return __x; in _S_minimum()
98 static _Base_ptr _STLP_CALL _S_maximum(_Base_ptr __x) { in _S_maximum()
99 while (__x->_M_right != 0) __x = __x->_M_right; in _S_maximum()
100 return __x; in _S_maximum()
117 static void _STLP_CALL _Rebalance(_Base_ptr __x, _Base_ptr& __root);
126 static void _STLP_CALL _Rotate_left (_Base_ptr __x, _Base_ptr& __root);
127 static void _STLP_CALL _Rotate_right(_Base_ptr __x, _Base_ptr& __root);
142 _Rb_tree_base_iterator(_Base_ptr __x) : _M_node(__x) {} in _Rb_tree_base_iterator()
[all …]
D_pair.h81 inline bool _STLP_CALL operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
82 { return __x.first == __y.first && __x.second == __y.second; }
85 inline bool _STLP_CALL operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
86 return __x.first < __y.first ||
87 (!(__y.first < __x.first) && __x.second < __y.second);
92 inline bool _STLP_CALL operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
93 { return !(__x == __y); }
96 inline bool _STLP_CALL operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
97 { return __y < __x; }
100 inline bool _STLP_CALL operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
[all …]
D_cstdlib.h113 inline int abs(int __x) { return _STLP_VENDOR_CSTD::abs(__x); } in abs() argument
114 inline _STLP_VENDOR_CSTD::div_t div(int __x, int __y) { return _STLP_VENDOR_CSTD::div(__x, __y); } in div() argument
131 inline long abs(long __x) { return _STLP_VENDOR_CSTD::labs(__x); } in abs() argument
137 inline _STLP_VENDOR_CSTD::ldiv_t div(long __x, long __y) { return _STLP_VENDOR_CSTD::ldiv(__x, __y)… in div() argument
151 inline _STLP_LONG_LONG abs(_STLP_LONG_LONG __x) { return _STLP_VENDOR_CSTD::llabs(__x); } in abs() argument
152 inline lldiv_t div(_STLP_LONG_LONG __x, _STLP_LONG_LONG __y) { return _STLP_VENDOR_CSTD::lldiv(__x,… in div() argument
154 inline _STLP_LONG_LONG abs(_STLP_LONG_LONG __x) { return ::llabs(__x); } in abs() argument
155 inline lldiv_t div(_STLP_LONG_LONG __x, _STLP_LONG_LONG __y) { return ::lldiv(__x, __y); } in div() argument
158 inline _STLP_LONG_LONG abs(_STLP_LONG_LONG __x) { return __x < 0 ? -__x : __x; } in abs() argument
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; }
113 inline bool _STLP_CALL operator==(const reverse_iterator<_Iterator>& __x,
115 { return __x.base() == __y.base(); }
118 inline bool _STLP_CALL operator<(const reverse_iterator<_Iterator>& __x,
120 { return __y.base() < __x.base(); }
124 inline bool _STLP_CALL operator!=(const reverse_iterator<_Iterator>& __x,
[all …]
D_map.h68 bool operator()(const value_type& __x, const value_type& __y) const in _STLP_CREATE_ITERATOR_TRAITS()
69 { return comp(__x.first, __y.first); } in _STLP_CREATE_ITERATOR_TRAITS()
146 map(const _Self& __x) : _M_t(__x._M_t) {} in _STLP_CREATE_ITERATOR_TRAITS()
153 _Self& operator=(const _Self& __x) { 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()
188 pair<iterator,bool> insert(const value_type& __x) in _STLP_CREATE_ITERATOR_TRAITS()
189 { return _M_t.insert_unique(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
190 iterator insert(iterator __pos, const value_type& __x) in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
D_relops_cont.h7 inline bool _STLP_CALL operator==(const _STLP_TEMPLATE_CONTAINER& __x,
9 return __x.size() == __y.size() &&
10 equal(__x.begin(), __x.end(), __y.begin());
15 inline bool _STLP_CALL operator<(const _STLP_TEMPLATE_CONTAINER& __x,
17 return lexicographical_compare(__x.begin(), __x.end(),
25 inline void _STLP_CALL swap(_STLP_TEMPLATE_CONTAINER& __x, in _STLP_RELOPS_OPERATORS()
27 __x.swap(__y); in _STLP_RELOPS_OPERATORS()
D_set.h134 set(const _Self& __x) : _M_t(__x._M_t) {} in _STLP_CREATE_ITERATOR_TRAITS()
141 _Self& operator=(const _Self& __x) { 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()
168 pair<iterator,bool> insert(const value_type& __x) in _STLP_CREATE_ITERATOR_TRAITS()
169 { return _M_t.insert_unique(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
170 iterator insert(iterator __pos, const value_type& __x) in _STLP_CREATE_ITERATOR_TRAITS()
171 { return _M_t.insert_unique( __pos , __x); } in _STLP_CREATE_ITERATOR_TRAITS()
183 size_type erase(const key_type& __x) { return _M_t.erase_unique(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
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()
82 void _M_swap_workaround(less<_Tp>& __x) {} in _M_swap_workaround()
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; }
142 const typename _Pair::first_type& operator()(const _Pair& __x) const {
143 return __x.first;
149 const typename _Pair::second_type& operator()(const _Pair& __x) const {
150 return __x.second;
[all …]
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()
80 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x && __y; } in operator()
85 bool operator()(const _Tp& __x, const _Tp& __y) const { return __x || __y; } in operator()
90 bool operator()(const _Tp& __x) const { return !__x; } in operator()
[all …]
D_bvector.h45 _Bit_reference(unsigned int* __x, unsigned int __y) in _Bit_reference()
46 : _M_p(__x), _M_mask(__y) {} in _Bit_reference()
54 _Bit_reference& operator = (bool __x) {
55 if (__x) *_M_p |= _M_mask;
59 _Bit_reference& operator = (const _Bit_reference& __x) {
60 return *this = bool(__x);
62 bool operator == (const _Bit_reference& __x) const {
63 return bool(*this) == bool(__x);
65 bool operator < (const _Bit_reference& __x) const {
66 return !bool(*this) && bool(__x);
[all …]
D_vector.c81 void vector<_Tp, _Alloc>::_M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type&… in _M_insert_overflow_aux() argument
94 _Copy_Construct(__new_finish, __x); in _M_insert_overflow_aux()
97 __new_finish = _STLP_PRIV __uninitialized_fill_n(__new_finish, __fill_len, __x); in _M_insert_overflow_aux()
108 void vector<_Tp, _Alloc>::_M_insert_overflow(pointer __pos, const _Tp& __x, const __true_type& /*_T… in _M_insert_overflow() argument
114 __new_finish = _STLP_PRIV __fill_n(__new_finish, __fill_len, __x); in _M_insert_overflow()
123 const _Tp& __x, const __true_type& /*_Movable*/) { in _M_fill_insert_aux() argument
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()
141 const _Tp& __x, const __false_type& /*_Movable*/) { in _M_fill_insert_aux() argument
[all …]
D_queue.h100 void push(const value_type& __x) { c.push_back(__x); } in push() argument
105 void _M_swap_workaround(_Self& __x) { in _M_swap_workaround() argument
107 c = __x.c; in _M_swap_workaround()
108 __x.c = __tmp; in _M_swap_workaround()
122 operator==(const queue<_STLP_QUEUE_ARGS >& __x, const queue<_STLP_QUEUE_ARGS >& __y) {
123 return __x._Get_s() == __y._Get_s();
128 operator<(const queue<_STLP_QUEUE_ARGS >& __x, const queue<_STLP_QUEUE_ARGS >& __y) {
129 return __x._Get_s() < __y._Get_s();
171 explicit priority_queue(const _Compare& __x) : c(), comp(__x) {} in _STLP_RELOPS_OPERATORS()
172 priority_queue(const _Compare& __x, const _Sequence& __s) in _STLP_RELOPS_OPERATORS()
[all …]
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
209 void _Slist_merge(slist<_Tp, _Alloc>& __that, slist<_Tp, _Alloc>& __x,
250 _Node* _M_create_node(const value_type& __x = _Tp()) {
252 _Node* _M_create_node(const value_type& __x) {
256 _Copy_Construct(&__node->_M_data, __x);
289 explicit slist(size_type __n, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp),
295 slist(size_type __n, const value_type& __x)
297 { _M_insert_after_fill(&this->_M_head._M_data, __n, __x); }
[all …]
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()
242 void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x,
281 _Node_base* _M_create_node(const_reference __x = value_type()) {
283 _Node_base* _M_create_node(const_reference __x) {
287 _Copy_Construct(&__p->_M_data, __x);
355 list(const _Self& __x) : _STLP_PRIV _List_base<_Tp, _Alloc>(__x.get_allocator())
356 { _M_insert(begin(), __x.begin(), __x.end()); }
365 _Self& operator = (const _Self& __x);
[all …]
/ndk/sources/cxx-stl/llvm-libc++/include/
Dcmath319 __libcpp_signbit(_A1 __x) _NOEXCEPT
321 return signbit(__x);
329 signbit(_A1 __x) _NOEXCEPT
331 return __libcpp_signbit((typename std::__promote<_A1>::type)__x);
343 __libcpp_fpclassify(_A1 __x) _NOEXCEPT
345 return fpclassify(__x);
353 fpclassify(_A1 __x) _NOEXCEPT
355 return __libcpp_fpclassify((typename std::__promote<_A1>::type)__x);
367 __libcpp_isfinite(_A1 __x) _NOEXCEPT
369 return isfinite(__x);
[all …]
Dcomplex261 template<class _Tp> complex<_Tp> operator/(const complex<_Tp>& __x, const complex<_Tp>& __y);
528 operator+(const complex<_Tp>& __x, const complex<_Tp>& __y)
530 complex<_Tp> __t(__x);
538 operator+(const complex<_Tp>& __x, const _Tp& __y)
540 complex<_Tp> __t(__x);
548 operator+(const _Tp& __x, const complex<_Tp>& __y)
551 __t += __x;
558 operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
560 complex<_Tp> __t(__x);
568 operator-(const complex<_Tp>& __x, const _Tp& __y)
[all …]
/ndk/sources/cxx-stl/gabi++/include/
Dstl_pair.h86 inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
88 return __x.first == __y.first && __x.second == __y.second;
92 inline bool operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
94 return __x.first < __y.first ||
95 (!(__y.first < __x.first) && __x.second < __y.second);
99 inline bool operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
100 return !(__x == __y);
104 inline bool operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
105 return __y < __x;
109 inline bool operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
[all …]
/ndk/sources/cxx-stl/system/include/
Dstl_pair.h86 inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
88 return __x.first == __y.first && __x.second == __y.second;
92 inline bool operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
94 return __x.first < __y.first ||
95 (!(__y.first < __x.first) && __x.second < __y.second);
99 inline bool operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
100 return !(__x == __y);
104 inline bool operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
105 return __y < __x;
109 inline bool operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) {
[all …]
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/
D_slist.h111 explicit slist(size_type __n, const value_type& __x = _Tp(),
113 slist(size_type __n, const value_type& __x,
116 : _M_non_dbg_impl(__n, __x, __a), _M_iter_list(&_M_non_dbg_impl) {} in _M_non_dbg_impl() argument
165 slist(const _Self& __x) : in slist() argument
166 _ConstructCheck(__x), in slist()
167 _M_non_dbg_impl(__x._M_non_dbg_impl), _M_iter_list(&_M_non_dbg_impl) {} in slist()
169 _Self& operator= (const _Self& __x) {
170 if (this != &__x) {
172 _M_non_dbg_impl = __x._M_non_dbg_impl;
203 void swap(_Self& __x) { in swap() argument
[all …]
D_list.h95 explicit list(size_type __n, const _Tp& __x = _Tp(),
97 list(size_type __n, const _Tp& __x,
100 : _M_non_dbg_impl(__n, __x, __a), _M_iter_list(&_M_non_dbg_impl) {} in _M_non_dbg_impl() argument
148 list(const _Self& __x) : in list() argument
149 _ConstructCheck(__x), in list()
150 _M_non_dbg_impl(__x._M_non_dbg_impl) , _M_iter_list(&_M_non_dbg_impl) {} in list()
152 _Self& operator=(const _Self& __x) {
153 if (this != &__x) {
156 _M_non_dbg_impl = __x._M_non_dbg_impl;
197 void swap(_Self& __x) { in swap() argument
[all …]
D_tree.h127 _Rb_tree(const _Self& __x) in _Rb_tree() argument
128 : _M_non_dbg_impl(__x._M_non_dbg_impl), _M_iter_list(&_M_non_dbg_impl) {} in _Rb_tree()
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
186 { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); } in lower_bound()
188 const_iterator lower_bound(const _KT& __x) const in lower_bound() argument
189 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); } in lower_bound()
[all …]
/ndk/sources/cxx-stl/stlport/stlport/stl/config/
D_sgi.h10 #define _STLP_NATIVE_HEADER(__x) </usr/include/CC/##__x> argument
11 #define _STLP_NATIVE_C_HEADER(__x) </usr/include/##__x> argument
12 #define _STLP_NATIVE_OLD_STREAMS_HEADER(__x) </usr/include/CC/##__x> argument
13 #define _STLP_NATIVE_CPP_C_HEADER(__x) </usr/include/CC/##__x> argument
14 #define _STLP_NATIVE_CPP_RUNTIME_HEADER(__x) </usr/include/CC/##__x> argument

123456