cpp/container/unordered map/insert

Inserts element(s) into the container, if the container doesn't already contain an element with an equivalent key.

@1-2@ Inserts. The overload is equivalent to  and only participates in overload resolution if.

@3-4@ Inserts, using as a non-binding suggestion to where the search should start. The overload is equivalent to  and only participates in overload resolution if.

@5@ Inserts elements from range.

@6@ Inserts elements from initializer list.

Return value
@1-2@ Returns a pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a denoting whether the insertion took place ( if insertion happened,  if it did not).

@3-4@ Returns an iterator to the inserted element, or to the element that prevented the insertion.

@5-6@ (none)

Exceptions
@1-4@ If an exception is thrown by any operation, the insertion has no effect.

Complexity
@1-4@ Average case:, worst case

@5-6@ Average case:, where N is the number of elements to insert. Worst case:

@7-8@ Average case:, worst case