insert overloads

Synopses

Declared in <bslstl_unorderedmultiset.h>

Insert the specified value into this unordered multiset. If one or more keys equivalent to value already exist in this unordered multiset, this method is guaranteed to insert value in a position contiguous to one of those equivalent keys. Return an iterator referring to the newly inserted value_type object that is equivalent to value. This method requires that the (template parameter) type KEY be move‐insertable into this unordered multiset (see {Requirements on KEY}).

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

» more...

Insert into this unordered multiset the value of each value_type object in the specified values initializer list. This method requires that the (template parameter) type KEY be copy‐insertable into this unordered multiset (see {Requirements on KEY}).

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

» more...

Insert the specified value into this unordered multiset. If one or more keys equivalent to value already exist in this unordered multiset, this method is guaranteed to insert value in a position contiguous to one of those equivalent keys. Return an iterator referring to the newly inserted value_type object that is equivalent to value. Note that this method requires that the (template parameter) type KEY be copy‐insertable into this unordered multiset (see {Requirements on KEY}).

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

» more...

Insert the specified value into this unordered multiset (in constant time if the specified hint refers to an element in this container equivalent to value). If one or more keys equivalent to value already exist in this unordered multiset, this method is guaranteed to insert value in a position contiguous to one of those equivalent keys. Return an iterator referring to the newly inserted value_type object that is equivalent to value. If hint does not refer to an element in this container equivalent to value, this operation has worst case O[N] and average case constant‐time complexity, where N is the size of this unordered multiset. This method requires that the (template parameter) type KEY be move‐insertable into this unordered multiset (see {Requirements on KEY}). The behavior is undefined unless hint is an iterator in the range [begin() .. end()] (both endpoints included).

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

» more...

Insert the specified value into this unordered multiset (in constant time if the specified hint refers to an element in this container equivalent to value). If one or more keys equivalent to value already exist in this unordered multiset, this method is guaranteed to insert value in a position contiguous to one of those equivalent keys. Return an iterator referring to the newly inserted value_type object that is equivalent to value. If hint does not refer to an element in this container equivalent to value, this operation has worst case O[N] and average case constant‐time complexity, where N is the size of this unordered multiset. This method requires that the (template parameter) type KEY be copy‐insertable into this unordered multiset (see {Requirements on KEY}). The behavior is undefined unless hint is an iterator in the range [begin() .. end()] (both endpoints included).

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

» more...

Insert into this unordered multiset the value of each value_type object in the range starting at the specified first iterator and ending immediately before the specified last iterator. The (template parameter) type INPUT_ITERATOR shall meet the requirements of an input iterator defined in the C++11 standard [24.2.3]providing access to values of a type convertible to value_type, and value_type must be emplace‐constructible from *i into this unordered multiset, where i is a dereferenceable iterator in the range [first .. last)] (see {Requirements on KEY}). The behavior is undefined unless first and last refer to a sequence of valid values where first is at a position at or before last.

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

» more...

Created with MrDocs