insert overloads

Synopses

Declared in <bdlc_flathashmap.h>

Insert each element from the specified values list.

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

» more...

Insert value if its key is not already present.

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

» more...

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

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

» more...

Insert value if its key is not already present.

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

» more...

Return Value

  • pair of iterator to the element and whether insertion occurred

  • iterator to the (possibly newly inserted) element

Parameters

Name

Description

values

initializer list of key/value pairs to insert

value

value to insert

first

beginning of the input range

last

end of the input range (exclusive)

hint

iterator hint (ignored)

Created with MrDocs