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. All insertions are done by the calling thread and the order of insertion is not specified. The behavior is undefined unless first <= last.

Synopsis

Declared in <bdlcc_stripedunorderedmultimap.h>

template<class RANDOM_ITER>
void
insertBulk(
    RANDOM_ITER first,
    RANDOM_ITER last);

Created with MrDocs