/src/common/dist/zlib/examples/ |
enough.c | 281 // we can use at most this many bit patterns, lest there not be enough 283 // no limit to the code length, this would become: most = left - 1) 284 int most = (((code_t)left << (g.max - len)) - syms) / local in function:count 289 for (int use = least; use <= most; use++) { 418 // we can use at most this many bit patterns, lest there not be enough 420 // no limit to the code length, this would become: most = left - 1) 421 int most = (((code_t)left << (g.max - len)) - syms) / local in function:examine 434 for (use = least; use <= most; use++) { 532 // make sure that the calculation of most will not overflow
|
enough.c | 281 // we can use at most this many bit patterns, lest there not be enough 283 // no limit to the code length, this would become: most = left - 1) 284 int most = (((code_t)left << (g.max - len)) - syms) / local in function:count 289 for (int use = least; use <= most; use++) { 418 // we can use at most this many bit patterns, lest there not be enough 420 // no limit to the code length, this would become: most = left - 1) 421 int most = (((code_t)left << (g.max - len)) - syms) / local in function:examine 434 for (use = least; use <= most; use++) { 532 // make sure that the calculation of most will not overflow
|
enough.c | 281 // we can use at most this many bit patterns, lest there not be enough 283 // no limit to the code length, this would become: most = left - 1) 284 int most = (((code_t)left << (g.max - len)) - syms) / local in function:count 289 for (int use = least; use <= most; use++) { 418 // we can use at most this many bit patterns, lest there not be enough 420 // no limit to the code length, this would become: most = left - 1) 421 int most = (((code_t)left << (g.max - len)) - syms) / local in function:examine 434 for (use = least; use <= most; use++) { 532 // make sure that the calculation of most will not overflow
|