📄 mset.htm
字号:
<html>
<head>
<title> The multiset Class</title>
</head>
<body bgcolor="#FFFFFF">
<img src="msetban.gif">
<pre>
<font size=5>Class Name</font> multiset
<font size=5>Header File</font> <set>
<font size=5>Classification</font> Container
</pre>
<a href="mset.htm#desc">Class Description</a><br>
<h1>Member Classes</h1>
<i>None</i>
<h1>Methods</h1>
<pre>
<a href="common.htm#begin">iterator begin()</a><br>
<a href="common.htm#begin">const_iterator begin() const</a><br>
<a href="list.htm#clear">void clear()</a><br>
<a href="assoc.htm#count">size_type count(const key_type& x) const</a><br>
<a href="common.htm#empty">bool empty() const</a><br>
<a href="common.htm#end">iterator end()</a><br>
<a href="common.htm#end">const_iterator end() const</a><br>
<a href="assoc.htm#erase1">void erase(iterator position)</a><br>
<a href="assoc.htm#erase2">size_type erase(const key_type& x)</a><br>
<a href="assoc.htm#erase3">void erase(iterator first, iterator last)</a><br>
<a href="assoc.htm#equal">pair<iterator,iterator> equal_range(const key_type& x) const</a><br>
<a href="assoc.htm#find1">iterator find(const key_type& x) const</a><br>
<a href="list.htm#getallocator">allocator_type get_allocator() const</a><br>
<a href="assoc.htm#insert1">pair<iterator,bool> insert(const value_type& x)</a><br>
<a href="assoc.htm#insert2">iterator insert(iterator position, const value_type& x)</a><br>
<a href="assoc.htm#insert3">template <class InputIterator>void insert(InputIterator first, InputIterator last)</a><br>
<a href="assoc.htm#lower">iterator lower_bound(const key_type& x) const</a><br>
<a href="common.htm#maxsize">size_type max_size() const</a><br>
<a href="mset.htm#mset1">explicit multiset(const Compare& comp = Compare(), const Allocator& = Allocator())</a><br>
<a href="mset.htm#mset2">template <class InputIterator> multiset(InputIterator first, InputIterator last, const Compare& comp = Compare(), const Allocator& = Allocator())</a><br>
<a href="mset.htm#mset3">multiset(const multiset<Key,Compare,Allocator>& x)</a><br>
<a href="mset.htm#mset4">~multiset()</a><br>
<a href="common.htm#rbegin">reverse_iterator rbegin()</a><br>
<a href="common.htm#rbegin">const_reverse_iterator rbegin() const</a><br>
<a href="common.htm#rend">reverse_iterator rend()</a><br>
<a href="list.htm#resize">void resize(size_type Sz, T C = T())</a><br>
<a href="common.htm#rend">const_reverse_iterator rend() const</a><br>
<a href="common.htm#size">size_type size() const</a><br>
<a href="mset.htm#swap">void swap(muliset<Key,Compare,Allocator>& X)</a><br>
<a href="assoc.htm#upper">iterator upper_bound(const key_type& x) const</a><br>
</pre>
<h2>Operators</h2>
multiset<Key,Compare,Allocator<& operator=(const multiset<Key,Compare,Allocator>& x)
<a name="desc"><h3>Class Description</h3></a>
<p>
A multiset is a set that can contain duplicates of members. A set is a unordered collection of
unique elements. A <i>multiset</i> is a unordered collection of not necessarily unique elements.
</p>
<hr>
<pre>
<a name="swap">Method swap()</a>
Access Public
Classification Modifier
Syntax void swap(multiset<Key,Compare,Allocator>& X)
Parameters X is the multiset to be swapped with the contents of the current multiset.
Return X is the multiset to be swapped.
</pre>
<h3>Description</h3>
<p>
The swap() method swaps the contents of the current multiset with multiset X.
</p>
<hr>
<pre>
<a name="mset1">Method multiset()</a>
Access Public
Classification Constructor
Syntax explicit multiset(const Compare& Comp = Compare(), const Allocator &X = Allocator())
Parameters Comp is the function object that will be used to order the multiset.
X is a allocator object.
Return None.
</pre>
<h3>Description</h3>
<p>
The multiset() method constructs an empty multiset container.
</p>
<hr>
<pre>
<a name="mset2">Method multiset()</a>
Access Public
Classification Constructor
Syntax template <class InputIterator> multiset(InputIterator first, InputIterator last,const Compare& Comp = Compare(), const Allocator&X = Allocator())
Parameters elements from the range [first,last) will be used to construct the multiset. X is a allocator object.
Comp is the function object that will be used to order the multiset.
Return None.
</pre>
<h3>Description</h3>
<p>
The multiset() method constructs a multiset that contains copies of the objects that are pointed to by the
iterators in the range [first,last].
</p>
<hr>
<pre>
<a name="mset3">Method multiset()</a>
Access Public
Classification Constructor
Syntax multiset(const multiset<Key,Compare,Allocator>& X)
Parameters X is the multiset that will be used to construct the new multiset.
Return None.
</pre>
<h3>Description</h3>
<p>
The multiset() method constructs a new multiset from multiset X.
</p>
<hr>
<pre>
<a name="mset4">Method multiset()</a>
Access Public
Classification Destructor
Syntax ~multiset()
Parameters None.
Return None.
</pre>
<h3>Description</h3>
<p>
The ~multiset() method destructs a multiset object.
</p>
<hr>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -