mirror of https://github.com/acidanthera/audk.git
2c8d2545f5
In V2, change logic to avoid use mtf[-1] style to get value. Roll back to previous logic, and use point + offset to get byte value. Cc: Bell Song <binx.song@intel.com> Contributed-under: TianoCore Contribution Agreement 1.0 Signed-off-by: Liming Gao <liming.gao@intel.com> Reviewed-by: Bell Song <binx.song@intel.com> |
||
|---|---|---|
| .. | ||
| common | ||
| dec | ||
| docs | ||
| BrotliCustomDecompressLib.inf | ||
| BrotliDecompress.c | ||
| BrotliDecompressLib.uni | ||
| BrotliDecompressLibInternal.h | ||
| GuidedSectionExtraction.c | ||
| LICENSE | ||
| README.md | ||
| ReadMe.txt | ||
README.md
Introduction
Brotli is a generic-purpose lossless compression algorithm that compresses data using a combination of a modern variant of the LZ77 algorithm, Huffman coding and 2nd order context modeling, with a compression ratio comparable to the best currently available general-purpose compression methods. It is similar in speed with deflate but offers more dense compression.
The specification of the Brotli Compressed Data Format is defined in RFC 7932.
Brotli is open-sourced under the MIT License, see the LICENSE file.
Brotli mailing list: https://groups.google.com/forum/#!forum/brotli
Benchmarks
- Squash Compression Benchmark / Unstable Squash Compression Benchmark
- Large Text Compression Benchmark
- Lzturbo Benchmark
Related projects
Independent decoder implementation by Mark Adler, based entirely on format specification.
JavaScript port of brotli decoder. Could be used directly via npm install brotli