projects / mirror_edk2.git / blame
| Commit | Line | Data |
|---|---|---|
| 11b7501a SB |
1 | ### Introduction\r |
| 2 | \r | |
| 3 | Brotli is a generic-purpose lossless compression algorithm that compresses data\r | |
| 4 | using a combination of a modern variant of the LZ77 algorithm, Huffman coding\r | |
| 5 | and 2nd order context modeling, with a compression ratio comparable to the best\r | |
| 6 | currently available general-purpose compression methods. It is similar in speed\r | |
| 7 | with deflate but offers more dense compression.\r | |
| 8 | \r | |
| 9 | The specification of the Brotli Compressed Data Format is defined in [RFC 7932](https://www.ietf.org/rfc/rfc7932.txt).\r | |
| 10 | \r | |
| 11 | Brotli is open-sourced under the MIT License, see the LICENSE file.\r | |
| 12 | \r | |
| 13 | Brotli mailing list:\r | |
| 14 | https://groups.google.com/forum/#!forum/brotli\r | |
| 15 | \r | |
| 16 | [](https://travis-ci.org/google/brotli)\r | |
| 17 | \r | |
| 18 | ### Benchmarks\r | |
| 19 | * [Squash Compression Benchmark](https://quixdb.github.io/squash-benchmark/) / [Unstable Squash Compression Benchmark](https://quixdb.github.io/squash-benchmark/unstable/)\r | |
| 20 | * [Large Text Compression Benchmark](http://mattmahoney.net/dc/text.html)\r | |
| 21 | * [Lzturbo Benchmark](https://sites.google.com/site/powturbo/home/benchmark)\r | |
| 22 | \r | |
| 23 | ### Related projects\r | |
| 24 | Independent [decoder](https://github.com/madler/brotli) implementation by Mark Adler, based entirely on format specification.\r | |
| 25 | \r | |
| 26 | JavaScript port of brotli [decoder](https://github.com/devongovett/brotli.js). Could be used directly via `npm install brotli`\r |