Home
last modified time | relevance | path

Searched refs:__hash (Results 1 – 10 of 10) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A D__hash_table95 …_LIBCPP_HIDE_FROM_ABI size_t __hash() const _NOEXCEPT { return static_cast<__node_type const&>(*th…
118 …M_ABI explicit __hash_node(__next_pointer __next, size_t __hash) : _Base(__next), __hash_(__hash) …
419 … if (__node_ != nullptr && std::__constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_)
502 … if (__node_ != nullptr && std::__constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_)
910 …_LIBCPP_HIDE_FROM_ABI __node_holder __construct_node_hash(size_t __hash, _First&& __f, _Rest&&... …
986 …__bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] = __p1_.fir…
1005 …__bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] = __p1_.fir…
1081 …__bucket_list_[std::__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] = __p1_.fir…
1231 // __hash. This does a lookup into the container to see if __value is already
1239 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_unique_prepare(size_t __hash, value_type& _…
[all …]
H A Dtypeinfo194 _LIBCPP_HIDE_FROM_ABI _LIBCPP_ALWAYS_INLINE static size_t __hash(__type_name_t __v) _NOEXCEPT {
206 … _LIBCPP_HIDE_FROM_ABI _LIBCPP_ALWAYS_INLINE static size_t __hash(__type_name_t __ptr) _NOEXCEPT {
207 size_t __hash = 5381;
209 __hash = (__hash * 33) ^ __c;
210 return __hash;
230 _LIBCPP_HIDE_FROM_ABI _LIBCPP_ALWAYS_INLINE static size_t __hash(__type_name_t __v) _NOEXCEPT {
233 return __non_unique_impl::__hash(__type_name_to_string(__v));
307 _LIBCPP_HIDE_FROM_ABI size_t hash_code() const _NOEXCEPT { return __impl::__hash(__type_name); }
/freebsd/contrib/llvm-project/libcxx/include/
H A D__hash_table106 …_LIBCPP_HIDE_FROM_ABI size_t __hash() const _NOEXCEPT { return static_cast<__node_type const&>(*th…
155 …M_ABI explicit __hash_node(__next_pointer __next, size_t __hash) : _Base(__next), __hash_(__hash) …
456 … if (__node_ != nullptr && std::__constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_)
539 … if (__node_ != nullptr && std::__constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_)
1021 …_LIBCPP_HIDE_FROM_ABI __node_holder __construct_node_hash(size_t __hash, _First&& __f, _Rest&&... …
1137 …__bucket_list_[std::__constrain_hash(__first_node_.__next_->__hash(), bucket_count())] = __first_n…
1158 …__bucket_list_[std::__constrain_hash(__first_node_.__next_->__hash(), bucket_count())] = __first_n…
1238 …__bucket_list_[std::__constrain_hash(__first_node_.__next_->__hash(), bucket_count())] = __first_n…
1388 // __hash. This does a lookup into the container to see if __value is already
1396 __hash_table<_Tp, _Hash, _Equal, _Alloc>::__node_insert_unique_prepare(size_t __hash, value_type& _…
[all …]
H A Dtypeinfo203 _LIBCPP_HIDE_FROM_ABI _LIBCPP_ALWAYS_INLINE static size_t __hash(__type_name_t __v) _NOEXCEPT {
215 … _LIBCPP_HIDE_FROM_ABI _LIBCPP_ALWAYS_INLINE static size_t __hash(__type_name_t __ptr) _NOEXCEPT {
216 size_t __hash = 5381;
218 __hash = (__hash * 33) ^ __c;
219 return __hash;
239 _LIBCPP_HIDE_FROM_ABI _LIBCPP_ALWAYS_INLINE static size_t __hash(__type_name_t __v) _NOEXCEPT {
242 return __non_unique_impl::__hash(__type_name_to_string(__v));
316 _LIBCPP_HIDE_FROM_ABI size_t hash_code() const _NOEXCEPT { return __impl::__hash(__type_name); }
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h50 size_t __sz, value_type __default_value, _Hash __hash, _BinaryPredicate __pred) in _BMSkipTable() argument
51 : __default_value_(__default_value), __table_(__sz, __hash, __pred) {} in _BMSkipTable()
105 _Hash __hash = _Hash(),
111 __skip_table_(std::make_shared<__skip_table_type>(__pattern_length_, -1, __hash, __pred_)), in __first_()
236 _Hash __hash = _Hash(),
242 …able_(std::make_shared<__skip_table_type>(__pattern_length_, __pattern_length_, __hash, __pred_)) { in __first_()
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/ext/
H A Dhash_set198 #include <__cxx03/ext/__hash>
H A Dhash_map207 #include <__cxx03/ext/__hash>
/freebsd/contrib/llvm-project/libcxx/include/ext/
H A Dhash_set201 # include <ext/__hash>
H A Dhash_map210 # include <ext/__hash>
/freebsd/lib/libc++/
H A DMakefile1445 C3EXT_HEADERS+= __hash
2302 EXT_HEADERS+= __hash