Lines Matching defs:hash
65 * To speed up mapping table lookup, a combination of hash and
71 * Entries are sorted by its hash index and code point.
74 short hidx; /* hash index */
102 ucsmap_hash_t hash[UCSMAP_HASH_SIZE];
237 /* Initialize hash. */
239 ctx->hash[i].entry = NULL;
240 ctx->hash[i].n = 0;
246 /* Sort entries by the hash value and code point. */
250 * Now the entries are sorted by their hash value, and
251 * sorted by its code point among the ones with the same hash value.
254 /* Build hash table. */
258 ctx->hash[e->hidx].entry = e;
261 ctx->hash[last_hidx].n++;
268 int hash;
283 /* First, look up hash table. */
284 hash = ucsmap_hash(v);
285 if ((n = ctx->hash[hash].n) == 0)
289 e = ctx->hash[hash].entry;