@@ -231,7 +231,7 @@ def read_bits_int_be(self, n):
231231 # 1 bit => 1 byte
232232 # 8 bits => 1 byte
233233 # 9 bits => 2 bytes
234- bytes_needed = ((bits_needed - 1 ) // 8 ) + 1 # `ceil(bits_needed / 8)`
234+ bytes_needed = ((bits_needed - 1 ) // 8 ) + 1 # `ceil(bits_needed / 8)`
235235 buf = self .read_bytes (bytes_needed )
236236 if PY2 :
237237 buf = bytearray (buf )
@@ -240,11 +240,11 @@ def read_bits_int_be(self, n):
240240
241241 new_bits = res
242242 res = res >> self .bits_left | self .bits << bits_needed
243- self .bits = new_bits # will be masked at the end of the function
243+ self .bits = new_bits # will be masked at the end of the function
244244 else :
245- res = self .bits >> - bits_needed # shift unneeded bits out
245+ res = self .bits >> - bits_needed # shift unneeded bits out
246246
247- mask = (1 << self .bits_left ) - 1 # `bits_left` is in range 0..7
247+ mask = (1 << self .bits_left ) - 1 # `bits_left` is in range 0..7
248248 self .bits &= mask
249249
250250 return res
@@ -262,7 +262,7 @@ def read_bits_int_le(self, n):
262262 # 1 bit => 1 byte
263263 # 8 bits => 1 byte
264264 # 9 bits => 2 bytes
265- bytes_needed = ((bits_needed - 1 ) // 8 ) + 1 # `ceil(bits_needed / 8)`
265+ bytes_needed = ((bits_needed - 1 ) // 8 ) + 1 # `ceil(bits_needed / 8)`
266266 buf = self .read_bytes (bytes_needed )
267267 if PY2 :
268268 buf = bytearray (buf )
@@ -278,7 +278,7 @@ def read_bits_int_le(self, n):
278278
279279 self .bits_left = - bits_needed % 8
280280
281- mask = (1 << n ) - 1 # no problem with this in Python (arbitrary precision integers)
281+ mask = (1 << n ) - 1 # no problem with this in Python (arbitrary precision integers)
282282 res &= mask
283283 return res
284284
0 commit comments