Lines Matching full:hash
17 * Uses a simple hash table for compaction.
25 * Hash table for up to 1k 64-bit words, for 1 bit per BMP code point.
47 int32_t hash=(int32_t)(key>>55)&0x1ff;
48 hash^=(int32_t)(key>>44)&0x7ff;
49 hash^=(int32_t)(key>>33)&0x7ff;
50 hash^=(int32_t)(key>>22)&0x7ff;
51 hash^=(int32_t)(key>>11)&0x7ff;
52 hash^=(int32_t)key&0x7ff;
54 if(values[hash]==0xffff) {
56 keys[hash]=key;
57 reverse[count]=hash;
58 return values[hash]=count++;
59 } else if(keys[hash]==key) {
61 return values[hash];
64 hash=(hash+prime)&0x7ff;
72 * Invert the hash map: Fill an array of length countKeys() with the keys
