def findCycle(self, cycNum):
cycNum=int(cycNum)<EOL>i=<NUM_LIT:0><EOL>while i < len(self.cycles):<EOL><INDENT>if cycNum < int(self.cycles[i]):<EOL><INDENT>break<EOL><DEDENT>i+=<NUM_LIT:1><EOL><DEDENT>if i ==<NUM_LIT:0>:<EOL><INDENT>return self.cycles[i]<EOL><DEDENT>elif i == len(self.cycles):<EOL><INDENT>return self.cycles[i-<NUM_LIT:1>]<EOL><DEDENT>lower=int(self.cycles[i-<NUM_LIT:1>])<EOL>higher=int(self.cycles[i])<EOL>if higher- cycNum >= cycNum-lower:<EOL><INDENT>return self.cycles[i-<NUM_LIT:1>]<EOL><DEDENT>else:<EOL><INDENT>return self.cycles[i]<EOL><DEDENT>
Method that looks through the self.cycles and returns the
nearest cycle:

Parameters
----------
cycNum : int
    int of the cycle desired cycle.