diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2018-04-09 20:01:31 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2018-04-09 20:01:49 +0300 |
| commit | ec91948dd708391017d884904fda7daaa90fba2d (patch) | |
| tree | bdcf555bcb871d33453e77d34b047cada78e3493 | |
| parent | 7213553c84a34256322ce7f113a601ee442736fd (diff) | |
Cleanup: unused variable
| -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: |