diff options
| author | Ian Lance Taylor <ian@gcc.gnu.org> | 2012-12-12 23:13:29 +0000 |
|---|---|---|
| committer | Ian Lance Taylor <ian@gcc.gnu.org> | 2012-12-12 23:13:29 +0000 |
| commit | a42a906c420d7bb196cb8541e0ab65264a0b04b0 (patch) | |
| tree | 8c441679e35147b1e9bec048f733fc394fb0c161 /libgo/go/image | |
| parent | bc77608b97abcc4bb3171f08a71e34ae342e9f8d (diff) | |
| download | gcc-a42a906c420d7bb196cb8541e0ab65264a0b04b0.zip gcc-a42a906c420d7bb196cb8541e0ab65264a0b04b0.tar.gz gcc-a42a906c420d7bb196cb8541e0ab65264a0b04b0.tar.bz2 | |
libgo: Update to current master library sources.
From-SVN: r194460
Diffstat (limited to 'libgo/go/image')
| -rw-r--r-- | libgo/go/image/jpeg/huffman.go | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/libgo/go/image/jpeg/huffman.go b/libgo/go/image/jpeg/huffman.go index 2fc64ad..9b731fd 100644 --- a/libgo/go/image/jpeg/huffman.go +++ b/libgo/go/image/jpeg/huffman.go @@ -163,7 +163,7 @@ func (d *decoder) processDHT(n int) error { // Returns the next Huffman-coded value from the bit stream, decoded according to h. // TODO(nigeltao): This decoding algorithm is simple, but slow. A lookahead table, instead of always -// peeling off only 1 bit at at time, ought to be faster. +// peeling off only 1 bit at time, ought to be faster. func (d *decoder) decodeHuffman(h *huffman) (uint8, error) { if h.length == 0 { return 0, FormatError("uninitialized Huffman table") |