Lines Matching refs:__x
119 bool operator()(const value_type& __x, const value_type& __y) const
120 { return comp(__x.first, __y.first); }
167 * @param __x A %multimap of identical element and allocator types.
170 * used by @a __x.
172 multimap(const multimap& __x)
173 : _M_t(__x._M_t) { }
178 * @param __x A %multimap of identical element and allocator types.
180 * The newly-created %multimap contains the exact contents of @a __x.
181 * The contents of @a __x are a valid, but unspecified %multimap.
183 multimap(multimap&& __x)
185 : _M_t(std::move(__x._M_t)) { }
247 * @param __x A %multimap of identical element and allocator types.
249 * All the elements of @a __x are copied, but unlike the copy
253 operator=(const multimap& __x)
255 _M_t = __x._M_t;
262 * @param __x A %multimap of identical element and allocator types.
264 * The contents of @a __x are moved into this multimap (without copying).
265 * @a __x is a valid, but unspecified multimap.
268 operator=(multimap&& __x)
273 this->swap(__x);
432 * @param __x Pair to be inserted (see std::make_pair for easy creation
443 insert(const value_type& __x)
444 { return _M_t._M_insert_equal(__x); }
451 insert(_Pair&& __x)
452 { return _M_t._M_insert_equal(std::forward<_Pair>(__x)); }
459 * @param __x Pair to be inserted (see std::make_pair for easy creation
477 insert(const_iterator __position, const value_type& __x)
479 insert(iterator __position, const value_type& __x)
481 { return _M_t._M_insert_equal_(__position, __x); }
488 insert(const_iterator __position, _Pair&& __x)
490 std::forward<_Pair>(__x)); }
562 * @param __x Key of element to be erased.
572 erase(const key_type& __x)
573 { return _M_t.erase(__x); }
618 * @param __x A %multimap of the same element and allocator types.
628 swap(multimap& __x)
629 { _M_t.swap(__x._M_t); }
661 * @param __x Key of (key, value) pair to be located.
671 find(const key_type& __x)
672 { return _M_t.find(__x); }
676 * @param __x Key of (key, value) pair to be located.
686 find(const key_type& __x) const
687 { return _M_t.find(__x); }
691 * @param __x Key of (key, value) pairs to be located.
695 count(const key_type& __x) const
696 { return _M_t.count(__x); }
700 * @param __x Key of (key, value) pair to be located.
710 lower_bound(const key_type& __x)
711 { return _M_t.lower_bound(__x); }
715 * @param __x Key of (key, value) pair to be located.
725 lower_bound(const key_type& __x) const
726 { return _M_t.lower_bound(__x); }
730 * @param __x Key of (key, value) pair to be located.
735 upper_bound(const key_type& __x)
736 { return _M_t.upper_bound(__x); }
740 * @param __x Key of (key, value) pair to be located.
745 upper_bound(const key_type& __x) const
746 { return _M_t.upper_bound(__x); }
750 * @param __x Key of (key, value) pairs to be located.
762 equal_range(const key_type& __x)
763 { return _M_t.equal_range(__x); }
767 * @param __x Key of (key, value) pairs to be located.
779 equal_range(const key_type& __x) const
780 { return _M_t.equal_range(__x); }
795 * @param __x A %multimap.
796 * @param __y A %multimap of the same type as @a __x.
805 operator==(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
807 { return __x._M_t == __y._M_t; }
811 * @param __x A %multimap.
812 * @param __y A %multimap of the same type as @a __x.
822 operator<(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
824 { return __x._M_t < __y._M_t; }
829 operator!=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
831 { return !(__x == __y); }
836 operator>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
838 { return __y < __x; }
843 operator<=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
845 { return !(__y < __x); }
850 operator>=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
852 { return !(__x < __y); }
857 swap(multimap<_Key, _Tp, _Compare, _Alloc>& __x,
859 { __x.swap(__y); }
