** Compute the optimal size for the array part of table 't'. 'nums' is a ** "count array" where 'nums[i]' is the number of integers in the table ** between 2^(i - 1) + 1 and 2^i. 'pna' enters with the total number of ** integer keys in the table and leaves with the number of keys that ** will go to the array part; return the optimal size. */
| 353 | ** will go to the array part; return the optimal size. |
| 354 | */ |
| 355 | static unsigned int computesizes(unsigned int nums[], unsigned int *pna) { |
| 356 | int i; |
| 357 | unsigned int twotoi; /* 2^i (candidate for optimal size) */ |
| 358 | unsigned int a = 0; /* number of elements smaller than 2^i */ |
| 359 | unsigned int na = 0; /* number of elements to go to array part */ |
| 360 | unsigned int optimal = 0; /* optimal size for array part */ |
| 361 | /* loop while keys can fill more than half of total size */ |
| 362 | for (i = 0, twotoi = 1; *pna > twotoi / 2; i++, twotoi *= 2) { |
| 363 | if (nums[i] > 0) { |
| 364 | a += nums[i]; |
| 365 | if (a > twotoi / 2) { /* more than half elements present? */ |
| 366 | optimal = twotoi; /* optimal size (till now) */ |
| 367 | na = a; /* all elements up to 'optimal' will go to array part */ |
| 368 | } |
| 369 | } |
| 370 | } |
| 371 | lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal); |
| 372 | *pna = na; |
| 373 | return optimal; |
| 374 | } |
| 375 | |
| 376 | |
| 377 | static int countint(const TValue *key, unsigned int *nums) { |