comparison mercurial/hbisect.py @ 17509:f7767f52e9eb

spelling: recursion
author timeless@mozdev.org
date Fri, 17 Aug 2012 13:58:18 -0700
parents d057e92dadfc
children 31f32a96e1e3
comparison
equal deleted inserted replaced
17508:57fb8c9509f4 17509:f7767f52e9eb
169 state = load_state(repo) 169 state = load_state(repo)
170 if status in ('good', 'bad', 'skip', 'current'): 170 if status in ('good', 'bad', 'skip', 'current'):
171 return map(repo.changelog.rev, state[status]) 171 return map(repo.changelog.rev, state[status])
172 else: 172 else:
173 # In the following sets, we do *not* call 'bisect()' with more 173 # In the following sets, we do *not* call 'bisect()' with more
174 # than one level of recusrsion, because that can be very, very 174 # than one level of recursion, because that can be very, very
175 # time consuming. Instead, we always develop the expression as 175 # time consuming. Instead, we always develop the expression as
176 # much as possible. 176 # much as possible.
177 177
178 # 'range' is all csets that make the bisection: 178 # 'range' is all csets that make the bisection:
179 # - have a good ancestor and a bad descendant, or conversely 179 # - have a good ancestor and a bad descendant, or conversely