bsl::unordered_multiset::insert

Synopses

Declared in <bslstl_unorderedmultiset.h>

Move-insert value into this unordered multiset.

unordered_multiset<KEY, HASH, EQUAL, ALLOCATOR>::iterator
insert(BloombergLP::bslmf::MovableRef<value_type> value);

» more...

Insert each element from the values initializer list.

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

» more...

Insert a copy of value into this unordered multiset.

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

» more...

Move-insert value near hint.

unordered_multiset<KEY, HASH, EQUAL, ALLOCATOR>::iterator
insert(
    const_iterator hint,
    BloombergLP::bslmf::MovableRef<value_type> value);

» more...

Insert a copy of value near hint.

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

» more...

Insert each element in the iterator range [first, last)].

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

» more...