1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
The ti(unordered_multiset) allows multiple objects using the same keys to be
stored in an unordered set. The tt(unordered_multiset) container offers the
same set of members and constructors as the tt(unordered_set), but without the
unique-key restriction imposed upon the tt(unordered_set).
Below all members are described whose behavior differs from the behavior of
the corresponding tt(unordered_set) members:
itemization(
ithtq(count)(size_t count(key_type const &key))
(returns the number of times a tt(value_type) object using
tt(key_type) tt(key) is stored in the tt(unordered_set). This member is
commonly used to verify whether tt(key) is available in the
tt(unordered_multiset).)
ithtq(emplace)
(iterator emplace(Args &&...args))
(a tt(value_type) object is constructed from tt(emplace)'s
arguments. The returned tt(iterator) points to the newly inserted inserted
tt(value_type).)
ithtq(emplace_hint)(iterator emplace_hint(const_iterator position,
Args &&...args))
(a tt(value_type) object is constructed from the member's
arguments, and the newly created element is inserted into the
tt(unordered_multiset). The
implementation may or may not use tt(position) as a em(hint) to start looking
for an insertion point. The returned tt(iterator) points to the tt(value_type)
using the provided key.)
ithtq(equal_range)
(pair<iterator, iterator> equal_range(key))(this
member returns a pair of iterators defining the range of elements having a
key that is equal to tt(key).)
ithtq(find)(iterator find(key))
(returns an iterator to an element having the given key. If no
such element is available, tt(end) is returned.)
itht(insert)(... insert()):
quote(elements may be inserted starting at a certain position. The
return value depends on the version of tt(insert()) that is called. When an
tt(iterator) is returned, then it points to the element that was inserted.)
itemization(
itt(iterator insert(value_type const &value))
inserts tt(value).
itt(iterator insert(value_type &&tmp))
inserts tt(value) using tt(value_type)'s move
constructor.
itt(iterator insert(const_iterator hint, value_type const &value))
inserts tt(value), possibly using tt(hint) as a
starting point when trying to insert tt(value).
itt(iterator insert(const_iterator hint, value_type &&tmp))
inserts tt(value) using tt(value_type)'s move
constructor, and possibly using tt(hint) as a starting point when trying to
insert tt(value).
itt(void insert(first, beyond)) inserts the elements in
the iterator range rangett(first, beyond).
itt(void insert(initializer_list <value_type> iniList))
inserts the elements in tt(iniList) into the container.
)
)
|
