bsl::unordered_multimap::insert

Synopses

Declared in <bslstl_unorderedmultimap.h>

Insert each element from the values initializer list.

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

» more...

Insert value and return an iterator to the new element.

unordered_multimap<KEY, VALUE, HASH, EQUAL, ALLOCATOR>::iterator
insert(value_type const& value);

» more...

Insert a value_type constructed from value.

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

» more...

Insert value near hint and return an iterator to it.

unordered_multimap<KEY, VALUE, HASH, EQUAL, ALLOCATOR>::iterator
insert(
    const_iterator hint,
    value_type const& value);

» more...

Insert each element in the half-open range [first, last)].

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

» more...

Insert a value_type constructed from value near hint.

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...