[Bf-extensions-cvs] [aa1d7ad] master: Strip whitespace
Campbell Barton
noreply at git.blender.org
Tue Jul 26 06:21:40 CEST 2016
Commit: aa1d7ad080a8e0528730a9de4f7a57f97a51c63e
Author: Campbell Barton
Date: Tue Jul 26 13:43:04 2016 +1000
Branches: master
https://developer.blender.org/rBACaa1d7ad080a8e0528730a9de4f7a57f97a51c63e
Strip whitespace
===================================================================
M mesh_1d_scripts.py
===================================================================
diff --git a/mesh_1d_scripts.py b/mesh_1d_scripts.py
index 9f83332..1c856de 100644
--- a/mesh_1d_scripts.py
+++ b/mesh_1d_scripts.py
@@ -1,4 +1,4 @@
-# -*- coding: utf-8 -*-
+# -*- coding: utf-8 -*-
# ##### BEGIN GPL LICENSE BLOCK #####
#
@@ -16,17 +16,17 @@
# along with this program; if not, write to the Free Software Foundation,
# Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
#
-# ##### END GPL LICENSE BLOCK #####
+# ##### END GPL LICENSE BLOCK #####
bl_info = {
- "name": "1D_Scripts",
+ "name": "1D_Scripts",
"author": "Alexander Nedovizin, Paul Kotelevets aka 1D_Inc (concept design), Nikitron",
"version": (0, 8, 8),
"blender": (2, 7, 5),
"location": "View3D > Toolbar",
"tracker_url": "https://developer.blender.org/maniphest/task/edit/form/2/",
"category": "Mesh"
-}
+}
# http://dl.dropboxusercontent.com/u/59609328/Blender-Rus/1D_Scripts.py
@@ -44,7 +44,7 @@ from bpy.props import (BoolProperty,
)
from bpy_extras.io_utils import ExportHelper, ImportHelper
from bpy.types import Operator
-import time
+import time
list_z = []
@@ -55,7 +55,7 @@ steps_smoose = 0
def check_lukap(bm):
- if hasattr(bm.verts, "ensure_lookup_table"):
+ if hasattr(bm.verts, "ensure_lookup_table"):
bm.verts.ensure_lookup_table()
bm.edges.ensure_lookup_table()
bm.faces.ensure_lookup_table()
@@ -64,7 +64,7 @@ def check_lukap(bm):
#----- Module: edge fillet-------
# author this module: Zmj100
# version 0.3.0
-# ref:
+# ref:
def a_rot(ang, rp, axis, q):
mtrx = Matrix.Rotation(ang, 3, axis)
tmp = q - rp
@@ -139,7 +139,7 @@ def f_edgefillet(bme, list_0, adj, n, radius, out, flip):
bme.verts.index_update()
check_lukap(bme)
list_2.append(bme.verts[-1].index)
-
+
check_lukap(bme)
if flip == True:
list_1[1:2] = list_2
@@ -152,9 +152,9 @@ def f_edgefillet(bme, list_0, adj, n, radius, out, flip):
for t in range(n1 - 1):
bme.edges.new([bme.verts[list_1[t]], bme.verts[list_1[(t + 1) % n1]]])
bme.edges.index_update()
-
+
check_lukap(bme)
-
+
bme.verts.remove(list_del[0])
bme.verts.index_update()
check_lukap(bme)
@@ -169,7 +169,7 @@ class f_op0(bpy.types.Operator):
out = BoolProperty( name = 'Outside', default = False )
flip = BoolProperty( name = 'Flip', default = False )
radius = BoolProperty( name = 'Radius', default = False )
-
+
def draw(self, context):
layout = self.layout
if f_buf.an == 180 or f_buf.an == 0.0:
@@ -213,7 +213,7 @@ class f_op0(bpy.types.Operator):
list_0 = [[v.index for v in e.verts] for e in bme.edges if e.select and e.is_valid]
if not list_0:
list_v = [v.index for v in bme.verts if v.select and v.is_valid]
-
+
if not list_0 and len(list_v)==1:
connected_edges = bme.verts[list_v[0]].link_edges
list_1 = [[v.index for v in e.verts ] for e in connected_edges if e.is_valid]
@@ -221,11 +221,11 @@ class f_op0(bpy.types.Operator):
self.report({'INFO'}, 'Two adjacent edges or single vert must be selected.')
edit_mode_in()
return {'CANCELLED'}
-
+
if out == True:
flip = False
f_edgefillet(bme, list_1, adj, n, radius, out, flip)
-
+
elif len(list_0) != 2:
self.report({'INFO'}, 'Two adjacent edges or single vert must be selected.')
edit_mode_in()
@@ -300,7 +300,7 @@ def is_loop_(list_fl):
return True if len(list_fl) == 0 else False
def e_no_(bme, indx, p, p1):
- if hasattr(bme.verts, "ensure_lookup_table"):
+ if hasattr(bme.verts, "ensure_lookup_table"):
bme.verts.ensure_lookup_table()
tmp1 = (bme.verts[indx].co).copy()
tmp1[0] += 0.1
@@ -353,7 +353,7 @@ def f_(bme, dict_0, list_fl, loop):
v = (bme.verts[list_3[j]].co).copy()
bme.verts.new(intersect_line_plane(v, v + (vec1.normalized() * 0.1), pp, pn))
bme.verts.index_update()
- if hasattr(bme.verts, "ensure_lookup_table"):
+ if hasattr(bme.verts, "ensure_lookup_table"):
bme.verts.ensure_lookup_table()
list_3[j] = bme.verts[-1].index
dict_1[list_2[j]].append(bme.verts[-1].index)
@@ -368,7 +368,7 @@ def f_(bme, dict_0, list_fl, loop):
v = (bme.verts[list_3[j]].co).copy()
bme.verts.new(intersect_line_plane(v, v + (vec1.normalized() * 0.1), pp_, pn_))
bme.verts.index_update()
- if hasattr(bme.verts, "ensure_lookup_table"):
+ if hasattr(bme.verts, "ensure_lookup_table"):
bme.verts.ensure_lookup_table()
dict_1[list_2[j]].append(bme.verts[-1].index)
else:
@@ -376,7 +376,7 @@ def f_(bme, dict_0, list_fl, loop):
v = (bme.verts[list_3[j]].co).copy()
bme.verts.new(intersect_line_plane(v, v + (vec1.normalized() * 0.1), pp, pn))
bme.verts.index_update()
- if hasattr(bme.verts, "ensure_lookup_table"):
+ if hasattr(bme.verts, "ensure_lookup_table"):
bme.verts.ensure_lookup_table()
list_3[j] = bme.verts[-1].index
dict_1[list_2[j]].append(bme.verts[-1].index)
@@ -389,7 +389,7 @@ def f_(bme, dict_0, list_fl, loop):
for o in range(n if loop else (n - 1)):
bme.faces.new([bme.verts[dict_1[list_4[t][0]][o]], bme.verts[dict_1[list_4[t][1]][o]], bme.verts[dict_1[list_4[t][1]][(o + 1) % n]], bme.verts[dict_1[list_4[t][0]][(o + 1) % n]]])
bme.faces.index_update()
- if hasattr(bme.faces, "ensure_lookup_table"):
+ if hasattr(bme.faces, "ensure_lookup_table"):
bme.faces.ensure_lookup_table()
# ------ ------
@@ -454,7 +454,7 @@ class eap_op2(bpy.types.Operator):
bme = bmesh.new()
bme.from_mesh(ob_act.data)
check_lukap(bme)
-
+
dict_0 = get_adj_v_(eap_buf.list_ek)
list_fl = [i for i in dict_0 if (len(dict_0[i]) == 1)]
loop = is_loop_(list_fl)
@@ -490,113 +490,113 @@ class eap_op3(bpy.types.Operator):
#-------------- END --- extrude along path ---------
-
-def find_index_of_selected_vertex(mesh):
- selected_verts = [i.index for i in mesh.vertices if i.select]
- verts_selected = len(selected_verts)
- if verts_selected <1:
- return None
- else:
- return selected_verts
+
+def find_index_of_selected_vertex(mesh):
+ selected_verts = [i.index for i in mesh.vertices if i.select]
+ verts_selected = len(selected_verts)
+ if verts_selected <1:
+ return None
+ else:
+ return selected_verts
def find_extreme_select_verts(mesh, verts_idx):
res_vs = []
- edges = mesh.edges
-
+ edges = mesh.edges
+
for v_idx in verts_idx:
- connecting_edges = [i for i in edges if v_idx in i.vertices[:] and i.select]
- if len(connecting_edges) == 1:
+ connecting_edges = [i for i in edges if v_idx in i.vertices[:] and i.select]
+ if len(connecting_edges) == 1:
res_vs.append(v_idx)
return res_vs
-
-def find_connected_verts_simple(me, found_index):
- edges = me.edges
+
+def find_connected_verts_simple(me, found_index):
+ edges = me.edges
connecting_edges = [i for i in edges if found_index in i.vertices[:] and \
- me.vertices[i.vertices[0]].select and me.vertices[i.vertices[1]].select]
- if len(connecting_edges) == 0:
+ me.vertices[i.vertices[0]].select and me.vertices[i.vertices[1]].select]
+ if len(connecting_edges) == 0:
return []
- else:
- connected_verts = []
- for edge in connecting_edges:
- cvert = set(edge.vertices[:])
- cvert.remove(found_index)
+ else:
+ connected_verts = []
+ for edge in connecting_edges:
+ cvert = set(edge.vertices[:])
+ cvert.remove(found_index)
vert = cvert.pop()
- connected_verts.append(vert)
- return connected_verts
+ connected_verts.append(vert)
+ return connected_verts
-def find_connected_verts(me, found_index, not_list):
- edges = me.edges
- connecting_edges = [i for i in edges if found_index in i.vertices[:]]
- if len(connecting_edges) == 0:
+def find_connected_verts(me, found_index, not_list):
+ edges = me.edges
+ connecting_edges = [i for i in edges if found_index in i.vertices[:]]
+ if len(connecting_edges) == 0:
return []
- else:
- connected_verts = []
- for edge in connecting_edges:
- cvert = set(edge.vertices[:])
- cvert.remove(found_index)
+ else:
+ connected_verts = []
+ for edge in connecting_edges:
+ cvert = set(edge.vertices[:])
+ cvert.remove(found_index)
vert = cvert.pop()
if not (vert in not_list) and me.vertices[vert].select:
- connected_verts.append(vert)
- return connected_verts
-
-
+ connected_verts.append(vert)
+ return connected_verts
+
+
def find_all_connected_verts(me, active_v, not_list=[], step=0):
vlist = [active_v]
not_list.append(active_v)
step+=1
- list_v_1 = find_connected_verts(me, active_v, not_list)
+ list_v_1 = find_connected_verts(me, active_v, not_list)
for v in list_v_1:
- list_v_2 = find_all_connected_verts(me, v, not_list, step)
+ list_v_2 = find_all_connected_verts(me, v, not_list, step)
vlist += list_v_2
- return vlist
+ return vlist
-def find_connec
@@ Diff output truncated at 10240 characters. @@
More information about the Bf-extensions-cvs
mailing list