Insert the specified key, ignoring the insertion hint.

Synopsis

Declared in <bdlc_flathashset.h>

template<class LOOKUP_KEY>
iterator
insert(
    const_iterator hint,
    LOOKUP_KEY&& key)
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
         && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value
         && bsl::is_convertible<LOOKUP_KEY&&, const_iterator>::value == false
         && bsl::is_convertible<const_iterator, LOOKUP_KEY&&>::value == false;

Description

Insert the specified key into this set if a key equivalent to k does not already exist in this set; otherwise, this method has no effect. Return a pair containing an iterator referring to the newly inserted element and true if a element was inserted. Return a pair containing an iterator to an existing element and false if the value already existed in the set. The supplied const_iterator is ignored.

Return Value

iterator to the existing or newly inserted element

Parameters

Name

Description

hint

ignored hint iterator

key

key to insert

Created with MrDocs