Lines Matching refs:key_equal
31 typedef Pred key_equal;
51 is_nothrow_default_constructible<key_equal>::value &&
54 const key_equal& eql = key_equal(),
59 const key_equal& eql = key_equal(),
67 is_nothrow_move_constructible<key_equal>::value &&
71 const hasher& hf = hasher(), const key_equal& eql = key_equal(),
90 is_nothrow_move_assignable<key_equal>::value);
141 noexcept(swap(declval<key_equal&>(), declval<key_equal&>()))); // C++17
144 key_equal key_eq() const;
246 typedef Pred key_equal;
265 is_nothrow_default_constructible<key_equal>::value &&
268 const key_equal& eql = key_equal(),
273 const key_equal& eql = key_equal(),
281 is_nothrow_move_constructible<key_equal>::value &&
285 const hasher& hf = hasher(), const key_equal& eql = key_equal(),
304 is_nothrow_move_assignable<key_equal>::value);
355 noexcept(swap(declval<key_equal&>(), declval<key_equal&>()))); // C++17
358 key_equal key_eq() const;
513 typedef __type_identity_t<_Pred> key_equal;
521 typedef __hash_table<value_type, hasher, key_equal, allocator_type> __table;
553 const key_equal& __eql = key_equal());
557 : unordered_set(__n, hasher(), key_equal(), __a) {}
560 : unordered_set(__n, __hf, key_equal(), __a) {}
562 unordered_set(size_type __n, const hasher& __hf, const key_equal& __eql,
569 const key_equal& __eql = key_equal());
572 size_type __n, const hasher& __hf, const key_equal& __eql,
579 : unordered_set(__first, __last, __n, hasher(), key_equal(), __a) {}
583 : unordered_set(__first, __last, __n, __hf, key_equal(), __a) {}
597 const key_equal& __eql = key_equal());
599 const hasher& __hf, const key_equal& __eql,
605 : unordered_set(__il, __n, hasher(), key_equal(), __a) {}
609 : unordered_set(__il, __n, __hf, key_equal(), __a) {}
782 key_equal key_eq() const {return __table_.key_eq();}
789 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
792 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
800 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
809 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
821 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
825 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
941 const hasher& __hf, const key_equal& __eql)
950 const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
970 const hasher& __hf, const key_equal& __eql)
982 const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
1059 const key_equal& __eql)
1070 const key_equal& __eql, const allocator_type& __a)
1169 typedef __type_identity_t<_Pred> key_equal;
1177 typedef __hash_table<value_type, hasher, key_equal, allocator_type> __table;
1208 const key_equal& __eql = key_equal());
1210 const key_equal& __eql, const allocator_type& __a);
1214 : unordered_multiset(__n, hasher(), key_equal(), __a) {}
1217 : unordered_multiset(__n, __hf, key_equal(), __a) {}
1224 const key_equal& __eql = key_equal());
1228 const key_equal& __eql, const allocator_type& __a);
1234 : unordered_multiset(__first, __last, __n, hasher(), key_equal(), __a) {}
1239 : unordered_multiset(__first, __last, __n, __hf, key_equal(), __a) {}
1253 const key_equal& __eql = key_equal());
1255 const hasher& __hf, const key_equal& __eql,
1260 : unordered_multiset(__il, __n, hasher(), key_equal(), __a) {}
1263 : unordered_multiset(__il, __n, __hf, key_equal(), __a) {}
1420 key_equal key_eq() const {return __table_.key_eq();}
1427 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
1430 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
1438 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
1447 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
1459 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
1463 …2, enable_if_t<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value>* =…
1577 size_type __n, const hasher& __hf, const key_equal& __eql)
1586 size_type __n, const hasher& __hf, const key_equal& __eql,
1607 const hasher& __hf, const key_equal& __eql)
1619 const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
1696 const key_equal& __eql)
1707 const key_equal& __eql, const allocator_type& __a)