def gf_lshift(f, n, K):
 if (not f):
  return f
 else:
  return (f + ([K.zero] * n))

def gf_lshift ( f , n , K ) : if ( not f ) : return f else : return ( f + ( [ K . zero ] * n ) )
efficiently multiply f by x**n .