# std::unordered_multimap<Key,T,Hash,KeyEqual,Allocator>::emplace_hint

> C++ Atlas: `cppatlas.com/w/cpp/container/unordered_multimap/emplace_hint` | Source: https://en.cppreference.com/w/cpp/container/unordered_multimap/emplace_hint | Domain: Containers | Standards: C++11, C++17

Inserts a new element into the container, using hint as a suggestion where the element should go.

## Official Specification Summary (cppreference)

```cpp
template< class... Args >
iterator emplace_hint( const_iterator hint, Args&&... args ); // (since C++11)
```

Inserts a new element into the container, using `hint` as a suggestion where the element should go.

The constructor of the element type (`value_type`, that is, `std::pair<const Key, T>`) is called with exactly the same arguments as supplied to the function, forwarded with `std::forward<Args>(args)...`.

If after the operation the new number of elements is greater than old `max_load_factor() * bucket_count()` a rehashing takes place.
If rehashing occurs (due to the insertion), all iterators are invalidated. Otherwise (no rehashing), iterators are not invalidated.

### Parameters

- `hint` - iterator, used as a suggestion as to where to insert the new element
- `args` - arguments to forward to the constructor of the element

### Return value

An iterator to the inserted element.

### Exceptions

If an exception is thrown for any reason, this function has no effect (strong exception safety guarantee).

### Complexity

Amortized constant on average, worst case linear in the size of the container.

### Example

> Note: This section is incomplete Reason: no example

### See also

- [`emplace`](https://en.cppreference.com/w/cpp/container/unordered_multimap/emplace): constructs element in-place (public member function)
- [`insert`](https://en.cppreference.com/w/cpp/container/unordered_multimap/insert): inserts elements or nodes (since C++17) (public member function)

---
Attribution: content from https://en.cppreference.com/w/cpp/container/unordered_multimap/emplace_hint (cppreference.com), licensed under CC-BY-SA 3.0 and GFDL. Modified: converted to markdown, study notes added. Offline snapshot of 9 February 2025.