Lines Matching refs:hash
27 // HashTable is a subclass of FixedArray that implements a hash table
38 // The hash table class is parameterized with a Shape.
44 // // Returns the hash value for key.
46 // // Returns the hash value for object.
72 // Returns the number of elements in the hash table.
75 // Returns the number of deleted elements in the hash table.
78 // Returns the capacity of the hash table.
84 // hash table.
88 // a hash table.
101 // Minimum capacity for newly created hash tables.
105 // Update the number of elements in the hash table.
108 // Update the number of deleted elements in the hash table.
112 inline static InternalIndex FirstProbe(uint32_t hash, uint32_t size) {
113 return InternalIndex(hash & (size - 1));
146 ReadOnlyRoots roots, Key key, int32_t hash);
227 // has the given hash value.
229 ReadOnlyRoots roots, uint32_t hash);
231 InternalIndex FindInsertionEntry(IsolateT* isolate, uint32_t hash);
238 // Shrink the hash table.
242 // Rehashes this hash-table into the new table.
259 // Sets the capacity of the hash table.
294 explicit HashTableKey(uint32_t hash) : hash_(hash) {}
298 // Returns the hash value for this key.
305 void set_hash(uint32_t hash) {
307 hash_ = hash;
333 Object Lookup(Handle<Object> key, int32_t hash);
334 Object Lookup(PtrComprCageBase cage_base, Handle<Object> key, int32_t hash);
347 int32_t hash);
354 int32_t hash);
377 // using the identity hash of the key for hashing purposes.
432 inline bool Has(Isolate* isolate, Handle<Object> key, int32_t hash);