@@ -136,7 +136,7 @@ private void BuildTree(byte[] codeLengths)
136136
137137 var code = 0 ;
138138 var treeSize = 512 ;
139- for ( var bits = 1 ; bits <= MAX_BITLEN ; bits ++ )
139+ for ( int bits = 1 ; bits <= MAX_BITLEN ; bits ++ )
140140 {
141141 nextCode [ bits ] = code ;
142142 code += blCount [ bits ] << ( 16 - bits ) ;
@@ -160,7 +160,7 @@ private void BuildTree(byte[] codeLengths)
160160 */
161161 tree = new short [ treeSize ] ;
162162 var treePtr = 512 ;
163- for ( var bits = MAX_BITLEN ; bits >= 10 ; bits -- )
163+ for ( int bits = MAX_BITLEN ; bits >= 10 ; bits -- )
164164 {
165165 var end = code & 0x1ff80 ;
166166 code -= blCount [ bits ] << ( 16 - bits ) ;
@@ -216,7 +216,7 @@ private void BuildTree(byte[] codeLengths)
216216 /// </returns>
217217 public int GetSymbol ( StreamManipulator input )
218218 {
219- int lookahead , symbol ;
219+ int lookahead , symbol , bits ;
220220 if ( ( lookahead = input . PeekBits ( 9 ) ) >= 0 )
221221 {
222222 if ( ( symbol = tree [ lookahead ] ) >= 0 )
@@ -232,7 +232,7 @@ public int GetSymbol(StreamManipulator input)
232232 input . DropBits ( symbol & 15 ) ;
233233 return symbol >> 4 ;
234234 }
235- var bits = input . AvailableBits ;
235+ bits = input . AvailableBits ;
236236 lookahead = input . PeekBits ( bits ) ;
237237 symbol = tree [ subtree | ( lookahead >> 9 ) ] ;
238238 if ( ( symbol & 15 ) <= bits )
@@ -242,7 +242,7 @@ public int GetSymbol(StreamManipulator input)
242242 }
243243 return - 1 ;
244244 }
245- var bits = input . AvailableBits ;
245+ bits = input . AvailableBits ;
246246 lookahead = input . PeekBits ( bits ) ;
247247 symbol = tree [ lookahead ] ;
248248 if ( symbol >= 0 && ( symbol & 15 ) <= bits )
0 commit comments