original_docstring:  Returns a list of primes < n for n > 2 
docstring: Returns a list of primes < n for n > 2
docstring_tokens: Returns a list of primes < n for n > 2
code: def primes_below(n):
      """ Returns a list of primes < n for n > 2 """
      sieve = bytearray([True]) * (n//2+1)
      for i in range(1,int(n**0.5)//2+1):
          if sieve[i]:
              sieve[2*i*(i+1)::2*i+1] = bytearray((n//2-2*i*(i+1))//(2*i+1)+1)
      return [2,*compress(range(3,n,2), sieve[1:])]
code_tokens: def primes_below ( n ) : sieve = bytearray ( [ True ] ) * ( n // 2 + 1 ) for i in range ( 1 , int ( n ** 0.5 ) // 2 + 1 ) : if sieve [ i ] : sieve [ 2 * i * ( i + 1 ) : : 2 * i + 1 ] = bytearray ( ( n // 2 - 2 * i * ( i + 1 ) ) // ( 2 * i + 1 ) + 1 ) return [ 2 , * compress ( range ( 3 , n , 2 ) , sieve [ 1 : ] ) ]
short_docstring: Returns a list of primes < n for n > 2
short_docstring_tokens: Returns a list of primes < n for n > 2
comment: """ Returns a list of primes < n for n > 2 """