Lines Matching defs:__x
101 void _M_swap_data(_Vector_impl& __x)
103 std::swap(_M_start, __x._M_start);
104 std::swap(_M_finish, __x._M_finish);
105 std::swap(_M_end_of_storage, __x._M_end_of_storage);
142 _Vector_base(_Vector_base&& __x)
143 : _M_impl(std::move(__x._M_get_Tp_allocator()))
144 { this->_M_impl._M_swap_data(__x._M_impl); }
146 _Vector_base(_Vector_base&& __x, const allocator_type& __a)
149 if (__x.get_allocator() == __a)
150 this->_M_impl._M_swap_data(__x._M_impl);
153 size_t __n = __x._M_impl._M_finish - __x._M_impl._M_start;
303 * @param __x A %vector of identical element and allocator types.
306 * object used by @a __x. All the elements of @a __x are copied,
308 * @a __x (for fast expansion) will not be copied.
310 vector(const vector& __x)
311 : _Base(__x.size(),
312 _Alloc_traits::_S_select_on_copy(__x._M_get_Tp_allocator()))
314 std::__uninitialized_copy_a(__x.begin(), __x.end(),
322 * @param __x A %vector of identical element and allocator types.
324 * The newly-created %vector contains the exact contents of @a __x.
325 * The contents of @a __x are a valid, but unspecified %vector.
327 vector(vector&& __x) noexcept
328 : _Base(std::move(__x)) { }
331 vector(const vector& __x, const allocator_type& __a)
332 : _Base(__x.size(), __a)
334 std::__uninitialized_copy_a(__x.begin(), __x.end(),
420 * @param __x A %vector of identical element and allocator types.
422 * All the elements of @a __x are copied, but any extra memory in
423 * @a __x (for fast expansion) will not be copied. Unlike the
427 operator=(const vector& __x);
432 * @param __x A %vector of identical element and allocator types.
434 * The contents of @a __x are moved into this %vector (without copying,
436 * @a __x is a valid, but unspecified %vector.
439 operator=(vector&& __x) noexcept(_Alloc_traits::_S_nothrow_move())
444 _M_move_assign(std::move(__x),
675 * @param __x Data with which new elements should be populated.
684 resize(size_type __new_size, const value_type& __x)
687 insert(end(), __new_size - size(), __x);
695 * @param __x Data with which new elements should be populated.
704 resize(size_type __new_size, value_type __x = value_type())
707 insert(end(), __new_size - size(), __x);
892 * @param __x Data to be added.
901 push_back(const value_type& __x)
906 __x);
911 _M_emplace_back_aux(__x);
913 _M_insert_aux(end(), __x);
919 push_back(value_type&& __x)
920 { emplace_back(std::move(__x)); }
964 * @param __x Data to be inserted.
973 insert(iterator __position, const value_type& __x);
979 * @param __x Data to be inserted.
988 insert(iterator __position, value_type&& __x)
989 { return emplace(__position, std::move(__x)); }
1013 * @param __x Data to be inserted.
1023 insert(iterator __position, size_type __n, const value_type& __x)
1024 { _M_fill_insert(__position, __n, __x); }
1100 * @param __x A %vector of the same element and allocator types.
1108 swap(vector& __x)
1113 this->_M_impl._M_swap_data(__x._M_impl);
1115 __x._M_get_Tp_allocator());
1309 _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
1323 _M_insert_aux(iterator __position, const value_type& __x);
1362 _M_move_assign(vector&& __x, std::true_type) noexcept
1366 this->_M_impl._M_swap_data(__x._M_impl);
1369 __x._M_get_Tp_allocator());
1375 _M_move_assign(vector&& __x, std::false_type)
1377 if (__x._M_get_Tp_allocator() == this->_M_get_Tp_allocator())
1378 _M_move_assign(std::move(__x), std::true_type());
1383 this->assign(std::__make_move_if_noexcept_iterator(__x.begin()),
1384 std::__make_move_if_noexcept_iterator(__x.end()));
1385 __x.clear();
1394 * @param __x A %vector.
1395 * @param __y A %vector of the same type as @a __x.
1404 operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1405 { return (__x.size() == __y.size()
1406 && std::equal(__x.begin(), __x.end(), __y.begin())); }
1410 * @param __x A %vector.
1411 * @param __y A %vector of the same type as @a __x.
1412 * @return True iff @a __x is lexicographically less than @a __y.
1421 operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1422 { return std::lexicographical_compare(__x.begin(), __x.end(),
1428 operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1429 { return !(__x == __y); }
1434 operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1435 __x; }
1440 operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1441 { return !(__y < __x); }
1446 operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
1447 { return !(__x < __y); }
1452 swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y)
1453 { __x.swap(__y); }
