diff options
author | Sergey Sharybin <sergey.vfx@gmail.com> | 2018-04-10 12:59:23 +0300 |
---|---|---|
committer | Sergey Sharybin <sergey.vfx@gmail.com> | 2018-04-10 13:00:10 +0300 |
commit | 6962119e7f9152d99dac60a5bea76d7c6829d6c9 (patch) | |
tree | c21fd2fdecac15db849ef24a8baa91dd7c2908ab /release | |
parent | a74e782f5b3e1df763274e3c8f803562dbbd9a89 (diff) | |
parent | 5c3857b3051ff9f40e606ae2fc59f68a1747f1d7 (diff) |
Merge branch 'master' into blender2.8
Diffstat (limited to 'release')
-rw-r--r-- | release/scripts/startup/bl_operators/bmesh/find_adjacent.py | 3 |
1 files changed, 0 insertions, 3 deletions
diff --git a/release/scripts/startup/bl_operators/bmesh/find_adjacent.py b/release/scripts/startup/bl_operators/bmesh/find_adjacent.py index 1555f465aa5..ff2e09c6bb5 100644 --- a/release/scripts/startup/bl_operators/bmesh/find_adjacent.py +++ b/release/scripts/startup/bl_operators/bmesh/find_adjacent.py @@ -213,7 +213,6 @@ def find_next(ele_dst, ele_src): # ... So we have the highest chance of stepping onto the opposite element. diff_best = 0 ele_best = None - ele_best_tot = 0 ele_best_ls = [] for ele_test in candidates: depth_test_a = elems_depth_measure(ele_dst, ele_test, other_edges_over_edge) @@ -227,12 +226,10 @@ def find_next(ele_dst, ele_src): if diff_test > diff_best: diff_best = diff_test ele_best = ele_test - ele_best_tot = 1 ele_best_ls[:] = [ele_best] elif diff_test == diff_best: if ele_best is None: ele_best = ele_test - ele_best_tot += 1 ele_best_ls.append(ele_test) if len(ele_best_ls) > 1: |