ff9f3fb607
It is unnecessary, as we already have the entries sorted by probability and therefore implicitly by length. All we need on top of that to build the tree is the number of entries of a given length. Doing so gives a 3.6% speedup of ff_mjpeg_encode_huffman_close() here; it also saves about 640B of .text here. The new code puts values with higher probability to the left of the tree. The old code did not and therefore the FATE checksums needed to be updated. Due to MJPEG's 0xFF unescaping file sizes as well as file checksums needed to be updated; the decoded picture hashes stayed the same. Given that codes on the left of the tree have on average fewer bits set than codes on the right, the file sizes mostly improve (all except vsynth3-mjpeg-444). Signed-off-by: Andreas Rheinhardt <andreas.rheinhardt@outlook.com>
4 lines
140 B
Plaintext
4 lines
140 B
Plaintext
9278aa4b2eafa6b863fc6085b43abd8d *tests/data/lavf/lavf.smjpeg
|
|
728177 tests/data/lavf/lavf.smjpeg
|
|
tests/data/lavf/lavf.smjpeg CRC=0x29d58fb8
|