Lines Matching +full:charge +full:- +full:vol
9 Category: Informational J-L. Gailly
10 Info-ZIP
29 Copyright (c) 1996 L. Peter Deutsch and Jean-Loup Gailly
32 purpose and without charge, including translations into other
40 <ftp://ftp.uu.net/graphics/png/documents/zlib/zdoc-index.html>.
50 not covered by patents. This specification also defines the ADLER-32
132 used for in-memory compression of a sequence of arbitrary bytes.
152 In version 3.2, some terminology was changed and the Adler-32
163 +---+
164 | | <-- the vertical bars might be missing
165 +---+
185 an integer between 0 and 255 does have a most- and least-
186 significant bit, and since we write numbers with the most-
187 significant digit on the left, we also write bytes with the most-
189 bits of a byte so that bit 0 is the least-significant bit, i.e.,
192 +--------+
194 +--------+
197 multi-byte numbers in the format described here are stored with
198 the MOST-significant byte first (at the lower memory address).
202 +--------+--------+
204 +--------+--------+
215 +---+---+
216 |CMF|FLG| (more-->)
217 +---+---+
234 +---+---+---+---+
235 | DICTID | (more-->)
236 +---+---+---+---+
238 +=====================+---+---+---+---+
240 +=====================+---+---+---+---+
246 This byte is divided into a 4-bit compression method and a 4-
262 For CM = 8, CINFO is the base-2 logarithm of the LZ77 window
276 a 16-bit unsigned integer stored in MSB order (CMF*256 + FLG),
291 producing any compressed output. DICT is the Adler-32 checksum
301 0 - compressor used fastest algorithm
302 1 - compressor used fast algorithm
303 2 - compressor used default algorithm
304 3 - compressor used maximum compression, slowest algorithm
318 ADLER32 (Adler-32 checksum)
320 (excluding any dictionary data) computed according to Adler-32
321 algorithm. This algorithm is a 32-bit extension and improvement
322 of the Fletcher algorithm, used in the ITU-T X.224 / ISO 8073
325 Adler-32 is composed of two sums accumulated per byte: s1 is
328 Adler-32 checksum is stored as s2*65536 + s1 in most-
329 significant-byte first (network) order.
381 Transmissions," IEEE Transactions on Communications, Vol. COM-30,
382 No. 1, January 1982, pp. 247-252.
384 [5] ITU-T Recommendation X.224, Annex D, "Checksum Algorithms,"
386 gopher://info.itu.ch). ITU-T X.244 is also the same as ISO 8073.
414 Jean-Loup Gailly and Mark Adler designed the zlib format and wrote
416 Randers-Pehrson converted this document to RFC and HTML format.
425 Phone: (415) 322-0103 (AM only)
426 FAX: (415) 322-1734
430 Jean-Loup Gailly
437 Jean-Loup Gailly <gzip@prep.ai.mit.edu> and
443 Glenn Randers-Pehrson <randeg@alumni.rpi.edu>
479 8.2. The Adler-32 algorithm
481 The Adler-32 algorithm is much faster than the CRC32 algorithm yet
489 large class of two-byte errors that leave the check unchanged.
491 makes the Fletcher check insensitive to single byte changes 0 <->
513 The following C code computes the Adler-32 checksum of a data buffer.
530 Update a running Adler-32 checksum with the bytes buf[0..len-1]
531 and return the updated checksum. The Adler-32 checksum should be
557 /* Return the adler32 of the bytes buf[0..len-1] */