public member function
<map>
std::map::emplace_hinttemplate <class... Args> iterator emplace_hint (const_iterator position, Args&&... args);
Construct and insert element with hint
Inserts a new element in the map if its key is unique, with a hint on the insertion position. This new element is constructed in place using args as the arguments for the construction of a value_type (which is an object of a pair type).The insertion only takes place if no other element in the container has a key equivalent to the one being emplaced (elements in a map container are unique).
If inserted, this effectively increases the container size by one.
The value in position is used as a hint on the insertion point. The element will nevertheless be inserted at its corresponding position following the order described by its internal comparison object, but this hint is used by the function to begin its search for the insertion point, speeding up the process considerably when the actual insertion point is either position or close to it.
The element is constructed in-place by calling allocator_traits::construct with args forwarded.
Arguments used to construct a new object of the mapped type for the inserted element.
Arguments forwarded to construct the new element (of type
pair<const key_type, mapped_type>
).
This can be one of:
- Two arguments: one for the
key, the other for the
mapped value.
- A single argument of a
pair
type with a value for the
keyas first member, and a value for the
mapped valueas second.
-
piecewise_constructas first argument, and two additional arguments with
tuplesto be forwarded as arguments for the
key valueand for the
mapped valuerespectivelly.
See
pair::pairfor more info.
Otherwise, it returns an iterator to the equivalent element within the container.
Member type iterator is a bidirectional iterator type that points to an element.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
// map::emplace_hint
#include <iostream>
#include <map>
int main ()
{
std::map<char,int> mymap;
auto it = mymap.end();
it = mymap.emplace_hint(it,'b',10);
mymap.emplace_hint(it,'a',12);
mymap.emplace_hint(mymap.end(),'c',14);
std::cout << "mymap contains:";
for (auto& x: mymap)
std::cout << " [" << x.first << ':' << x.second << ']';
std::cout << '\n';
return 0;
}
Output:
mymap contains: [a:12] [b:10] [c:14]
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4