commit | 10522411f132d3d7866e0d5695cdae1bef7fbcc2 | [log] [tgz] |
---|---|---|
author | szabadka <szabadka@users.noreply.github.com> | Mon Oct 26 17:26:00 2015 +0100 |
committer | szabadka <szabadka@users.noreply.github.com> | Mon Oct 26 17:26:00 2015 +0100 |
tree | 28b99b05839509b08714aed539d5a8a8a6e158e7 | |
parent | 0be6b0af540fd03aac71421a1e1043aa39a59dc8 [diff] | |
parent | a89b57b90cb95ffa68f8593353f55ce04edb8850 [diff] |
Merge pull request #239 from szabadka/master Use uint32_t positions in the hasher and compute distances modulo 2^32.
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 the following internet draft: http://www.ietf.org/id/draft-alakuijala-brotli
Brotli is open-sourced under the Apache License, Version 2.0, see the LICENSE file.
Brotli mailing list: https://groups.google.com/forum/#!forum/brotli