Home
last modified time | relevance | path

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

/llvm-project-15.0.7/libcxx/include/
H A D__hash_table88 size_t __hash() const _NOEXCEPT {
1781 size_t __hash, value_type& __value)
1964 __cp->__hash_ = __np->__hash();
1992 size_t __hash = hash_function()(__k);
2004 (__nd->__hash() == __hash || __constrain_hash(__nd->__hash(), __bc) == __chash);
2161 __src_ptr->__hash_ = __hash;
2315 (__nd->__hash() == __hash
2319 if ((__nd->__hash() == __hash)
2342 (__hash == __nd->__hash()
2346 if ((__nd->__hash() == __hash)
[all …]
H A Dtypeinfo206 static size_t __hash(__type_name_t __v) _NOEXCEPT {
221 static size_t __hash(__type_name_t __ptr) _NOEXCEPT {
222 size_t __hash = 5381;
224 __hash = (__hash * 33) ^ __c;
225 return __hash;
251 static size_t __hash(__type_name_t __v) _NOEXCEPT {
254 return __non_unique_impl::__hash(__type_name_to_string(__v));
331 return __impl::__hash(__type_name);
H A DCMakeLists.txt714 ext/__hash
/llvm-project-15.0.7/libcxx/include/__functional/
H A Dboyer_moore_searcher.h57 …explicit _BMSkipTable(size_t __sz, value_type __default_value, _Hash __hash, _BinaryPredicate __pr… in _BMSkipTable() argument
59 __table_(__sz, __hash, __pred) {} in _BMSkipTable()
118 _Hash __hash = _Hash(),
124 __skip_table_(std::make_shared<__skip_table_type>(__pattern_length_, -1, __hash, __pred_)), in __first_()
245 _Hash __hash = _Hash(),
251 …able_(std::make_shared<__skip_table_type>(__pattern_length_, __pattern_length_, __hash, __pred_)) { in __first_()
/llvm-project-15.0.7/libcxx/include/ext/
H A Dhash_set199 #include <ext/__hash>
H A Dhash_map208 #include <ext/__hash>
/llvm-project-15.0.7/llvm/utils/gn/secondary/libcxx/include/
H A DBUILD.gn774 "ext/__hash",