Insert into this hash map elements having the key‐value pairs obtained between the specified first (inclusive) and last (exclusive) random‐access iterators. The iterators provide read access to a sequence of bsl::pair<KEY, VALUE> objects. If an element having one of the keys already exists in this hash map, set the value attribute to the corresponding value from data. All insertions are done by the calling thread and the order of insertion is not specified. Return the number of elements inserted. The behavior is undefined unless first <= last.

Synopsis

Declared in <bdlcc_stripedunorderedmap.h>

template<class RANDOM_ITER>
std::size_t
insertBulk(
    RANDOM_ITER first,
    RANDOM_ITER last);

Created with MrDocs