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(); }
65 static unsigned hash(const String& key) { return key.impl()->hash(); }
84 static unsigned hash(const UChar* data, unsigned length)
89 static unsigned hash(StringImpl& string)
92 return hash(string.characters8(), string.length());
93 return hash(string.characters16(), string.length());
95 static unsigned hash(StringImpl* string)
98 return hash(*string);
101 static unsigned hash(const LChar* data, unsigned length)
106 static inline unsigned hash(const char* data, unsigned length)
108 return CaseFoldingHash::hash(reinterpret_cast<const LChar*>(data), length);
116 static unsigned hash(const RefPtr<StringImpl>& key)
118 return hash(*key);
126 static unsigned hash(const String& key)
128 return hash(key.impl());
130 static unsigned hash(const AtomicString& key)
132 return hash(key.impl());
148 // This hash can be used in cases where the key is a hash of a string, but we don't
152 static unsigned hash(unsigned key) { return key; }
154 // To use a hash value as a key for a hash table, we need to eliminate the
156 // the string hash function to never generate negative one, but this works
158 static unsigned avoidDeletedValue(unsigned hash)
160 ASSERT(hash);
161 unsigned newHash = hash | (!(hash + 1) << 31);