commit | d00c147f531e757bfbd5cfab58d941caa8333ba8 | [log] [tgz] |
---|---|---|
author | Mark Adler <madler@alumni.caltech.edu> | Sat Aug 04 14:27:02 2018 -0700 |
committer | Mark Adler <madler@alumni.caltech.edu> | Sun Aug 05 23:08:25 2018 -0700 |
tree | 513995a58c5a5c92986c337d06f5ce91f73a8448 | |
parent | 5b1381006b715a93f226117f82b7b6dd81bfff5e [diff] |
Clarify that prefix codes are counted in enough.c. There is no assurance that all prefix codes are reachable as optimal Huffman codes for the numbers of symbols encountered in a deflate block. This code considers all possible prefix codes, which might be a larger set than all possible Huffman codes, depending on the constraints.