def getTimes(self, times): times = utils.degenerate(times) n = len(times) if n == 0: return i = 0 step = 1 while True: yield times[i] i += step if i == n or i == -1: step *= -1 i += 2 * step
def getTimes(self, times): times = utils.degenerate(times) n = len(times) if n == 0: return i = 0 step = 1 while True: yield times[i] i += step if i == n or i == -1: step *= -1 i += 2*step
def getTimes(self, times): times = utils.degenerate(times) while True: for t in times: yield t
def getTimes(self, times): return reversed(utils.degenerate(times))