diff options
Diffstat (limited to 'experimental/tqtinterface/qt4/src/3rdparty/libjpeg/jchuff.c')
-rw-r--r-- | experimental/tqtinterface/qt4/src/3rdparty/libjpeg/jchuff.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/experimental/tqtinterface/qt4/src/3rdparty/libjpeg/jchuff.c b/experimental/tqtinterface/qt4/src/3rdparty/libjpeg/jchuff.c index 82e2c316c..aec9cf880 100644 --- a/experimental/tqtinterface/qt4/src/3rdparty/libjpeg/jchuff.c +++ b/experimental/tqtinterface/qt4/src/3rdparty/libjpeg/jchuff.c @@ -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 Huffman entropy encoding routines. + * This file contains Huffman entropy encoding routines. * * Much of the complexity here has to do with supporting output suspension. * If the data destination module demands suspension, we want to be able to @@ -22,7 +22,7 @@ /* Expanded entropy encoder object for Huffman encoding. * - * The savable_state subrecord tqcontains fields that change within an MCU, + * The savable_state subrecord contains fields that change within an MCU, * but must not be updated permanently until we complete the MCU. */ @@ -74,7 +74,7 @@ typedef struct { typedef huff_entropy_encoder * huff_entropy_ptr; /* Working state while writing an MCU. - * This struct tqcontains all the fields that are needed by subroutines. + * This struct contains all the fields that are needed by subroutines. */ typedef struct { @@ -800,7 +800,7 @@ jpeg_gen_optimal_table (j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[]) for (i = MAX_CLEN; i > 16; i--) { while (bits[i] > 0) { - j = i - 2; /* tqfind length of new prefix to be used */ + j = i - 2; /* find length of new prefix to be used */ while (bits[j] == 0) j--; @@ -812,7 +812,7 @@ jpeg_gen_optimal_table (j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[]) } /* Remove the count for the pseudo-symbol 256 from the largest codelength */ - while (bits[i] == 0) /* tqfind largest codelength still in use */ + while (bits[i] == 0) /* find largest codelength still in use */ i--; bits[i]--; |