Lines Matching refs:hash
30 function HashToEntry(table, hash, numBuckets) { argument
31 var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
37 function SetFindEntry(table, numBuckets, key, hash) { argument
38 var entry = HashToEntry(table, hash, numBuckets);
57 function MapFindEntry(table, numBuckets, key, hash) { argument
58 var entry = HashToEntry(table, hash, numBuckets);
78 var hash = key;
79 hash = hash ^ seed;
80 hash = ~hash + (hash << 15); // hash = (hash << 15) - hash - 1;
81 hash = hash ^ (hash >>> 12);
82 hash = hash + (hash << 2);
83 hash = hash ^ (hash >>> 4);
84 hash = (hash * 2057) | 0; // hash = (hash + (hash << 3)) + (hash << 11);
85 hash = hash ^ (hash >>> 16);
86 return hash & 0x3fffffff;
100 var hash = GET_PRIVATE(key, hashCodeSymbol);
101 return hash;
109 var hash = GetExistingHash(key);
110 if (IS_UNDEFINED(hash)) {
111 hash = (MathRandom() * 0x40000000) | 0;
112 if (hash === 0) hash = 1;
113 SET_PRIVATE(key, hashCodeSymbol, hash);
115 return hash;
156 var hash = GetHash(key);
157 if (SetFindEntry(table, numBuckets, key, hash) !== NOT_FOUND) return this;
173 var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
189 var hash = GetExistingHash(key);
190 if (IS_UNDEFINED(hash)) return false;
191 return SetFindEntry(table, numBuckets, key, hash) !== NOT_FOUND;
202 var hash = GetExistingHash(key);
203 if (IS_UNDEFINED(hash)) return false;
204 var entry = SetFindEntry(table, numBuckets, key, hash);
317 var hash = GetExistingHash(key);
318 if (IS_UNDEFINED(hash)) return UNDEFINED;
319 var entry = MapFindEntry(table, numBuckets, key, hash);
340 var hash = GetHash(key);
341 var entry = MapFindEntry(table, numBuckets, key, hash);
362 var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
380 var hash = GetHash(key);
381 return MapFindEntry(table, numBuckets, key, hash) !== NOT_FOUND;
392 var hash = GetHash(key);
393 var entry = MapFindEntry(table, numBuckets, key, hash);