bsl::unordered_map::insert

Synopses

Declared in <bslstl_unorderedmap.h>

Insert each element of values whose key is not already present.

void
insert(std::initializer_list<value_type> values);

» more...

Insert value if its key is not already present.

pair<iterator, bool>
insert(value_type const& value);

» more...

Insert value if its key is not already present.

template<class ALT_VALUE_TYPE>
pair<iterator, bool>
insert(ALT_VALUE_TYPE&& value)
requires std::is_constructible<value_type,
                                             ALT_VALUE_TYPE&&>::value;

» more...

Insert value at hint if its key is not already present.

iterator
insert(
    const_iterator hint,
    value_type const& value);

» more...

Insert each element in [first, last)] whose key is not already present.

template<class INPUT_ITERATOR>
void
insert(
    INPUT_ITERATOR first,
    INPUT_ITERATOR last);

» more...

Insert value at hint if its key is not already present.

template<class ALT_VALUE_TYPE>
iterator
insert(
    const_iterator hint,
    ALT_VALUE_TYPE&& value)
requires std::is_constructible<value_type,
                                             ALT_VALUE_TYPE&&>::value;

» more...