absl::linked_hash_map::insert

insert overloads

Synopses

Declared in <absl/container/linked_hash_map.h>

Inserts the elements of an initializer list into the map.

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

Inserts an element into the map.

std::pair<iterator, bool>
insert(value_type const& v);

Inserts an element via a node handle.

insert_return_type
insert(node_type&& node);

Inserts an element into the map.

std::pair<iterator, bool>
insert(value_type&& v);

Inserts an element into the map, ignoring the position hint.

iterator
insert(
    const_iterator hint,
    value_type const& v);

Inserts an element via a node handle, ignoring the position hint.

iterator
insert(
    const_iterator hint,
    node_type&& node);

Inserts an element into the map, ignoring the position hint.

iterator
insert(
    const_iterator hint,
    value_type&& v);

Inserts the elements of the range [first, last)] into the map.

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

A pair of an iterator to the element and a bool that is true if insertion took place.
The result of the insertion, including the node handle if insertion did not take place.
An iterator to the inserted or existing element.

Name

Description

ilist

The initializer list of elements to insert.

The value to insert.

node

The node handle holding the element to insert.

hint

A position hint, which is ignored.

first

An iterator to the first element to insert.

last

An iterator past the last element to insert.

Created with MrDocs