insert overloads
Synopses
Declared in <bdlc_flathashtable.h>
Same as the preceding overload, moving from the specified entry.
Insert the specified entry if its key is not already present.
bsl::pair<FlatHashTable<KEY, ENTRY, ENTRY_UTIL, HASH, EQUAL>::iterator, bool>
insert(ENTRY const& entry);Insert converted copies of the objects in the [first, last)] range.
template<class INPUT_ITERATOR>
void
insert(
INPUT_ITERATOR first,
INPUT_ITERATOR last);Return Value
pair of iterator to the entry and whether insertion occurred
Parameters
Name |
Description |
entry |
entry to move‐insert if its key is absent |
first |
beginning of the range to insert |
last |
end of the range to insert |
Created with MrDocs