29 function HashToEntry(table, hash, numBuckets) {  argument
30   var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
36 function SetFindEntry(table, numBuckets, key, hash) {  argument
37   var entry = HashToEntry(table, hash, numBuckets);
56 function MapFindEntry(table, numBuckets, key, hash) {  argument
57   var entry = HashToEntry(table, hash, numBuckets);
77   var hash = key;
78   hash = hash ^ seed;
79   hash = ~hash + (hash << 15);  // hash = (hash << 15) - hash - 1;
80   hash = hash ^ (hash >>> 12);
81   hash = hash + (hash << 2);
82   hash = hash ^ (hash >>> 4);
83   hash = (hash * 2057) | 0;  // hash = (hash + (hash << 3)) + (hash << 11);
84   hash = hash ^ (hash >>> 16);
85   return hash & 0x3fffffff;
99     var hash = GET_PRIVATE(key, hashCodeSymbol);
100     return hash;
108   var hash = GetExistingHash(key);
109   if (IS_UNDEFINED(hash)) {
110     hash = (MathRandom() * 0x40000000) | 0;
111     if (hash === 0) hash = 1;
112     SET_PRIVATE(key, hashCodeSymbol, hash);
114   return hash;
155   var hash = GetHash(key);
156   if (SetFindEntry(table, numBuckets, key, hash) !== NOT_FOUND) return this;
172   var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
188   var hash = GetExistingHash(key);
189   if (IS_UNDEFINED(hash)) return false;
190   return SetFindEntry(table, numBuckets, key, hash) !== NOT_FOUND;
201   var hash = GetExistingHash(key);
202   if (IS_UNDEFINED(hash)) return false;
203   var entry = SetFindEntry(table, numBuckets, key, hash);
308   var hash = GetExistingHash(key);
309   if (IS_UNDEFINED(hash)) return UNDEFINED;
310   var entry = MapFindEntry(table, numBuckets, key, hash);
331   var hash = GetHash(key);
332   var entry = MapFindEntry(table, numBuckets, key, hash);
353   var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
371   var hash = GetHash(key);
372   return MapFindEntry(table, numBuckets, key, hash) !== NOT_FOUND;
383   var hash = GetHash(key);
384   var entry = MapFindEntry(table, numBuckets, key, hash);