Lines Matching defs:tab
125 uint8_t *tab; // count == mask+1; free with delete[]
127 perfect_hash() : tab(0) { }
129 ~perfect_hash() { if (tab) delete[] tab; }
169 uint8_t tab[0]; /* tab[mask+1] (always power-of-2) */
173 objc_stringhash_check_t *checkbytes() { return (objc_stringhash_check_t *)&tab[mask+1]; }
174 const objc_stringhash_check_t *checkbytes() const { return (const objc_stringhash_check_t *)&tab[mask+1]; }
182 uint32_t index = (uint32_t)(val>>shift) ^ scramble[tab[val&mask]];
249 // tab and checkbytes are arrays of bytes, no swap needed
300 tab[i] = phash.tab[i];
744 keys, then it computes a^scramble[tab[b]] to get the final perfect hash.
745 tab[] is an array of 1-byte values and scramble[] is a 256-term array of
746 2-byte or 4-byte values. If there are n keys, the length of tab[] is a
760 The final hash is (a XOR scramble[tab[b]]). *scramble* is a
761 predetermined mapping of 0..255 into 0..smax-1. *tab* is an
764 First we fill in all values of *tab* that are used by more than one
774 *scramble* is used because (a^tab[i]) clusters keys around *a*.
834 ub2 newval_q; /* what to change parent tab[b] to to use this hash */
835 ub2 oldval_q; /* original value of tab[b] */
879 // ub4 *scramble; /* hash is a^scramble[tab[b]] */
968 ub4 stabb; /* scramble[tab[b]] */
1022 an "augmenting path". Change values of tab[b] along the path so that
1037 // ub4 *scramble; /* final hash is a^scramble[tab[b]] */
1157 * If smax<256 there is no scramble, so tab[b] needs to cover 0..smax-1.
1165 * value to assign to tab[b]. This only matters when we're doing a minimal
1206 // bstuff **tabb; /* output, tab[] of the perfect hash, length *blen */
1210 // ub4 *scramble; /* input, hash = a^scramble[tab[b]] */
1329 bstuff *tab; /* table indexed by b */
1344 ok = findhash(&tab, &alen, &blen, &salt,
1348 ok = findhash(&tab, &alen, &blen, &salt,
1361 result.tab = new uint8_t[blen];
1363 result.tab[i] = tab[i].val_b;
1371 delete[] tab;