| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_multiset.h | 184 * @param __x A %multiset of identical element and allocator types.
187 * by @a __x.
189 multiset(const multiset& __x)
190 : _M_t(__x._M_t) { }
195 * @param __x A %multiset of identical element and allocator types.
197 * The newly-created %multiset contains the exact contents of @a __x.
198 * The contents of @a __x are a valid, but unspecified %multiset.
200 multiset(multiset&& __x)
202 : _M_t(std::move(__x._M_t)) { }
223 * @param __x A %multiset of identical element and allocator types
[all...] |
| stl_iterator.h | 126 reverse_iterator(iterator_type __x) : current(__x) { }
131 reverse_iterator(const reverse_iterator& __x)
132 : current(__x.current) { }
139 reverse_iterator(const reverse_iterator<_Iter>& __x)
140 : current(__x.base()) { }
281 * @param __x A %reverse_iterator.
291 operator==(const reverse_iterator<_Iterator>& __x,
293 { return __x.base() == __y.base(); }
297 operator<(const reverse_iterator<_Iterator>& __x,
[all...] |
| stl_multimap.h | 124 bool operator()(const value_type& __x, const value_type& __y) const
125 { return comp(__x.first, __y.first); }
172 * @param __x A %multimap of identical element and allocator types.
175 * used by @a __x.
177 multimap(const multimap& __x)
178 : _M_t(__x._M_t) { }
183 * @param __x A %multimap of identical element and allocator types.
185 * The newly-created %multimap contains the exact contents of @a __x.
186 * The contents of @a __x are a valid, but unspecified %multimap.
188 multimap(multimap&& __x)
[all...] |
| stl_stack.h | 178 * @param __x Data to be added.
186 push(const value_type& __x)
187 { c.push_back(__x); }
191 push(value_type&& __x)
192 { c.push_back(std::move(__x)); }
231 * @param __x A %stack.
232 * @param __y A %stack of the same type as @a __x.
243 operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
244 { return __x.c == __y.c; }
248 * @param __x A %stack
[all...] |
| stl_set.h | 188 * @param __x A %set of identical element and allocator types.
191 * by @a __x.
193 set(const set& __x)
194 : _M_t(__x._M_t) { }
199 * @param __x A %set of identical element and allocator types.
204 set(set&& __x)
206 : _M_t(std::move(__x._M_t)) { }
227 * @param __x A %set of identical element and allocator types.
229 * All the elements of @a __x are copied, but unlike the copy
233 operator=(const set& __x)
[all...] |
| stl_queue.h | 204 * @param __x Data to be added.
212 push(const value_type& __x)
213 { c.push_back(__x); }
217 push(value_type&& __x)
218 { c.push_back(std::move(__x)); }
257 * @param __x A %queue.
258 * @param __y A %queue of the same type as @a __x.
268 operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
269 { return __x.c == __y.c; }
273 * @param __x A %queue
[all...] |
| stl_pair.h | 133 constexpr pair(_U1&& __x, const _T2& __y)
134 : first(std::forward<_U1>(__x)), second(__y) { }
138 constexpr pair(const _T1& __x, _U2&& __y)
139 : first(__x), second(std::forward<_U2>(__y)) { }
144 constexpr pair(_U1&& __x, _U2&& __y)
145 : first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y)) { }
214 operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
215 { return __x.first == __y.first && __x.second == __y.second; }
220 operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y
[all...] |
| stl_list.h | 83 swap(_List_node_base& __x, _List_node_base& __y) _GLIBCXX_USE_NOEXCEPT;
140 _List_iterator(__detail::_List_node_base* __x)
141 : _M_node(__x) { }
183 operator==(const _Self& __x) const
184 { return _M_node == __x._M_node; }
187 operator!=(const _Self& __x) const
188 { return _M_node != __x._M_node; }
216 _List_const_iterator(const __detail::_List_node_base* __x)
217 : _M_node(__x) { }
219 _List_const_iterator(const iterator& __x)
975 { this->_M_insert(begin(), __x); } local
1016 { this->_M_insert(end(), __x); } local
1481 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local
[all...] |
| stl_tree.h | 102 _S_minimum(_Base_ptr __x)
104 while (__x->_M_left != 0) __x = __x->_M_left;
105 return __x;
109 _S_minimum(_Const_Base_ptr __x)
111 while (__x->_M_left != 0) __x = __x->_M_left;
112 return __x;
1069 _Link_type __x = _M_begin(); local
1205 _Link_type __x = _M_begin(); local
1236 _Const_Link_type __x = _M_begin(); local
1318 _Link_type __x = _M_begin(); local
1350 _Link_type __x = _M_begin(); local
1603 _Link_type __x = _M_begin(); local
1839 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node); local
[all...] |
| /external/clang/test/Modules/Inputs/PR24954/ |
| B.h | 14 operator<<(basic_ostream<_CharT>& __os, const S1& __x);
22 operator<<(basic_ostream<_CharT>& __os, const S2<_CharT>& __x);
27 operator<<(basic_ostream<_Cp>& __os, const S2<_Cp>& __x);
|
| /external/clang/test/Modules/Inputs/PR20399/ |
| stl_map.h | 5 operator-(int __x, reverse_iterator __y) {}
|
| /external/fio/ |
| minmax.h | 21 typeof(x) __x = (x); \
23 __x == 0 ? __y : ((__y == 0) ? __x : min(__x, __y)); })
|
| /external/tensorflow/tensorflow/stream_executor/lib/ |
| status_macros.h | 33 #define SE_MACRO_CONCAT_INNER(__x, __y) __x##__y
34 #define SE_MACRO_CONCAT(__x, __y) SE_MACRO_CONCAT_INNER(__x, __y)
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_iterator.h | 126 reverse_iterator(iterator_type __x) : current(__x) { }
131 reverse_iterator(const reverse_iterator& __x)
132 : current(__x.current) { }
139 reverse_iterator(const reverse_iterator<_Iter>& __x)
140 : current(__x.base()) { }
281 * @param __x A %reverse_iterator.
291 operator==(const reverse_iterator<_Iterator>& __x,
293 { return __x.base() == __y.base(); }
297 operator<(const reverse_iterator<_Iterator>& __x,
[all...] |
| stl_multimap.h | 124 bool operator()(const value_type& __x, const value_type& __y) const
125 { return comp(__x.first, __y.first); }
172 * @param __x A %multimap of identical element and allocator types.
175 * used by @a __x.
177 multimap(const multimap& __x)
178 : _M_t(__x._M_t) { }
183 * @param __x A %multimap of identical element and allocator types.
185 * The newly-created %multimap contains the exact contents of @a __x.
186 * The contents of @a __x are a valid, but unspecified %multimap.
188 multimap(multimap&& __x)
[all...] |
| stl_stack.h | 178 * @param __x Data to be added.
186 push(const value_type& __x)
187 { c.push_back(__x); }
191 push(value_type&& __x)
192 { c.push_back(std::move(__x)); }
231 * @param __x A %stack.
232 * @param __y A %stack of the same type as @a __x.
243 operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
244 { return __x.c == __y.c; }
248 * @param __x A %stack
[all...] |
| stl_set.h | 188 * @param __x A %set of identical element and allocator types.
191 * by @a __x.
193 set(const set& __x)
194 : _M_t(__x._M_t) { }
199 * @param __x A %set of identical element and allocator types.
204 set(set&& __x)
206 : _M_t(std::move(__x._M_t)) { }
227 * @param __x A %set of identical element and allocator types.
229 * All the elements of @a __x are copied, but unlike the copy
233 operator=(const set& __x)
[all...] |
| stl_queue.h | 204 * @param __x Data to be added.
212 push(const value_type& __x)
213 { c.push_back(__x); }
217 push(value_type&& __x)
218 { c.push_back(std::move(__x)); }
257 * @param __x A %queue.
258 * @param __y A %queue of the same type as @a __x.
268 operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
269 { return __x.c == __y.c; }
273 * @param __x A %queue
[all...] |
| stl_pair.h | 133 constexpr pair(_U1&& __x, const _T2& __y)
134 : first(std::forward<_U1>(__x)), second(__y) { }
138 constexpr pair(const _T1& __x, _U2&& __y)
139 : first(__x), second(std::forward<_U2>(__y)) { }
144 constexpr pair(_U1&& __x, _U2&& __y)
145 : first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y)) { }
214 operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
215 { return __x.first == __y.first && __x.second == __y.second; }
220 operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y
[all...] |
| stl_list.h | 83 swap(_List_node_base& __x, _List_node_base& __y) _GLIBCXX_USE_NOEXCEPT;
140 _List_iterator(__detail::_List_node_base* __x)
141 : _M_node(__x) { }
183 operator==(const _Self& __x) const
184 { return _M_node == __x._M_node; }
187 operator!=(const _Self& __x) const
188 { return _M_node != __x._M_node; }
216 _List_const_iterator(const __detail::_List_node_base* __x)
217 : _M_node(__x) { }
219 _List_const_iterator(const iterator& __x)
975 { this->_M_insert(begin(), __x); } local
1016 { this->_M_insert(end(), __x); } local
1481 { _M_fill_initialize(static_cast<size_type>(__n), __x); } local
[all...] |
| stl_tree.h | 102 _S_minimum(_Base_ptr __x)
104 while (__x->_M_left != 0) __x = __x->_M_left;
105 return __x;
109 _S_minimum(_Const_Base_ptr __x)
111 while (__x->_M_left != 0) __x = __x->_M_left;
112 return __x;
1069 _Link_type __x = _M_begin(); local
1205 _Link_type __x = _M_begin(); local
1236 _Const_Link_type __x = _M_begin(); local
1318 _Link_type __x = _M_begin(); local
1350 _Link_type __x = _M_begin(); local
1603 _Link_type __x = _M_begin(); local
1839 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| special_function_util.h | 110 inline bool __isnan(_Tp __x)
111 { return std::isnan(__x); }
116 inline bool __isnan(const _Tp __x)
117 { return __builtin_isnan(__x); }
120 inline bool __isnan<float>(float __x)
121 { return __builtin_isnanf(__x); }
124 inline bool __isnan<long double>(long double __x)
125 { return __builtin_isnanl(__x); }
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
| special_function_util.h | 110 inline bool __isnan(_Tp __x)
111 { return std::isnan(__x); }
116 inline bool __isnan(const _Tp __x)
117 { return __builtin_isnan(__x); }
120 inline bool __isnan<float>(float __x)
121 { return __builtin_isnanf(__x); }
124 inline bool __isnan<long double>(long double __x)
125 { return __builtin_isnanl(__x); }
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/debug/ |
| multiset.h | 88 multiset(const multiset& __x)
89 : _Base(__x) { }
91 multiset(const _Base& __x)
92 : _Base(__x) { }
95 multiset(multiset&& __x)
97 : _Base(std::move(__x))
98 { this->_M_swap(__x); }
109 operator=(const multiset& __x)
111 *static_cast<_Base*>(this) = __x;
118 operator=(multiset&& __x)
[all...] |
| set.h | 88 set(const set& __x)
89 : _Base(__x) { }
91 set(const _Base& __x)
92 : _Base(__x) { }
95 set(set&& __x)
97 : _Base(std::move(__x))
98 { this->_M_swap(__x); }
109 operator=(const set& __x)
111 *static_cast<_Base*>(this) = __x;
118 operator=(set&& __x)
[all...] |
