Difference between revisions of "cpp/container/multiset"
(→Member functions: P1206) |
m (→Member types: ~Type) |
||
| (7 intermediate revisions by 2 users not shown) | |||
| Line 12: | Line 12: | ||
{{dcl|num=2|since=c++17|1= | {{dcl|num=2|since=c++17|1= | ||
namespace pmr { | namespace pmr { | ||
| − | template< | + | template< |
| − | + | class Key, | |
| − | + | class Compare = std::less<Key> | |
| − | > using multiset = std::multiset<Key, Compare, std::pmr::polymorphic_allocator<Key>>; | + | > using multiset = std::multiset<Key, Compare, std::pmr::polymorphic_allocator<Key>>; |
} | } | ||
}} | }} | ||
| Line 34: | Line 34: | ||
===Member types=== | ===Member types=== | ||
{{dsc begin}} | {{dsc begin}} | ||
| − | {{dsc hitem| | + | {{dsc hitem|Type|Definition}} |
{{dsc inc|cpp/container/dsc key_type|multiset}} | {{dsc inc|cpp/container/dsc key_type|multiset}} | ||
{{dsc inc|cpp/container/dsc value_type|multiset}} | {{dsc inc|cpp/container/dsc value_type|multiset}} | ||
| Line 102: | Line 102: | ||
{{dsc end}} | {{dsc end}} | ||
| − | {{rrev | + | {{rrev|since=c++17| |
| + | ==={{rl|deduction guides|Deduction guides}}=== | ||
| + | }} | ||
===Notes=== | ===Notes=== | ||
{{cpp/container/assoc_note}} | {{cpp/container/assoc_note}} | ||
| + | |||
| + | {{ftm begin|std=1|comment=1}} | ||
| + | {{ftm|__cpp_lib_containers_ranges|value=202202L|std=C++23|Ranges construction and insertion for containers}} | ||
| + | {{ftm end}} | ||
===Example=== | ===Example=== | ||
{{example}} | {{example}} | ||
| − | ===Defect | + | ===Defect reports=== |
{{dr list begin}} | {{dr list begin}} | ||
{{dr list item|wg=lwg|dr=103|std=C++98|before=iterator allows modification of keys|after=iterator made constant}} | {{dr list item|wg=lwg|dr=103|std=C++98|before=iterator allows modification of keys|after=iterator made constant}} | ||
| Line 116: | Line 122: | ||
{{dr list end}} | {{dr list end}} | ||
| − | {{langlinks|de|es|fr|it|ja | + | ===See also=== |
| + | {{dsc begin}} | ||
| + | {{dsc inc|cpp/container/dsc set}} | ||
| + | {{dsc inc|cpp/container/dsc unordered_multiset}} | ||
| + | {{dsc inc|cpp/container/dsc flat_multiset}} | ||
| + | {{dsc end}} | ||
| + | |||
| + | {{langlinks|de|es|fr|it|ja|pl|pt|ru|zh}} | ||
Latest revision as of 15:48, 1 November 2024
| Defined in header <set>
|
||
| template< class Key, |
(1) | |
| namespace pmr { template< |
(2) | (since C++17) |
std::multiset is an associative container that contains a sorted set of objects of type Key. Unlike set, multiple keys with equivalent values are allowed. Sorting is done using the key comparison function Compare. Search, insertion, and removal operations have logarithmic complexity.
Everywhere the standard library uses the Compare requirements, equivalence is determined by using the equivalence relation as described on Compare. In imprecise terms, two objects a and b are considered equivalent if neither compares less than the other: !comp(a, b) && !comp(b, a).
|
The order of the elements that compare equivalent is the order of insertion and does not change. |
(since C++11) |
std::multiset meets the requirements of Container, AllocatorAwareContainer, AssociativeContainer and ReversibleContainer.
Contents |
[edit] Template parameters
| This section is incomplete Reason: Add descriptions of the template parameters. |
[edit] Member types
| Type | Definition | ||||
key_type
|
Key
| ||||
value_type
|
Key
| ||||
size_type
|
Unsigned integer type (usually std::size_t) | ||||
difference_type
|
Signed integer type (usually std::ptrdiff_t) | ||||
key_compare
|
Compare
| ||||
value_compare
|
Compare
| ||||
allocator_type
|
Allocator
| ||||
reference
|
value_type& | ||||
const_reference
|
const value_type& | ||||
pointer
|
| ||||
const_pointer
|
| ||||
iterator
|
Constant LegacyBidirectionalIterator to value_type
| ||||
const_iterator
|
LegacyBidirectionalIterator to const value_type | ||||
reverse_iterator
|
std::reverse_iterator<iterator> | ||||
const_reverse_iterator
|
std::reverse_iterator<const_iterator> | ||||
node_type (since C++17)
|
a specialization of node handle representing a container node |
[edit] Member functions
constructs the multiset (public member function) | |
destructs the multiset (public member function) | |
| assigns values to the container (public member function) | |
| returns the associated allocator (public member function) | |
Iterators | |
| (C++11) |
returns an iterator to the beginning (public member function) |
| (C++11) |
returns an iterator to the end (public member function) |
| (C++11) |
returns a reverse iterator to the beginning (public member function) |
| (C++11) |
returns a reverse iterator to the end (public member function) |
Capacity | |
| checks whether the container is empty (public member function) | |
| returns the number of elements (public member function) | |
| returns the maximum possible number of elements (public member function) | |
Modifiers | |
| clears the contents (public member function) | |
| inserts elements or nodes(since C++17) (public member function) | |
| (C++23) |
inserts a range of elements (public member function) |
| (C++11) |
constructs element in-place (public member function) |
| (C++11) |
constructs elements in-place using a hint (public member function) |
| erases elements (public member function) | |
| swaps the contents (public member function) | |
| (C++17) |
extracts nodes from the container (public member function) |
| (C++17) |
splices nodes from another container (public member function) |
Lookup | |
| returns the number of elements matching specific key (public member function) | |
| finds element with specific key (public member function) | |
| (C++20) |
checks if the container contains element with specific key (public member function) |
| returns range of elements matching a specific key (public member function) | |
| returns an iterator to the first element not less than the given key (public member function) | |
| returns an iterator to the first element greater than the given key (public member function) | |
Observers | |
| returns the function that compares keys (public member function) | |
returns the function that compares keys in objects of type value_type (public member function) | |
[edit] Non-member functions
| (removed in C++20)(removed in C++20)(removed in C++20)(removed in C++20)(removed in C++20)(C++20) |
lexicographically compares the values of two multisets (function template) |
| specializes the std::swap algorithm (function template) | |
| (C++20) |
erases all elements satisfying specific criteria (function template) |
Deduction guides |
(since C++17) |
[edit] Notes
The member types iterator and const_iterator may be aliases to the same type. This means defining a pair of function overloads using the two types as parameter types may violate the One Definition Rule. Since iterator is convertible to const_iterator, a single function with a const_iterator as parameter type will work instead.
| Feature-test macro | Value | Std | Feature |
|---|---|---|---|
__cpp_lib_containers_ranges |
202202L | (C++23) | Ranges construction and insertion for containers |
[edit] Example
| This section is incomplete Reason: no example |
[edit] Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
| DR | Applied to | Behavior as published | Correct behavior |
|---|---|---|---|
| LWG 103 | C++98 | iterator allows modification of keys | iterator made constant |
| LWG 230 | C++98 | Key was not required to be CopyConstructible(a key of type Key might not be able to be constructed)
|
Key is also required tobe CopyConstructible |
[edit] See also
| collection of unique keys, sorted by keys (class template) | |
| (C++11) |
collection of keys, hashed by keys (class template) |
| (C++23) |
adapts a container to provide a collection of keys, sorted by keys (class template) |
