3-4) Inserts value, using hint as a non-binding suggestion to where the search should start.

5) Inserts elements from range [first, last).

6) Inserts elements from initializer list ilist.

If rehashing occurs due to the insertion, all iterators are invalidated. Otherwise iterators are not affected. References are not invalidated. Rehashing occurs only if the new number of elements is equal to or greater than max_load_factor()*bucket_count().