Lines 1-20
Link Here
|
1 |
LZO is a data compression library which is suitable for data |
1 |
LZO is a data compression library which is suitable for data |
2 |
de-/compression in real-time. This means it favours speed over |
2 |
de-/compression in real-time. This means it favours speed over |
3 |
compression ratio. |
3 |
compression ratio. |
4 |
|
4 |
|
5 |
LZO implements a number of algorithms with the following features: |
5 |
LZO implements a number of algorithms with the following features: |
6 |
+ Decompression is simple and *very* fast. |
6 |
+ Decompression is simple and *very* fast. |
7 |
+ Requires no memory for decompression. |
7 |
+ Requires no memory for decompression. |
8 |
+ Compression is pretty fast. |
8 |
+ Compression is pretty fast. |
9 |
+ Requires 64 kB of memory for compression. |
9 |
+ Requires 64 kB of memory for compression. |
10 |
+ Allows you to dial up extra compression at a speed cost in the |
10 |
+ Allows you to dial up extra compression at a speed cost in the |
11 |
compressor. The speed of the decompressor is not reduced. |
11 |
compressor. The speed of the decompressor is not reduced. |
12 |
+ Includes compression levels for generating pre-compressed data |
12 |
+ Includes compression levels for generating pre-compressed data |
13 |
which achieve a quite competitive compression ratio. |
13 |
which achieve a quite competitive compression ratio. |
14 |
+ There is also a compression level which needs only 8 kB for |
14 |
+ There is also a compression level which needs only 8 kB for |
15 |
compression. |
15 |
compression. |
16 |
+ Algorithm is thread safe. |
16 |
+ Algorithm is thread safe. |
17 |
+ Algorithm is lossless. |
17 |
+ Algorithm is lossless. |
18 |
|
18 |
|
19 |
Author: Markus Franz Xaver Johannes Oberhumer |
19 |
Author: Markus Franz Xaver Johannes Oberhumer |
20 |
markus.oberhumer@jk.uni-linz.ac.at |
20 |
markus.oberhumer@jk.uni-linz.ac.at |