Lines Matching defs:__x
82 swap(_List_node_base& __x, _List_node_base& __y) throw ();
139 _List_iterator(__detail::_List_node_base* __x)
140 : _M_node(__x) { }
182 operator==(const _Self& __x) const
183 { return _M_node == __x._M_node; }
186 operator!=(const _Self& __x) const
187 { return _M_node != __x._M_node; }
215 _List_const_iterator(const __detail::_List_node_base* __x)
216 : _M_node(__x) { }
218 _List_const_iterator(const iterator& __x)
219 : _M_node(__x._M_node) { }
262 operator==(const _Self& __x) const
263 { return _M_node == __x._M_node; }
266 operator!=(const _Self& __x) const
267 { return _M_node != __x._M_node; }
275 operator==(const _List_iterator<_Val>& __x,
277 { return __x._M_node == __y._M_node; }
281 operator!=(const _List_iterator<_Val>& __x,
283 { return __x._M_node != __y._M_node; }
361 _List_base(_List_base&& __x)
362 : _M_impl(__x._M_get_Node_allocator())
366 __x._M_impl._M_node);
471 _M_create_node(const value_type& __x)
477 (std::__addressof(__p->_M_data), __x);
571 list(const list& __x)
572 : _Base(__x._M_get_Node_allocator())
573 { _M_initialize_dispatch(__x.begin(), __x.end(), __false_type()); }
583 list(list&& __x)
584 : _Base(std::move(__x)) { }
636 operator=(const list& __x);
647 operator=(list&& __x)
652 this->swap(__x);
877 resize(size_type __new_size, const value_type& __x);
890 resize(size_type __new_size, value_type __x = value_type());
946 push_front(const value_type& __x)
947 { this->_M_insert(begin(), __x); }
951 push_front(value_type&& __x)
952 { this->_M_insert(begin(), std::move(__x)); }
987 push_back(const value_type& __x)
988 { this->_M_insert(end(), __x); }
992 push_back(value_type&& __x)
993 { this->_M_insert(end(), std::move(__x)); }
1046 insert(iterator __position, const value_type& __x);
1061 insert(iterator __position, value_type&& __x)
1062 { return emplace(__position, std::move(__x)); }
1095 insert(iterator __position, size_type __n, const value_type& __x)
1097 list __tmp(__n, __x, _M_get_Node_allocator());
1177 swap(list& __x)
1180 __x._M_impl._M_node);
1185 _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator());
1215 splice(iterator __position, list&& __x)
1217 splice(iterator __position, list& __x)
1220 if (!__x.empty())
1222 _M_check_equal_allocators(__x);
1224 this->_M_transfer(__position, __x.begin(), __x.end());
1230 splice(iterator __position, list& __x)
1231 { splice(__position, std::move(__x)); }
1245 splice(iterator __position, list&& __x, iterator __i)
1247 splice(iterator __position, list& __x, iterator __i)
1255 if (this != &__x)
1256 _M_check_equal_allocators(__x);
1263 splice(iterator __position, list& __x, iterator __i)
1264 { splice(__position, std::move(__x), __i); }
1281 splice(iterator __position, list&& __x, iterator __first,
1284 splice(iterator __position, list& __x, iterator __first,
1290 if (this != &__x)
1291 _M_check_equal_allocators(__x);
1299 splice(iterator __position, list& __x, iterator __first, iterator __last)
1300 { splice(__position, std::move(__x), __first, __last); }
1372 merge(list&& __x);
1375 merge(list& __x)
1376 { merge(std::move(__x)); }
1379 merge(list& __x);
1401 merge(list& __x, _StrictWeakOrdering __comp)
1402 { merge(std::move(__x), __comp); }
1446 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
1447 { _M_fill_initialize(static_cast<size_type>(__n), __x); }
1462 _M_fill_initialize(size_type __n, const value_type& __x)
1465 push_back(__x);
1513 _M_insert(iterator __position, const value_type& __x)
1515 _Node* __tmp = _M_create_node(__x);
1544 _M_check_equal_allocators(list& __x)
1547 _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator()))
1564 operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
1567 const_iterator __end1 = __x.end();
1570 const_iterator __i1 = __x.begin();
1593 operator<(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
1594 { return std::lexicographical_compare(__x.begin(), __x.end(),
1600 operator!=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
1601 { return !(__x == __y); }
1606 operator>(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
1607 { return __y < __x; }
1612 operator<=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
1613 { return !(__y < __x); }
1618 operator>=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)
1619 { return !(__x < __y); }
1624 swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y)
1625 { __x.swap(__y); }
