Lines Matching full:hash
1757 // Sort the instance descriptors by the hash codes of their keys.
1852 // HashTable is a subclass of FixedArray that implements a hash table
1863 // The hash table class is parameterized with a Shape and a Key.
1869 // // Returns the hash value for key.
1870 // static uint32_t Hash(Key key);
1871 // // Returns the hash value for object.
1888 // Returns the number of elements in the hash table.
1893 // Returns the number of deleted elements in the hash table.
1898 // Returns the capacity of the hash table.
1904 // hash table.
1908 // a hash table.
1967 // has the given hash value.
1968 uint32_t FindInsertionEntry(uint32_t hash);
1975 // Update the number of elements in the hash table.
1980 // Update the number of deleted elements in the hash table.
1985 // Sets the capacity of the hash table.
1987 // To scale a computed hash code to fit within the hash table, we
1997 static uint32_t GetProbe(uint32_t hash, uint32_t number, uint32_t size) {
1999 return (hash + GetProbeOffset(number)) & (size - 1);
2002 static uint32_t FirstProbe(uint32_t hash, uint32_t size) {
2003 return hash & (size - 1);
2021 // Returns the hash value for this key.
2022 virtual uint32_t Hash() = 0;
2023 // Returns the hash value for object.
2025 // Returns the key object for storing into the hash table.
2037 static uint32_t Hash(HashTableKey* key) {
2038 return key->Hash();
2085 static uint32_t Hash(HashTableKey* key) {
2086 return key->Hash();
2203 uint32_t hash);
2216 static inline uint32_t Hash(String* key);
2244 static inline uint32_t Hash(uint32_t key);
3647 static inline uint32_t Hash(HashTableKey* key) {
3648 return key->Hash();
3690 // Returns true if the hash of this string can be computed without
3694 // Add a character to the hash and update the array index calculation.
3697 // Adds a character to the hash but does not update the array index
3702 // Returns the value to store in the hash field of a string with
3792 // Get and set the hash field of the string.
3859 // Tells whether the hash code has been computed.
3862 // Returns a hash value used for the property table
3863 inline uint32_t Hash();
3913 // Mask constant for checking if a string has a computed hash code
3915 // whether a hash code has been computed. If the hash code has been
3922 // Shift constant retrieving hash code from hash field.
3925 // Array index strings this short can keep their index in the hash
3929 // For strings which are array indexes the hash value has the string length
3930 // mixed into the hash, mainly to avoid a hash value of zero which would be
3937 // Value of empty hash field indicating that the hash is not computed.
3943 // Max length for computing hash. For strings longer than this limit the
3944 // string length is used as the hash value.
4008 // Compute and set the hash code.
