bsl::unordered_multiset::insert

insert overloads

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);

Insert each element from the values initializer list.

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

Insert a copy of value into this unordered multiset.

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

Move‐insert value near hint.

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

Insert a copy of value near hint.

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

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

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

iterator to the newly inserted element

Name

Description

value

element to move‐insert

values

initializer list of keys to insert

hint

iterator hint for the insertion position

first

beginning of the range of values to insert

last

end of the range of values to insert (one past last)

Created with MrDocs