parameters: (self, L, R)
return_statement: return sum(bitCount(i) in primes
                     for i in xrange(L, R+1))
docstring: :type L: int
          :type R: int
          :rtype: int
docstring_summary: :type L: int
          :type R: int
          :rtype: int
docstring_tokens: : type L : int : type R : int : rtype : int
function: def countPrimeSetBits(self, L, R):
          """
          :type L: int
          :type R: int
          :rtype: int
          """
          def bitCount(n):
              result = 0
              while n:
                  n &= n-1
                  result += 1
              return result
  
          primes = {2, 3, 5, 7, 11, 13, 17, 19}
          return sum(bitCount(i) in primes
                     for i in xrange(L, R+1))
function_tokens: def countPrimeSetBits ( self , L , R ) : def bitCount ( n ) : result = 0 while n : n &= n - 1 result += 1 return result primes = { 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 } return sum ( bitCount ( i ) in primes for i in xrange ( L , R + 1 ) )