263     concurrent_unordered_base( InputIterator first, InputIterator last,
268         insert(first, last);  in concurrent_unordered_base()
272     concurrent_unordered_base( InputIterator first, InputIterator last,  in concurrent_unordered_base()  argument
274         : concurrent_unordered_base(first, last, bucket_count, hasher(), key_equal(), alloc) {}  in concurrent_unordered_base()
277     concurrent_unordered_base( InputIterator first, InputIterator last,  in concurrent_unordered_base()  argument
279         : concurrent_unordered_base(first, last, bucket_count, hash, key_equal(), alloc) {}  in concurrent_unordered_base()
432     void insert( InputIterator first, InputIterator last ) {  in insert()  argument
433         for (; first != last; ++first) {  in insert()
502     iterator unsafe_erase( const_iterator first, const_iterator last ) {  in unsafe_erase()  argument
503         while(first != last) {  in unsafe_erase()
1296                 node_ptr last = first;  in internal_equal_range()  local
1298                     last = last->next();  in internal_equal_range()
1299                 } while (allow_multimapping && last != nullptr && !last->is_dummy() &&  in internal_equal_range()
1300 …           my_hash_compare(traits_type::get_key(static_cast<value_node_ptr>(last)->value()), key));  in internal_equal_range()
1301                 return std::make_pair(first, first_value_node(last));  in internal_equal_range()