| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | updated block format documentation | Yann Collet | 2022-02-02 | 1 | -30/+41 |
| | | | | | | | to specifically call attention to offset==0 scenario, which is invalid, and could lead to some form of security issue if incorrectly dealt with (ignored). | ||||
| * | Update lz4_Block_format.md | Frank Wessels | 2021-10-25 | 1 | -1/+1 |
| | | | | Mini typo | ||||
| * | updated block format with more details on MF_LIMIT | Yann Collet | 2019-04-11 | 1 | -12/+23 |
| | | | | | aka distance from end of block for the last match. | ||||
| * | updated LZ4 block format | Yann Collet | 2019-01-02 | 1 | -36/+33 |
| | | | | | | rewording the end of block conditions for clarity and answering related questions. | ||||
| * | minor edit of block format | Cyan4973 | 2018-04-25 | 1 | -28/+32 |
| | | | | | clarifying parsing restrictions near end of block. | ||||
| * | lz4_Block_format.md: clarify on short inputs and restrictions | Alexey Tourbin | 2018-04-24 | 1 | -3/+12 |
| | | | | | | | | | | | | | | | | | | | | | | | It occurred to me that the formula "The last 5 bytes are always literals", on the list of "assumptions made by the decoder", is remarkably ambiguous. Suppose the decoder is presented with 5 bytes. Are they literals? It may seem that the decoder degenerates to memcpy on short inputs. But of course the answer is no, so the formula needs some clarification. Parsing restrictions should be explained as well, otherwise they look like arbitrary numbers. The 5-byte restriction has been mentioned recently in connection with the shortcut in LZ4_decompress_generic, so I add that. The second restriction is left to be explained by the author. I also took the liberty to explain that empty inputs "are either unrepresentable or can be represented with a null byte". This wording may actually have some merit: it leaves for the implementation, as opposed to the spec, to decide whether the encoder can compress empty inputs, and whether the decoder can produce an empty output (which the implementation should further clarify). | ||||
| * | added a paragraph on overlap matches | Yann Collet | 2017-06-06 | 1 | -4/+12 |
| | | |||||
| * | documentation moved to doc/ | Przemyslaw Skibinski | 2016-11-03 | 1 | -0/+127 |
 |
index : lz4.git | |
| LZ4 is lossless compression algorithm, providing compression speed > 500 MB/s per core, scalable with multi-cores CPU. It features an extremely fast decoder, with speed in multiple GB/s per core, typically reaching RAM speed limits on multi-core systems. |
| summaryrefslogtreecommitdiffstats |