bsl::hashtable::insert

insert_unique overloads

Synopses

Declared in <bslstp_hashtable.h>

Insert the specified __obj if no equivalent element exists.

pair<iterator, bool>
insert_unique(value_type const& __obj);

Insert each value in the specified [__f, __l)] range uniquely.

template<class _InputIterator>
void
insert_unique(
    _InputIterator __f,
    _InputIterator __l);

Insert each value in the specified forward range uniquely.

template<class _ForwardIterator>
void
insert_unique(
    _ForwardIterator __f,
    _ForwardIterator __l,
    std::forward_iterator_tag const& __tag);

Insert each value in the specified input range uniquely.

template<class _InputIterator>
void
insert_unique(
    _InputIterator __f,
    _InputIterator __l,
    std::input_iterator_tag const& __tag);

pair of an iterator to the element and whether insertion occurred

Name

Description

__obj

value to insert

__f

beginning of the input range

__l

end of the input range

__tag

forward‐iterator category tag (overload discriminator)

Created with MrDocs