Help Guide (Web manual)

Jean-loup Gailly
[e-mail]
Mark Adler
[e-mail]
The data format used by the zlib library is described by RFCs (Request for Comments) 1950 to 1952 in the files
http://www.ietf.org/rfc/rfc1950.txt (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format).
trinftrees.c
Copyright (C) 1995-2010 Mark Adler
For conditions of distribution and use, see copyright notice in zlib.h
This software is provided 'as-is', without any express or implied warranty.
In no event will the authors be held liable for any damages arising from the use of this software.
Permission is granted to anyone to use this software for any purpose, including commercial applications, and to
alter it and redistribute it freely, subject to the following restrictions:
Jean-loup Gailly
[e-mail]
Mark Adler
[e-mail]
The data format used by the zlib library is described by RFCs (Request for Comments) 1950 to 1952 in the files
http://www.ietf.org/rfc/rfc1950.txt (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format).
trees.c
Copyright (C) 1995-2010 Jean-loup Gailly detect_data_type() function provided freely by Cosmin Truta, 2006
For conditions of distribution and use, see copyright notice in zlib.h
ALGORITHM
The “deflation” process uses several Huffman trees. The more common source values are represented by shorter
bit sequences.
Each code tree is stored in a compressed form which is itself a Huffman encoding of the lengths of all the code
strings (in ascending order by source values).
The actual code strings are reconstructed from the lengths in the inflate process, as described in the deflate
specification.
REFERENCES
Deutsch, L.P., “'Deflate' Compressed Data Format Specification”.
Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc
Storer, James A.
Data Compression: Methods and Theory, pp. 49-50.
Computer Science Press, 1988. ISBN 0-7167-8156-5.
Sedgewick, R.
Algorithms, p290.
Addison-Wesley, 1983. ISBN 0-201-06672-6.
This software is provided 'as-is', without any express or implied warranty.
In no event will the authors be held liable for any damages arising from the use of this software.
Permission is granted to anyone to use this software for any purpose, including commercial applications, and to
alter it and redistribute it freely, subject to the following restrictions:
The origin of this software must not be misrepresented; you must not claim that you wrote the original
software. If you use this software in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
1.
Altered source versions must be plainly marked as such, and must not be misrepresented as being the
original software.
2.
This notice may not be removed or altered from any source distribution.
3.
The origin of this software must not be misrepresented; you must not claim that you wrote the original
software. If you use this software in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
1.
Altered source versions must be plainly marked as such, and must not be misrepresented as being the
original software.
2.
This notice may not be removed or altered from any source distribution.
3.
The origin of this software must not be misrepresented; you must not claim that you wrote the original
software. If you use this software in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
1.
Altered source versions must be plainly marked as such, and must not be misrepresented as being the
original software.
2.