Lines Matching refs:hasher
32 typedef Hash hasher;
52 is_nothrow_default_constructible<hasher>::value &&
55 explicit unordered_set(size_type n, const hasher& hf = hasher(),
60 size_type n = 0, const hasher& hf = hasher(),
65 const hasher& hf = hasher(), const key_equal& eql = key_equal(),
72 is_nothrow_move_constructible<hasher>::value &&
77 const hasher& hf = hasher(), const key_equal& eql = key_equal(),
80 unordered_set(size_type n, const hasher& hf, const allocator_type& a); // C++14
85 const hasher& hf, const allocator_type& a); // C++14
88 : unordered_set(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
90 unordered_set(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
94 const hasher& hf, const allocator_type& a); // C++14
101 is_nothrow_move_assignable<hasher>::value &&
154 noexcept(swap(declval<hasher&>(), declval<hasher&>())) &&
157 hasher hash_function() const;
281 typedef Hash hasher;
300 is_nothrow_default_constructible<hasher>::value &&
303 explicit unordered_multiset(size_type n, const hasher& hf = hasher(),
308 size_type n = 0, const hasher& hf = hasher(),
313 const hasher& hf = hasher(), const key_equal& eql = key_equal(),
320 is_nothrow_move_constructible<hasher>::value &&
325 const hasher& hf = hasher(), const key_equal& eql = key_equal(),
328 unordered_multiset(size_type n, const hasher& hf, const allocator_type& a); // C++14
333 const hasher& hf, const allocator_type& a); // C++14
336 … : unordered_multiset(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
338 … unordered_multiset(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
342 const hasher& hf, const allocator_type& a); // C++14
349 is_nothrow_move_assignable<hasher>::value &&
402 noexcept(swap(declval<hasher&>(), declval<hasher&>())) &&
405 hasher hash_function() const;
586 typedef __type_identity_t<_Hash> hasher;
596 typedef __hash_table<value_type, hasher, key_equal, allocator_type> __table;
623 unordered_set(size_type __n, const hasher& __hf = hasher(), const key_equal& __eql = key_equal());
626 : unordered_set(__n, hasher(), key_equal(), __a) {}
627 …inline _LIBCPP_HIDE_FROM_ABI unordered_set(size_type __n, const hasher& __hf, const allocator_type…
631 …unordered_set(size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a…
639 const hasher& __hf = hasher(),
646 const hasher& __hf,
656 const hasher& __hf = hasher(),
671 : unordered_set(__first, __last, __n, hasher(), key_equal(), __a) {}
674 …_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf, const allocator_…
681 : unordered_set(from_range, std::forward<_Range>(__range), __n, hasher(), key_equal(), __a) {}
685 …unordered_set(from_range_t, _Range&& __range, size_type __n, const hasher& __hf, const allocator_t…
699 const hasher& __hf = hasher(),
704 const hasher& __hf,
710 : unordered_set(__il, __n, hasher(), key_equal(), __a) {}
712 …unordered_set(initializer_list<value_type> __il, size_type __n, const hasher& __hf, const allocato…
832 _LIBCPP_HIDE_FROM_ABI hasher hash_function() const { return __table_.hash_function(); }
838 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
842 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
850 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
859 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
872 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
876 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
1013 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n, const hasher& __hf, const…
1020 size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
1034 …_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf, const key_equal&…
1046 const hasher& __hf,
1094 initializer_list<value_type> __il, size_type __n, const hasher& __hf, const key_equal& __eql)
1104 const hasher& __hf,
1181 typedef __type_identity_t<_Hash> hasher;
1190 typedef __hash_table<value_type, hasher, key_equal, allocator_type> __table;
1216 …unordered_multiset(size_type __n, const hasher& __hf = hasher(), const key_equal& __eql = key_equa…
1218 …unordered_multiset(size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type…
1221 : unordered_multiset(__n, hasher(), key_equal(), __a) {}
1222 …inline _LIBCPP_HIDE_FROM_ABI unordered_multiset(size_type __n, const hasher& __hf, const allocator…
1232 const hasher& __hf = hasher(),
1239 const hasher& __hf,
1249 const hasher& __hf = hasher(),
1264 : unordered_multiset(__first, __last, __n, hasher(), key_equal(), __a) {}
1267 …_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf, const allocator_…
1274 …: unordered_multiset(from_range, std::forward<_Range>(__range), __n, hasher(), key_equal(), __a) {}
1278 …unordered_multiset(from_range_t, _Range&& __range, size_type __n, const hasher& __hf, const alloca…
1293 const hasher& __hf = hasher(),
1298 const hasher& __hf,
1304 : unordered_multiset(__il, __n, hasher(), key_equal(), __a) {}
1306 …unordered_multiset(initializer_list<value_type> __il, size_type __n, const hasher& __hf, const all…
1429 _LIBCPP_HIDE_FROM_ABI hasher hash_function() const { return __table_.hash_function(); }
1435 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
1439 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
1447 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
1456 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
1469 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
1473 …template <class _K2, enable_if_t<__is_transparent_v<hasher, _K2> && __is_transparent_v<key_equal, …
1615 size_type __n, const hasher& __hf, const key_equal& __eql)
1622 size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
1636 …_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf, const key_equal&…
1648 const hasher& __hf,
1700 initializer_list<value_type> __il, size_type __n, const hasher& __hf, const key_equal& __eql)
1710 const hasher& __hf,