[#BloombergLP-bdlcc-StripedUnorderedMap-insert-08]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlcc.adoc[bdlcc]::xref:BloombergLP/bdlcc/StripedUnorderedMap.adoc[StripedUnorderedMap]::insert
:relfileprefix: ../../../
:mrdocs:

`insert` overloads

== Synopses

Declared in `<bdlcc_stripedunorderedmap.h>`

Insert into this hash map an element having the specified `key` and the specified move‐insertable `value`. If `key` already exists in this hash map, the value attribute of that element is set to `value`. Return 1 if an element is inserted, and 0 if an existing element is updated. The `value` object is left in a valid but unspecified state. If `value` is allocator‐enabled and `allocator() != value.allocator()` this operation may cost as much as a copy. Note that the return value equals the number of elements inserted.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
std::size_t
xref:BloombergLP/bdlcc/StripedUnorderedMap/insert-0e.adoc[insert](
    KEY const& key,
    xref:BloombergLP/bslmf/MovableRef.adoc[bslmf::MovableRef<VALUE>] value);
----

[.small]#xref:BloombergLP/bdlcc/StripedUnorderedMap/insert-0e.adoc[_» more..._]#

Insert into this hash map an element having the specified `key` and `value`. If `key` already exists in this hash map, the value attribute of that element is set to `value`. Return 1 if an element is inserted, and 0 if an existing element is updated. Note that the return value equals the number of elements inserted.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
std::size_t
xref:BloombergLP/bdlcc/StripedUnorderedMap/insert-0f.adoc[insert](
    KEY const& key,
    VALUE const& value);
----

[.small]#xref:BloombergLP/bdlcc/StripedUnorderedMap/insert-0f.adoc[_» more..._]#


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