def _nbits(n, correction={'0': 4, '1': 3, '2': 2, '3': 2, '4': 1, '5': 1, '6': 1, '7': 1, '8': 0, '9': 0, 'a': 0, 'b': 0, 'c': 0, 'd': 0, 'e': 0, 'f': 0}):
 if (n < 0):
  raise ValueError('The argument to _nbits should be nonnegative.')
 hex_n = ('%x' % n)
 return ((4 * len(hex_n)) - correction[hex_n[0]])

def _nbits ( n , correction = { '0' : 4 , '1' : 3 , '2' : 2 , '3' : 2 , '4' : 1 , '5' : 1 , '6' : 1 , '7' : 1 , '8' : 0 , '9' : 0 , 'a' : 0 , 'b' : 0 , 'c' : 0 , 'd' : 0 , 'e' : 0 , 'f' : 0 } ) : if ( n < 0 ) : raise ValueError ( 'The argument to _nbits should be nonnegative.' ) hex_n = ( '%x' % n ) return ( ( 4 * len ( hex_n ) ) - correction [ hex_n [ 0 ] ] )
number of bits in binary representation of the positive integer n .