Lines Matching +full:charge +full:- +full:vol
30 purpose and without charge, including translations into other
38 <ftp://ftp.uu.net/graphics/png/documents/zlib/zdoc-index.html>.
45 general-purpose compression methods. The data can be produced or
80 3.2.4. Non-compressed blocks (BTYPE=00) ................... 11
106 currently available general-purpose compression methods,
132 format defined here, the worst case expansion is 5 bytes per 32K-
191 except that non-compressible blocks are limited to 65,535 bytes.
235 +---+
236 | | <-- the vertical bars might be missing
237 +---+
249 an integer between 0 and 255 does have a most- and least-
250 significant bit, and since we write numbers with the most-
251 significant digit on the left, we also write bytes with the most-
253 bits of a byte so that bit 0 is the least-significant bit, i.e.,
256 +--------+
258 +--------+
261 multi-byte numbers in the format described here are stored with
262 the least-significant byte first (at the lower memory address).
266 +--------+--------+
268 +--------+--------+
277 bits of a byte are transmitted on a bit-sequential medium,
278 since the final data format described here is byte- rather than
287 bit-oriented. However, we describe the compressed block format
295 with the least-significant bit of the byte.
297 starting with the least-significant bit of the data
299 * Huffman codes are packed starting with the most-
304 *right* margin and proceeding to the *left*, with the most-
306 able to parse the result from right to left, with fixed-width
307 elements in the correct MSB-to-LSB order and Huffman codes in
308 bit-reversed order (i.e., with the first bit of the code in the
319 an encoded string unambiguously symbol-by-symbol.
322 two edges descending from each non-leaf node are labeled 0 and
323 1 and in which the leaf nodes correspond one-for-one with (are
344 0 1 ------ ----
403 ------ ----
418 from most- to least-significant bit. The code lengths are
431 code = (code + bl_count[bits-1]) << 1;
463 - -----------
471 - ------------
480 ------ ------ ----
516 00 - no compression
517 01 - compressed with fixed Huffman codes
518 10 - compressed with dynamic Huffman codes
519 11 - reserved (error)
576 3.2.4. Non-compressed blocks (BTYPE=00)
582 +---+---+---+---+================================+
584 +---+---+---+---+================================+
599 end-of-block, and values 257..285 represent length codes
625 ---- ---- ------ ---- ---- ------- ---- ---- -------
626 257 0 3 267 1 15,16 277 4 67-82
627 258 0 4 268 1 17,18 278 4 83-98
628 259 0 5 269 2 19-22 279 4 99-114
629 260 0 6 270 2 23-26 280 4 115-130
630 261 0 7 271 2 27-30 281 5 131-162
631 262 0 8 272 2 31-34 282 5 163-194
632 263 0 9 273 3 35-42 283 5 195-226
633 264 0 10 274 3 43-50 284 5 227-257
634 265 1 11,12 275 3 51-58 285 0 258
635 266 1 13,14 276 3 59-66
638 stored with the most-significant bit first, e.g., bits 1110
643 ---- ---- ---- ---- ---- ------ ---- ---- --------
644 0 0 1 10 4 33-48 20 9 1025-1536
645 1 0 2 11 4 49-64 21 9 1537-2048
646 2 0 3 12 5 65-96 22 10 2049-3072
647 3 0 4 13 5 97-128 23 10 3073-4096
648 4 1 5,6 14 6 129-192 24 11 4097-6144
649 5 1 7,8 15 6 193-256 25 11 6145-8192
650 6 2 9-12 16 7 257-384 26 12 8193-12288
651 7 2 13-16 17 7 385-512 27 12 12289-16384
652 8 3 17-24 18 8 513-768 28 13 16385-24576
653 9 3 25-32 19 8 769-1024 29 13 24577-32768
662 --------- ---- -----
663 0 - 143 8 00110000 through
665 144 - 255 9 110010000 through
667 256 - 279 7 0000000 through
669 280 - 287 8 11000000 through
681 clarity. Literal/length values 286-287 will never actually
685 Distance codes 0-31 are represented by (fixed-length) 5-bit
687 shown in Paragraph 3.2.5, above. Note that distance codes 30-
701 0 - 15: Represent code lengths of 0 - 15
702 16: Copy the previous code length 3 - 6 times.
708 17: Repeat a code length of 0 for 3 - 10 times.
710 18: Repeat a code length of 0 for 11 - 138 times
724 5 Bits: HLIT, # of Literal/Length codes - 257 (257 - 286)
725 5 Bits: HDIST, # of Distance codes - 1 (1 - 32)
726 4 Bits: HCLEN, # of Code Length codes - 4 (4 - 19)
739 These code lengths are interpreted as 3-bit integers
740 (0-7); as above, a code length of 0 means the
778 formats produced by LZ77 (Lempel-Ziv 1977, see reference [2] below);
799 using a hash function that operates on 3-byte sequences. At any
815 that are too old. To avoid a worst-case situation, very long hash
817 run-time parameter.
828 Run-time parameters also control this "lazy match" procedure. If
851 Engineers, September 1952, Volume 40, Number 9, pp. 1098-1101.
854 Compression", IEEE Transactions on Information Theory, Vol. 23,
855 No. 3, pp. 337-343.
857 [3] Gailly, J.-L., and Adler, M., ZLIB documentation and sources,
860 [4] Gailly, J.-L., and Adler, M., GZIP documentation and sources,
861 available as gzip-*.tar in ftp://prep.ai.mit.edu/pub/gnu/
864 encoding." Comm. ACM, 7,3 (Mar. 1964), pp. 166-169.
867 Comm. ACM, 33,4, April 1990, pp. 449-459.
892 Phil Katz designed the deflate format. Jean-Loup Gailly and Mark
894 Glenn Randers-Pehrson converted this document to RFC and HTML format.
910 Phone: (415) 322-0103 (AM only)
911 FAX: (415) 322-1734
917 Jean-Loup Gailly <gzip@prep.ai.mit.edu> and
923 Glenn Randers-Pehrson <randeg@alumni.rpi.edu>