kannonier8/blender
1
0
Fork 0
forked from bartvdbraak/blender
Code Pull Requests Activity

Correct check when no path can be found

Browse Source
This commit is contained in:
Campbell Barton 2016-01-08 06:09:54 +11:00
parent d755b08259
commit e63c773b7c
1 changed files with 8 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
release/scripts/startup/bl_operators/bmesh/find_adjacent.py
View File

@ -179,17 +179,22 @@ def elems_depth_measure(ele_dst, ele_src, other_edges_over_cb):
stack_new[:] = []
depth += 1
return [vert_depths[v] for v in ele_dst_verts]
if not all_dst:
return [vert_depths[v] for v in ele_dst_verts]
else:
return None
def find_next(ele_dst, ele_src):
depth_src_a = elems_depth_measure(ele_dst, ele_src, other_edges_over_edge)
depth_src_b = elems_depth_measure(ele_dst, ele_src, other_edges_over_face)
depth_src = tuple(zip(depth_src_a, depth_src_b))
if depth_src is None:
# path not found
if depth_src_a is None or depth_src_b is None:
return []
depth_src = tuple(zip(depth_src_a, depth_src_b))
candidates = elems_depth_search(ele_dst, depth_src_a, other_edges_over_edge)
candidates = elems_depth_search(ele_dst, depth_src_b, other_edges_over_face, candidates)
candidates.discard(ele_src)