@@ -201,42 +201,31 @@ def get_adj_ix(ix_start, vec_edges, half_loop):
201201 # Get adjacent edge index, skipping zero length edges
202202 len_edges = len (vec_edges )
203203 if half_loop :
204- if ix_start == 0 :
205- # Left most.
206- range_right = range (0 , len_edges )
207- range_left = None
208- elif ix_start == len_edges :
209- # Right most.
210- range_right = None
211- range_left = range (len_edges - 1 , - 1 , - 1 )
212- else :
213- range_right = range (ix_start , len_edges )
214- range_left = range (ix_start - 1 , - 1 , - 1 )
204+ range_right = range (ix_start , len_edges )
205+ range_left = range (ix_start - 1 , - 1 , - 1 )
215206 else :
216207 range_right = range (ix_start , ix_start + len_edges )
217208 range_left = range (ix_start - 1 , ix_start - 1 - len_edges , - 1 )
218209
219210 ix_right = ix_left = None
220- if range_right :
221- for i in range_right :
222- # Right
223- i %= len_edges
224- if vec_edges [i ] != ZERO_VEC :
225- ix_right = i
226- break
227- if range_left is None :
228- # Left most
229- ix_left = ix_right
230- else :
231- for i in range_left :
232- # Left
233- i %= len_edges
234- if vec_edges [i ] != ZERO_VEC :
235- ix_left = i
236- break
237- if range_right is None :
238- # Right most
239- ix_right = ix_left
211+ for i in range_right :
212+ # Right
213+ i %= len_edges
214+ if vec_edges [i ] != ZERO_VEC :
215+ ix_right = i
216+ break
217+ for i in range_left :
218+ # Left
219+ i %= len_edges
220+ if vec_edges [i ] != ZERO_VEC :
221+ ix_left = i
222+ break
223+ if half_loop :
224+ # If index of one side is None, assign another index.
225+ if ix_right is None :
226+ ix_right = ix_left
227+ if ix_left is None :
228+ ix_left = ix_right
240229
241230 return ix_right , ix_left
242231
0 commit comments