[#bsl-unordered_map-02b-insert_range]
= xref:bsl.adoc[bsl]::xref:bsl/unordered_map-02b.adoc[unordered&lowbar;map]::insert&lowbar;range
:relfileprefix: ../../
:mrdocs:

Insert each element of `range` whose key is not already present&period;

== Synopsis

Declared in `&lt;bslstl&lowbar;unorderedmap&period;h&gt;`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;class RANGE&gt;
void
insert&lowbar;range(RANGE&& range);
----

== Description

Insert into this map the value of each `value&lowbar;type` object in the specified `range` if a key equivalent to the object is not already contained in this set&period; The (template parameter) type `RANGE` must meet the requirements the C&plus;&plus;20 standard &lsqb;ranges&rsqb;providing access to values of a type convertible to `value&lowbar;type`, and `value&lowbar;type` must be `emplace&hyphen;constructible` from `&ast;i` into this set, where `i` is a dereferenceable iterator obtained from `range` (see &lcub;Requirements on `KEY`&rcub;)&period; The behavior is undefined if `range` overlaps this map&period;

== Parameters

[cols="1,4"]
|===
| Name| Description
| *range*
| input range of values to insert
|===


[.small]#Created with https://www.mrdocs.com[MrDocs]#
