boost::gil::histogram::insert

insert overloads

Synopses

Attempts to insert a list of elements into the %unordered_map.

void
insert(initializer_list<value_type> __l);

Attempts to insert a std::pair into the %unordered_map.

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

Re‐insert an extracted node.

insert_return_type
insert(node_type&& __nh);

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

template<typename _Pair>
pair<iterator, bool>
insert(_Pair&& __x)
requires is_constructible<value_type, _Pair&&>::value;

Re‐insert an extracted node.

iterator
insert(
    const_iterator,
    node_type&& __nh);

Attempts to insert a std::pair into the %unordered_map.

iterator
insert(
    const_iterator __hint,
    value_type const& __x);

iterator
insert(
    const_iterator __hint,
    value_type&& __x);

A template function that attempts to insert a range of elements.

template<typename _InputIterator>
void
insert(
    _InputIterator __first,
    _InputIterator __last);

template<typename _Pair>
iterator
insert(
    const_iterator __hint,
    _Pair&& __x)
requires is_constructible<value_type, _Pair&&>::value;

A pair, of which the first element is an iterator that points to the possibly inserted pair, and the second is a bool that is true if the pair was actually inserted.
An iterator that points to the element with key of __x (may or may not be the %pair passed in).

Name

Description

__l

A std::initializer_list<value_type> of elements to be inserted.

__x

Pair to be inserted (see std::make_pair for easy creation of pairs).

__hint

An iterator that serves as a hint as to where the pair should be inserted.

__first

Iterator pointing to the start of the range to be inserted.

__last

Iterator pointing to the end of the range.

Created with MrDocs