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()
423         return insert(value).first;  in insert()
428         return insert(std::move(value)).first;  in insert()
432     void insert( InputIterator first, InputIterator last ) {  in insert()  argument
433         for (; first != last; ++first) {  in insert()
434             insert(*first);  in insert()
463         return insert(std::move(nh)).first;  in insert()
491         return emplace(std::forward<Args>(args)...).first;  in emplace_hint()
502     iterator unsafe_erase( const_iterator first, const_iterator last ) {  in unsafe_erase()  argument
503         while(first != last) {  in unsafe_erase()
504             first = unsafe_erase(first);  in unsafe_erase()
506         return iterator(first.get_node_ptr());  in unsafe_erase()
572         return std::make_pair(iterator(result.first), iterator(result.second));  in equal_range()
577         return std::make_pair(const_iterator(result.first), const_iterator(result.second));  in equal_range()
583         return std::make_pair(iterator(result.first), iterator(result.second));  in equal_range()
589         return std::make_pair(iterator(result.first), iterator(result.second));  in equal_range()
998             return internal_insert_return_type{ nullptr, search_result.first, false };  in internal_insert()
1002         node_ptr curr = search_result.first;  in internal_insert()
1007                 return internal_insert_return_type{ new_node, search_result.first, false };  in internal_insert()
1009             curr = search_result.first;  in internal_insert()
1170         for (auto it = eq_range.first; it != eq_range.second;) {  in internal_erase_by_key()
1295                 value_node_ptr first = static_cast<value_node_ptr>(curr);  in internal_equal_range()  local
1296                 node_ptr last = first;  in internal_equal_range()
1301                 return std::make_pair(first, first_value_node(last));  in internal_equal_range()
1313             return std::distance(eq_range.first, eq_range.second);  in internal_count()