34 function HashToEntry(table, hash, numBuckets) {  argument
35   var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
41 function SetFindEntry(table, numBuckets, key, hash) {  argument
42   var entry = HashToEntry(table, hash, numBuckets);
61 function MapFindEntry(table, numBuckets, key, hash) {  argument
62   var entry = HashToEntry(table, hash, numBuckets);
82   var hash = key;
83   hash = hash ^ seed;
84   hash = ~hash + (hash << 15);  // hash = (hash << 15) - hash - 1;
85   hash = hash ^ (hash >>> 12);
86   hash = hash + (hash << 2);
87   hash = hash ^ (hash >>> 4);
88   hash = (hash * 2057) | 0;  // hash = (hash + (hash << 3)) + (hash << 11);
89   hash = hash ^ (hash >>> 16);
90   return hash & 0x3fffffff;
104     var hash = GET_PRIVATE(key, hashCodeSymbol);
105     return hash;
113   var hash = GetExistingHash(key);
114   if (IS_UNDEFINED(hash)) {
115     hash = IntRandom() | 0;
116     if (hash === 0) hash = 1;
117     SET_PRIVATE(key, hashCodeSymbol, hash);
119   return hash;
160   var hash = GetHash(key);
161   if (SetFindEntry(table, numBuckets, key, hash) !== NOT_FOUND) return this;
177   var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
193   var hash = GetExistingHash(key);
194   if (IS_UNDEFINED(hash)) return false;
195   return SetFindEntry(table, numBuckets, key, hash) !== NOT_FOUND;
206   var hash = GetExistingHash(key);
207   if (IS_UNDEFINED(hash)) return false;
208   var entry = SetFindEntry(table, numBuckets, key, hash);
313   var hash = GetExistingHash(key);
314   if (IS_UNDEFINED(hash)) return UNDEFINED;
315   var entry = MapFindEntry(table, numBuckets, key, hash);
336   var hash = GetHash(key);
337   var entry = MapFindEntry(table, numBuckets, key, hash);
358   var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
376   var hash = GetHash(key);
377   return MapFindEntry(table, numBuckets, key, hash) !== NOT_FOUND;
388   var hash = GetHash(key);
389   var entry = MapFindEntry(table, numBuckets, key, hash);