Lines Matching refs:hash
36 // The hash() functions on StringHash and CaseFoldingHash do not support
42 // closer to having all the nearly-identical hash functions in one place.
45 static unsigned hash(StringImpl* key) { return key->hash(); }
51 static unsigned hash(const RefPtr<StringImpl>& key) { return key->hash(); }
57 static unsigned hash(const String& key) { return key.impl()->hash(); }
73 static unsigned hash(const UChar* data, unsigned length)
78 static unsigned hash(StringImpl* str)
81 return hash(str->characters8(), str->length());
82 return hash(str->characters16(), str->length());
85 static unsigned hash(const LChar* data, unsigned length)
90 static inline unsigned hash(const char* data, unsigned length)
92 return CaseFoldingHash::hash(reinterpret_cast<const LChar*>(data), length);
100 static unsigned hash(const RefPtr<StringImpl>& key)
102 return hash(key.get());
110 static unsigned hash(const String& key)
112 return hash(key.impl());
114 static unsigned hash(const AtomicString& key)
116 return hash(key.impl());
130 // This hash can be used in cases where the key is a hash of a string, but we don't
134 static unsigned hash(unsigned key) { return key; }
136 // To use a hash value as a key for a hash table, we need to eliminate the
138 // the string hash function to never generate negative one, but this works
140 static unsigned avoidDeletedValue(unsigned hash)
142 ASSERT(hash);
143 unsigned newHash = hash | (!(hash + 1) << 31);