Lines Matching defs:Hash
2117 // Sort the instance descriptors by the hash codes of their keys.
2121 // Sort the instance descriptors by the hash codes of their keys.
2226 // HashTable is a subclass of FixedArray that implements a hash table
2237 // The hash table class is parameterized with a Shape and a Key.
2243 // // Returns the hash value for key.
2244 // static uint32_t Hash(Key key);
2245 // // Returns the hash value for object.
2262 // Returns the number of elements in the hash table.
2267 // Returns the number of deleted elements in the hash table.
2272 // Returns the capacity of the hash table.
2278 // hash table.
2282 // a hash table.
2346 // has the given hash value.
2347 uint32_t FindInsertionEntry(uint32_t hash);
2354 // Update the number of elements in the hash table.
2359 // Update the number of deleted elements in the hash table.
2364 // Sets the capacity of the hash table.
2366 // To scale a computed hash code to fit within the hash table, we
2376 static uint32_t GetProbe(uint32_t hash, uint32_t number, uint32_t size) {
2378 return (hash + GetProbeOffset(number)) & (size - 1);
2381 static uint32_t FirstProbe(uint32_t hash, uint32_t size) {
2382 return hash & (size - 1);
2400 // Returns the hash value for this key.
2401 virtual uint32_t Hash() = 0;
2402 // Returns the hash value for object.
2404 // Returns the key object for storing into the hash table.
2416 static inline uint32_t Hash(HashTableKey* key) {
2417 return key->Hash();
2468 static inline uint32_t Hash(HashTableKey* key) {
2469 return key->Hash();
2604 uint32_t hash);
2617 static inline uint32_t Hash(String* key);
2650 static inline uint32_t Hash(uint32_t key);
2760 static int Hash(Map* fast);
4571 // Compute a hash code for the source code of this function.
5045 static inline uint32_t Hash(HashTableKey* key) {
5046 return key->Hash();
5145 static inline uint32_t Hash(HashTableKey* key) {
5146 return key->Hash();
5173 // Initial size of the fixed array backing the hash table.
5189 // Returns true if the hash of this string can be computed without
5193 // Add a character to the hash and update the array index calculation.
5196 // Adds a character to the hash but does not update the array index
5201 // Returns the value to store in the hash field of a string with
5213 // Calculated hash value for a string consisting of 1 to
5237 // Calculates string hash.
5301 // Get and set the hash field of the string.
5392 // Tells whether the hash code has been computed.
5395 // Returns a hash value used for the property table
5396 inline uint32_t Hash();
5450 // Mask constant for checking if a string has a computed hash code
5452 // whether a hash code has been computed. If the hash code has been
5459 // Shift constant retrieving hash code from hash field.
5462 // Array index strings this short can keep their index in the hash
5466 // For strings which are array indexes the hash value has the string length
5467 // mixed into the hash, mainly to avoid a hash value of zero which would be
5493 // Value of empty hash field indicating that the hash is not computed.
5497 // Value of hash field containing computed hash equal to zero.
5503 // Max length for computing hash. For strings longer than this limit the
5504 // string length is used as the hash value.
5603 // Compute and set the hash code.
