![]() |
Home | Libraries | People | FAQ | More |
Insert elements.
void insert(std::initializer_list
<std::pair
<string_view
,value_ref
> > init);
The elements in the initializer list are inserted one at a time, in order. Any element with key that is a duplicate of a key already present in container will be skipped. This also means, that if there are two keys within the initializer list that are equal to each other, only the first will be inserted.
Insertion may result in rehashing of the container. In that case all iterators and references are invalidated. Otherwise, they are not affected.
Linear in init.size()
.
Basic guarantee. Calls to memory_resource::allocate
may throw.
Name |
Description |
---|---|
|
The initializer list to insert |