Lines Matching refs:__x
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)
190 : _M_t(std::move(__x._M_t)) { }
252 * @param __x A %multimap of identical element and allocator types.
254 * All the elements of @a __x are copied, but unlike the copy
258 operator=(const multimap& __x)
260 _M_t = __x._M_t;
267 * @param __x A %multimap of identical element and allocator types.
269 * The contents of @a __x are moved into this multimap (without copying).
270 * @a __x is a valid, but unspecified multimap.
273 operator=(multimap&& __x)
278 this->swap(__x);
490 * @param __x Pair to be inserted (see std::make_pair for easy creation
501 insert(const value_type& __x)
502 { return _M_t._M_insert_equal(__x); }
509 insert(_Pair&& __x)
510 { return _M_t._M_insert_equal(std::forward<_Pair>(__x)); }
517 * @param __x Pair to be inserted (see std::make_pair for easy creation
535 insert(const_iterator __position, const value_type& __x)
537 insert(iterator __position, const value_type& __x)
539 { return _M_t._M_insert_equal_(__position, __x); }
546 insert(const_iterator __position, _Pair&& __x)
548 std::forward<_Pair>(__x)); }
621 * @param __x Key of element to be erased.
631 erase(const key_type& __x)
632 { return _M_t.erase(__x); }
677 * @param __x A %multimap of the same element and allocator types.
687 swap(multimap& __x)
688 { _M_t.swap(__x._M_t); }
720 * @param __x Key of (key, value) pair to be located.
730 find(const key_type& __x)
731 { return _M_t.find(__x); }
735 * @param __x Key of (key, value) pair to be located.
745 find(const key_type& __x) const
746 { return _M_t.find(__x); }
750 * @param __x Key of (key, value) pairs to be located.
754 count(const key_type& __x) const
755 { return _M_t.count(__x); }
759 * @param __x Key of (key, value) pair to be located.
769 lower_bound(const key_type& __x)
770 { return _M_t.lower_bound(__x); }
774 * @param __x Key of (key, value) pair to be located.
784 lower_bound(const key_type& __x) const
785 { return _M_t.lower_bound(__x); }
789 * @param __x Key of (key, value) pair to be located.
794 upper_bound(const key_type& __x)
795 { return _M_t.upper_bound(__x); }
799 * @param __x Key of (key, value) pair to be located.
804 upper_bound(const key_type& __x) const
805 { return _M_t.upper_bound(__x); }
809 * @param __x Key of (key, value) pairs to be located.
821 equal_range(const key_type& __x)
822 { return _M_t.equal_range(__x); }
826 * @param __x Key of (key, value) pairs to be located.
838 equal_range(const key_type& __x) const
839 { return _M_t.equal_range(__x); }
854 * @param __x A %multimap.
855 * @param __y A %multimap of the same type as @a __x.
864 operator==(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
866 { return __x._M_t == __y._M_t; }
870 * @param __x A %multimap.
871 * @param __y A %multimap of the same type as @a __x.
881 operator<(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
883 { return __x._M_t < __y._M_t; }
888 operator!=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
890 { return !(__x == __y); }
895 operator>(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
897 { return __y < __x; }
902 operator<=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
904 { return !(__y < __x); }
909 operator>=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
911 { return !(__x < __y); }
916 swap(multimap<_Key, _Tp, _Compare, _Alloc>& __x,
918 { __x.swap(__y); }
