Displaying 1 result from an estimated 1 matches for "mintblsize".
Did you mean:
min_bsize
2017 Oct 18
1
uniform sampling without replacement algorithm
...Also
lookups up x[n-i], which is taken to be n-i if not present, and
replaces/creates the entry for x[j] as having value x[n-i]. The
hash table is non-chaining, with linear search. */
/* Decide on the size of the hash table. */
unsigned tblsize, mintblsize;
mintblsize = 1.5 * k;
tblsize = 32;
while (tblsize < 0x80000000U && tblsize < mintblsize)
tblsize <<= 1;
unsigned tblmask = tblsize - 1;
/* Allocate hash table, as auto variable if small, else with R_alloc. */
struct...