Home
last modified time | relevance | path

Searched refs:_Hash (Results 1 – 15 of 15) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__cxx03/ext/
H A Dhash_set216 class _Hash = hash<_Value>,
224 typedef _Hash hasher;
313 template <class _Value, class _Hash, class _Pred, class _Alloc>
314 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(size_type __n, const hasher& __hf, const key_equal…
319 template <class _Value, class _Hash, class _Pred, class _Alloc>
320 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
326 template <class _Value, class _Hash, class _Pred, class _Alloc>
328 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(_InputIterator __first, _InputIterator __last) {
332 template <class _Value, class _Hash, class _Pred, class _Alloc>
334 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
[all …]
H A Dhash_map224 template <class _Tp, class _Hash, bool = std::is_empty<_Hash>::value && !std::__libcpp_is_final<_Ha…
225 class __hash_map_hasher : private _Hash {
227 _LIBCPP_HIDE_FROM_ABI __hash_map_hasher() : _Hash() {}
228 _LIBCPP_HIDE_FROM_ABI __hash_map_hasher(const _Hash& __h) : _Hash(__h) {}
229 _LIBCPP_HIDE_FROM_ABI const _Hash& hash_function() const { return *this; }
230 …_LIBCPP_HIDE_FROM_ABI size_t operator()(const _Tp& __x) const { return static_cast<const _Hash&>(*…
232 return static_cast<const _Hash&>(*this)(__x);
236 template <class _Tp, class _Hash>
237 class __hash_map_hasher<_Tp, _Hash, false> {
238 _Hash __hash_;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/ext/
H A Dhash_set219 class _Hash = hash<_Value>,
227 typedef _Hash hasher;
316 template <class _Value, class _Hash, class _Pred, class _Alloc>
317 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(size_type __n, const hasher& __hf, const key_equal…
322 template <class _Value, class _Hash, class _Pred, class _Alloc>
323 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
329 template <class _Value, class _Hash, class _Pred, class _Alloc>
331 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(_InputIterator __first, _InputIterator __last) {
335 template <class _Value, class _Hash, class _Pred, class _Alloc>
337 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
[all …]
H A Dhash_map227 template <class _Tp, class _Hash, bool = std::is_empty<_Hash>::value && !std::__libcpp_is_final<_Ha…
228 class __hash_map_hasher : private _Hash {
230 _LIBCPP_HIDE_FROM_ABI __hash_map_hasher() : _Hash() {}
231 _LIBCPP_HIDE_FROM_ABI __hash_map_hasher(const _Hash& __h) : _Hash(__h) {}
232 _LIBCPP_HIDE_FROM_ABI const _Hash& hash_function() const { return *this; }
233 …_LIBCPP_HIDE_FROM_ABI size_t operator()(const _Tp& __x) const { return static_cast<const _Hash&>(*…
235 return static_cast<const _Hash&>(*this)(__x);
239 template <class _Tp, class _Hash>
240 class __hash_map_hasher<_Tp, _Hash, false> {
241 _Hash __hash_;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A D__hash_table132 template <class _Tp, class _Hash, class _Equal, class _Alloc>
605 template <class _Key, class _Hash, class _Equal>
610 template <class _Key, class _Hash, class _Equal>
611 typename __enforce_unordered_container_requirements<_Key, _Hash, _Equal>::type
617 template <class _Key, class _Hash, class _Equal>
620 template <class _Tp, class _Hash, class _Equal, class _Alloc>
624 typedef _Hash hasher;
938 template <class _Tp, class _Hash, class _Equal, class _Alloc>
939 inline __hash_table<_Tp, _Hash, _Equal, _Alloc>::__hash_table()
942 template <class _Tp, class _Hash, class _Equal, class _Alloc>
[all …]
H A Dunordered_map618 class _Hash,
620 bool = is_empty<_Hash>::value && !__libcpp_is_final<_Hash>::value>
621 class __unordered_map_hasher : private _Hash {
623 _LIBCPP_HIDE_FROM_ABI __unordered_map_hasher() : _Hash() {}
624 _LIBCPP_HIDE_FROM_ABI __unordered_map_hasher(const _Hash& __h) : _Hash(__h) {}
625 _LIBCPP_HIDE_FROM_ABI const _Hash& hash_function() const _NOEXCEPT { return *this; }
627 return static_cast<const _Hash&>(*this)(__x.__get_value().first);
629 …_LIBCPP_HIDE_FROM_ABI size_t operator()(const _Key& __x) const { return static_cast<const _Hash&>(…
632 swap(static_cast<_Hash&>(*this), static_cast<_Hash&>(__y));
636 template <class _Key, class _Cp, class _Hash, class _Pred>
[all …]
H A Dunordered_set562 template <class _Value, class _Hash, class _Pred, class _Alloc>
565 template <class _Value, class _Hash = hash<_Value>, class _Pred = equal_to<_Value>, class _Alloc = …
571 typedef __type_identity_t<_Hash> hasher;
630 …static_assert(sizeof(std::__diagnose_unordered_container_requirements<_Value, _Hash, _Pred>(0)), "…
703 template <class _Value, class _Hash, class _Pred, class _Alloc>
704 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n, const hasher& __hf, const…
709 template <class _Value, class _Hash, class _Pred, class _Alloc>
710 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
716 template <class _Value, class _Hash, class _Pred, class _Alloc>
718 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(_InputIterator __first, _InputIterator _…
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dunordered_set593 template <class _Value, class _Hash, class _Pred, class _Alloc>
596 template <class _Value, class _Hash = hash<_Value>, class _Pred = equal_to<_Value>, class _Alloc = …
602 typedef __type_identity_t<_Hash> hasher;
733 …static_assert(sizeof(std::__diagnose_unordered_container_requirements<_Value, _Hash, _Pred>(0)), "…
920 class _Hash = hash<__iter_value_type<_InputIterator>>,
924 class = enable_if_t<!__is_allocator<_Hash>::value>,
925 class = enable_if_t<!is_integral<_Hash>::value>,
931 _Hash = _Hash(),
933 …_Allocator = _Allocator()) -> unordered_set<__iter_value_type<_InputIterator>, _Hash, _Pred, _Allo…
937 class _Hash = hash<ranges::range_value_t<_Range>>,
[all …]
H A D__hash_table169 template <class _Tp, class _Hash, class _Equal, class _Alloc>
657 template <class _Key, class _Hash, class _Equal>
660 static_assert(__check_hash_requirements<_Key, _Hash>::value,
667 template <class _Key, class _Hash, class _Equal>
671 _LIBCPP_DIAGNOSE_WARNING(!__is_invocable_v<_Hash const&, _Key const&>,
674 typename __enforce_unordered_container_requirements<_Key, _Hash, _Equal>::type
680 template <class _Key, class _Hash, class _Equal>
683 template <class _Tp, class _Hash, class _Equal, class _Alloc>
687 typedef _Hash hasher;
1069 template <class _Tp, class _Hash, class _Equal, class _Alloc>
[all …]
H A Dunordered_map648 class _Hash,
650 bool = is_empty<_Hash>::value && !__libcpp_is_final<_Hash>::value>
651 class __unordered_map_hasher : private _Hash {
653 …BI __unordered_map_hasher() _NOEXCEPT_(is_nothrow_default_constructible<_Hash>::value) : _Hash() {}
654 …CPP_HIDE_FROM_ABI __unordered_map_hasher(const _Hash& __h) _NOEXCEPT_(is_nothrow_copy_constructibl…
655 : _Hash(__h) {}
656 _LIBCPP_HIDE_FROM_ABI const _Hash& hash_function() const _NOEXCEPT { return *this; }
657 …_LIBCPP_HIDE_FROM_ABI size_t operator()(const _Cp& __x) const { return static_cast<const _Hash&>(*…
658 …_LIBCPP_HIDE_FROM_ABI size_t operator()(const _Key& __x) const { return static_cast<const _Hash&>(…
662 return static_cast<const _Hash&>(*this)(__x);
[all …]
H A D__node_handle88 template <class _Tp, class _Hash, class _Equal, class _Allocator>
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h35 template <class _Key, class _Value, class _Hash, class _BinaryPredicate, bool /*useArray*/>
39 template <class _Key, class _Value, class _Hash, class _BinaryPredicate>
40 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, false> {
46 unordered_map<_Key, _Value, _Hash, _BinaryPredicate> __table_;
50 size_t __sz, value_type __default_value, _Hash __hash, _BinaryPredicate __pred) in _BMSkipTable()
62 template <class _Key, class _Value, class _Hash, class _BinaryPredicate>
63 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, true> {
73 …_LIBCPP_HIDE_FROM_ABI explicit _BMSkipTable(size_t, value_type __default_value, _Hash, _BinaryPred… in _BMSkipTable() argument
87 … class _Hash = hash<typename iterator_traits<_RandomAccessIterator1>::value_type>,
96 _Hash,
[all …]
H A Dhash.h445 template <class _Key, class _Hash>
448 is_copy_constructible<_Hash>::value && is_move_constructible<_Hash>::value &&
449 __is_invocable_r_v<size_t, _Hash, _Key const&> >;
451 template <class _Key, class _Hash = hash<_Key> >
453 …egral_constant<bool, __check_hash_requirements<_Key, _Hash>::value && is_default_constructible<_Ha…
/freebsd/contrib/llvm-project/libcxx/include/experimental/
H A Dunordered_set
H A Dunordered_map