Lines Matching refs:__x
124 _Deque_iterator(_Tp* __x, _Map_pointer __y)
125 : _M_cur(__x), _M_first(*__y),
130 _Deque_iterator(const iterator& __x)
131 : _M_cur(__x._M_cur), _M_first(__x._M_first),
132 _M_last(__x._M_last), _M_node(__x._M_node) {}
243 operator==(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
245 { return __x._M_cur == __y._M_cur; }
250 operator==(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
252 { return __x._M_cur == __y._M_cur; }
256 operator!=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
258 { return !(__x == __y); }
263 operator!=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
265 { return !(__x == __y); }
269 operator<(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
271 { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur)
272 : (__x._M_node < __y._M_node); }
277 operator<(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
279 { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur)
280 : (__x._M_node < __y._M_node); }
284 operator>(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
286 { return __y < __x; }
291 operator>(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
293 { return __y < __x; }
297 operator<=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
299 { return !(__y < __x); }
304 operator<=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
306 { return !(__y < __x); }
310 operator>=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
312 { return !(__x < __y); }
317 operator>=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
319 { return !(__x < __y); }
327 operator-(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x,
332 * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first)
339 operator-(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x,
344 * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first)
350 operator+(ptrdiff_t __n, const _Deque_iterator<_Tp, _Ref, _Ptr>& __x)
351 { return __x + __n; }
706 deque(const deque& __x)
707 : _Base(__x._M_get_Tp_allocator(), __x.size())
708 { std::__uninitialized_copy_a(__x.begin(), __x.end(),
752 operator=(const deque& __x);
887 resize(size_type __new_size, value_type __x = value_type())
893 insert(this->_M_impl._M_finish, __new_size - __len, __x);
1032 push_front(const value_type& __x)
1036 this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, __x);
1040 _M_push_front_aux(__x);
1053 push_back(const value_type& __x)
1058 this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __x);
1062 _M_push_back_aux(__x);
1117 insert(iterator __position, const value_type& __x);
1129 insert(iterator __position, size_type __n, const value_type& __x)
1130 { _M_fill_insert(__position, __n, __x); }
1197 swap(deque& __x)
1199 std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
1200 std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
1201 std::swap(this->_M_impl._M_map, __x._M_impl._M_map);
1202 std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size);
1207 __x._M_get_Tp_allocator());
1226 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
1229 _M_fill_initialize(__x);
1370 _Integer __n, _Integer __x, __true_type)
1373 static_cast<value_type>(__x));
1404 _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
1408 _M_insert_aux(iterator __pos, const value_type& __x);
1412 _M_insert_aux(iterator __pos, size_type __n, const value_type& __x);
1549 operator==(const deque<_Tp, _Alloc>& __x,
1551 { return __x.size() == __y.size()
1552 && std::equal(__x.begin(), __x.end(), __y.begin()); }
1567 operator<(const deque<_Tp, _Alloc>& __x,
1569 { return std::lexicographical_compare(__x.begin(), __x.end(),
1575 operator!=(const deque<_Tp, _Alloc>& __x,
1577 { return !(__x == __y); }
1582 operator>(const deque<_Tp, _Alloc>& __x,
1584 { return __y < __x; }
1589 operator<=(const deque<_Tp, _Alloc>& __x,
1591 { return !(__y < __x); }
1596 operator>=(const deque<_Tp, _Alloc>& __x,
1598 { return !(__x < __y); }
1603 swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y)
1604 { __x.swap(__y); }