summaryrefslogtreecommitdiffstats
path: root/cpukit/zlib/doc/algorithm.txt
diff options
context:
space:
mode:
authorJoel Sherrill <joel.sherrill@OARcorp.com>2011-03-18 10:11:29 +0000
committerJoel Sherrill <joel.sherrill@OARcorp.com>2011-03-18 10:11:29 +0000
commit6121dc77366dbc5b7fe28e6d405e498e79630c15 (patch)
treeda2e2000ca12b6e2c1c739f123d867b0f182c841 /cpukit/zlib/doc/algorithm.txt
parentThis commit was generated by cvs2svn to compensate for changes in r25189, (diff)
downloadrtems-6121dc77366dbc5b7fe28e6d405e498e79630c15.tar.bz2
2010-03-22 Joel Sherrill <joel.sherrill@oarcorp.com>
* ChangeLog.zlib, FAQ, Makefile.am, README, adler32.c, compress.c, crc32.c, deflate.c, deflate.h, infback.c, inffast.c, inflate.c, inflate.h, inftrees.c, inftrees.h, trees.c, uncompr.c, zconf.h, zlib.3, zlib.h, zutil.c, zutil.h: Update to zlib 1.2.4. * gzclose.c, gzguts.h, gzlib.c, gzread.c, gzwrite.c, doc/algorithm.txt: New files. * algorithm.txt, gzio.c: Removed.
Diffstat (limited to '')
-rw-r--r--cpukit/zlib/doc/algorithm.txt (renamed from cpukit/zlib/algorithm.txt)2
1 files changed, 1 insertions, 1 deletions
diff --git a/cpukit/zlib/algorithm.txt b/cpukit/zlib/doc/algorithm.txt
index b022dde312..34960bddac 100644
--- a/cpukit/zlib/algorithm.txt
+++ b/cpukit/zlib/doc/algorithm.txt
@@ -121,7 +121,7 @@ At least for deflate's output that generates new trees every several 10's of
kbytes. You can imagine that filling in a 2^15 entry table for a 15-bit code
would take too long if you're only decoding several thousand symbols. At the
other extreme, you could make a new table for every bit in the code. In fact,
-that's essentially a Huffman tree. But then you spend two much time
+that's essentially a Huffman tree. But then you spend too much time
traversing the tree while decoding, even for short symbols.
So the number of bits for the first lookup table is a trade of the time to