summaryrefslogtreecommitdiffstats
path: root/tqtinterface/qt4/src/3rdparty/libjpeg/jdhuff.h
diff options
context:
space:
mode:
Diffstat (limited to 'tqtinterface/qt4/src/3rdparty/libjpeg/jdhuff.h')
-rw-r--r--tqtinterface/qt4/src/3rdparty/libjpeg/jdhuff.h8
1 files changed, 4 insertions, 4 deletions
diff --git a/tqtinterface/qt4/src/3rdparty/libjpeg/jdhuff.h b/tqtinterface/qt4/src/3rdparty/libjpeg/jdhuff.h
index 9e59158..ae19b6c 100644
--- a/tqtinterface/qt4/src/3rdparty/libjpeg/jdhuff.h
+++ b/tqtinterface/qt4/src/3rdparty/libjpeg/jdhuff.h
@@ -5,7 +5,7 @@
* This file is part of the Independent JPEG Group's software.
* For conditions of distribution and use, see the accompanying README file.
*
- * This file tqcontains declarations for Huffman entropy decoding routines
+ * This file contains declarations for Huffman entropy decoding routines
* that are shared between the sequential decoder (jdhuff.c) and the
* progressive decoder (jdphuff.c). No other modules need to see these.
*/
@@ -58,13 +58,13 @@ EXTERN(void) jpeg_make_d_derived_tbl
* demanded at one time) never exceeds 15 for JPEG use.
*
* We read source bytes into get_buffer and dole out bits as needed.
- * If get_buffer already tqcontains enough bits, they are fetched in-line
+ * If get_buffer already contains enough bits, they are fetched in-line
* by the macros CHECK_BIT_BUFFER and GET_BITS. When there aren't enough
* bits, jpeg_fill_bit_buffer is called; it will attempt to fill get_buffer
* as full as possible (not just to the number of bits needed; this
* prefetching reduces the overhead cost of calling jpeg_fill_bit_buffer).
* Note that jpeg_fill_bit_buffer may return FALSE to indicate suspension.
- * On TRUE return, jpeg_fill_bit_buffer guarantees that get_buffer tqcontains
+ * On TRUE return, jpeg_fill_bit_buffer guarantees that get_buffer contains
* at least the requested number of bits --- dummy zeroes are inserted if
* necessary.
*/
@@ -168,7 +168,7 @@ EXTERN(boolean) jpeg_fill_bit_buffer
* Notes about the HUFF_DECODE macro:
* 1. Near the end of the data segment, we may fail to get enough bits
* for a lookahead. In that case, we do it the hard way.
- * 2. If the lookahead table tqcontains no entry, the next code must be
+ * 2. If the lookahead table contains no entry, the next code must be
* more than HUFF_LOOKAHEAD bits long.
* 3. jpeg_huff_decode returns -1 if forced to suspend.
*/