457     template <typename Key, typename T, typename HashCompare, typename A
461         __TBB_requires(tbb::detail::hash_compare<HashCompare, Key> &&
465         __TBB_requires(tbb::detail::hash_compare<HashCompare, Key>)
572 template <typename Key, typename T,
573           typename HashCompare = d1::tbb_hash_compare<Key>,
574           typename Allocator = tbb_allocator<std::pair<const Key, T>>
578     __TBB_requires(tbb::detail::hash_compare<HashCompare, Key> &&  in __TBB_requires()
582     __TBB_requires(tbb::detail::hash_compare<HashCompare, Key>)  in __TBB_requires()
604     using key_type = Key;  in __TBB_requires()
610     using value_type = std::pair<const Key, T>;  in __TBB_requires()
676 …static node* allocate_node_copy_construct(bucket_allocator_type& allocator, const Key &key, const …  in __TBB_requires()
680 …static node* allocate_node_move_construct(bucket_allocator_type& allocator, const Key &key, const …  in __TBB_requires()
684     template <typename K = Key>  in __TBB_requires()
691     static node* do_not_allocate_node(bucket_allocator_type& , const Key &, const T * ){  in __TBB_requires()
773         friend class concurrent_hash_map<Key,T,HashCompare,Allocator,MutexType>;  in __TBB_requires()
775         friend class concurrent_hash_map<Key,T,HashCompare,Allocator>;  in __TBB_requires()
1052 …std::pair<iterator, iterator> equal_range( const Key& key ) { return internal_equal_range( key, en…  in __TBB_requires()
1053 …std::pair<const_iterator, const_iterator> equal_range( const Key& key ) const { return internal_eq…  in __TBB_requires()
1097     size_type count( const Key &key ) const {  in __TBB_requires()
1109     bool find( const_accessor &result, const Key &key ) const {  in __TBB_requires()
1116     bool find( accessor &result, const Key &key ) {  in __TBB_requires()
1137     bool insert( const_accessor &result, const Key &key ) {  in __TBB_requires()
1144     bool insert( accessor &result, const Key &key ) {  in __TBB_requires()
1238     bool erase( const Key &key ) {  in __TBB_requires()
1573     const_pointer internal_fast_find( const Key& key ) const {  in __TBB_requires()
1616 template <typename Key, typename T,
1617           typename HashCompare = d1::tbb_hash_compare<std::remove_const_t<Key>>,
1618           typename Alloc = tbb_allocator<std::pair<const Key, T>>,
1621 concurrent_hash_map( std::initializer_list<std::pair<Key, T>>, HashCompare = HashCompare(), Alloc =…
1622 -> concurrent_hash_map<std::remove_const_t<Key>, T, HashCompare, Alloc>;
1624 template <typename Key, typename T, typename Alloc,
1626 concurrent_hash_map( std::initializer_list<std::pair<Key, T>>, Alloc )
1627 -> concurrent_hash_map<std::remove_const_t<Key>, T, d1::tbb_hash_compare<std::remove_const_t<Key>>,…
1631 template <typename Key, typename T, typename HashCompare, typename A1, typename A2>
1632 …line bool operator==(const concurrent_hash_map<Key, T, HashCompare, A1> &a, const concurrent_hash_…
1634 …typename concurrent_hash_map<Key, T, HashCompare, A1>::const_iterator i(a.begin()), i_end(a.end());
1635     typename concurrent_hash_map<Key, T, HashCompare, A2>::const_iterator j, j_end(b.end());
1644 template <typename Key, typename T, typename HashCompare, typename A1, typename A2>
1645 …line bool operator!=(const concurrent_hash_map<Key, T, HashCompare, A1> &a, const concurrent_hash_…
1649 template <typename Key, typename T, typename HashCompare, typename A>
1650 inline void swap(concurrent_hash_map<Key, T, HashCompare, A> &a, concurrent_hash_map<Key, T, HashCo…  in swap()  argument