[#BloombergLP-bdlcc-StripedUnorderedContainerImpl-insertAlways-0c]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlcc.adoc[bdlcc]::xref:BloombergLP/bdlcc/StripedUnorderedContainerImpl.adoc[StripedUnorderedContainerImpl]::insertAlways
:relfileprefix: ../../../
:mrdocs:

`insertAlways` overloads

== Synopses

Declared in `<bdlcc_stripedunorderedcontainerimpl.h>`

Insert into this hash map an element having the specified `key` and the specified move‐insertable `value`. 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 other elements having the same `key` may exist in this hash map.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
xref:BloombergLP/bdlcc/StripedUnorderedContainerImpl/insertAlways-07.adoc[insertAlways](
    KEY const& key,
    xref:BloombergLP/bslmf/MovableRef.adoc[bslmf::MovableRef<VALUE>] value);
----

[.small]#xref:BloombergLP/bdlcc/StripedUnorderedContainerImpl/insertAlways-07.adoc[_» more..._]#

Insert into this hash map an element having the specified `key` and `value`. Note that other elements having the same `key` may exist in this hash map.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
xref:BloombergLP/bdlcc/StripedUnorderedContainerImpl/insertAlways-0a.adoc[insertAlways](
    KEY const& key,
    VALUE const& value);
----

[.small]#xref:BloombergLP/bdlcc/StripedUnorderedContainerImpl/insertAlways-0a.adoc[_» more..._]#


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