684     template <typename K = Key>  in __TBB_requires()
685 …static node* allocate_node_default_construct(bucket_allocator_type& allocator, const K &key, const…  in __TBB_requires()
696     template <typename K>  in __TBB_requires()
697     node *search_bucket( const K &key, bucket *b ) const {  in __TBB_requires()
1055     template <typename K>  in __TBB_requires()
1056     typename std::enable_if<hash_compare_is_transparent<K>::value,  in __TBB_requires()
1057                             std::pair<iterator, iterator>>::type equal_range( const K& key ) {  in __TBB_requires()
1061     template <typename K>  in __TBB_requires()
1062     typename std::enable_if<hash_compare_is_transparent<K>::value,  in __TBB_requires()
1063 …               std::pair<const_iterator, const_iterator>>::type equal_range( const K& key ) const {  in __TBB_requires()
1101     template <typename K>  in __TBB_requires()
1102     typename std::enable_if<hash_compare_is_transparent<K>::value,  in __TBB_requires()
1103                             size_type>::type count( const K& key ) const {  in __TBB_requires()
1121     template <typename K>  in __TBB_requires()
1122     typename std::enable_if<hash_compare_is_transparent<K>::value,  in __TBB_requires()
1123                             bool>::type find( const_accessor& result, const K& key ) {  in __TBB_requires()
1128     template <typename K>  in __TBB_requires()
1129     typename std::enable_if<hash_compare_is_transparent<K>::value,  in __TBB_requires()
1130                             bool>::type find( accessor& result, const K& key ) {  in __TBB_requires()
1149     template <typename K>  in __TBB_requires()
1150     typename std::enable_if<hash_compare_is_transparent<K>::value &&  in __TBB_requires()
1151                             std::is_constructible<key_type, const K&>::value,  in __TBB_requires()
1152                             bool>::type insert( const_accessor& result, const K& key ) {  in __TBB_requires()
1154 …ookup</*insert*/true>(key, nullptr, &result, /*write=*/false, &allocate_node_default_construct<K>);  in __TBB_requires()
1157     template <typename K>  in __TBB_requires()
1158     typename std::enable_if<hash_compare_is_transparent<K>::value &&  in __TBB_requires()
1159                             std::is_constructible<key_type, const K&>::value,  in __TBB_requires()
1160                             bool>::type insert( accessor& result, const K& key ) {  in __TBB_requires()
1162 …lookup</*insert*/true>(key, nullptr, &result, /*write=*/true, &allocate_node_default_construct<K>);  in __TBB_requires()
1242     template <typename K>  in __TBB_requires()
1243     typename std::enable_if<hash_compare_is_transparent<K>::value,  in __TBB_requires()
1244                             bool>::type erase( const K& key ) {  in __TBB_requires()
1261     template <typename K, typename AllocateNodeType>  in __TBB_requires()
1262 …node* allocate_node_helper( const K& key, const T* t, AllocateNodeType allocate_node, std::true_ty…  in __TBB_requires()
1266     template <typename K, typename AllocateNodeType>  in __TBB_requires()
1267     node* allocate_node_helper( const K&, const T*, AllocateNodeType, std::false_type ) {  in __TBB_requires()
1273     template <bool OpInsert, typename K, typename AllocateNodeType>  in __TBB_requires()
1274 …bool lookup( const K &key, const T *t, const_accessor *result, bool write, AllocateNodeType alloca…  in __TBB_requires()
1423     template <typename K>  in __TBB_requires()
1424     bool internal_erase( const K& key ) {  in __TBB_requires()
1467     template <typename K, typename I>  in __TBB_requires()
1468     std::pair<I, I> internal_equal_range( const K& key, I end_ ) const {  in __TBB_requires()