forked from nortikin/sverchok
-
Notifications
You must be signed in to change notification settings - Fork 0
/
node_ScalarMath.py
258 lines (221 loc) · 8.94 KB
/
node_ScalarMath.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
# ##### BEGIN GPL LICENSE BLOCK #####
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License
# as published by the Free Software Foundation; either version 2
# of the License, or (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# 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 #####
import bpy
from node_s import *
from util import *
from mathutils import Vector, Matrix
from math import *
class ScalarMathNode(Node, SverchCustomTreeNode):
''' ScalarMathNode '''
bl_idname = 'ScalarMathNode'
bl_label = 'function'
bl_icon = 'OUTLINER_OB_EMPTY'
# Math functions from http://docs.python.org/3.3/library/math.html
# maybe this should be distilled to most common with the others available via Formula2 Node
# And some constants etc.
# Keep 4, columns number unchanged and only add new with unique number
mode_items = [
("SINE", "Sine", "",1),
("COSINE", "Cosine", "",2),
("TANGENT", "Tangent", "",3),
("ARCSINE", "Arcsine", "",4),
("ARCCOSINE", "Arccosine", "",5),
("ARCTANGENT", "Arctangent", "",6),
("SQRT", "Squareroot", "",11),
("NEG", "Negate", "",12),
("DEGREES", "Degrees", "",13),
("RADIANS", "Radians", "",14),
("ABS", "Absolute", "",15),
("CEIL", "Ceiling", "",16),
("ROUND", "Round", "",17),
("ROUND-N", "Round N", "",18),
("FMOD", "Fmod", "",19),
("MODULO", "modulo", "",20),
("FLOOR", "floor", "",21),
("EXP", "Exponent", "",30),
("LN", "log", "",31),
("LOG1P", "log1p", "",32),
("LOG10", "log10", "",33),
("ACOSH", "acosh", "",40),
("ASINH", "asinh", "",41),
("ATANH", "atanh", "",42),
("COSH", "cosh", "",43),
("SINH", "sinh", "",44),
("TANH", "tanh", "",45),
("ADD", "+", "",50),
("SUB", "-", "",51),
("MUL", "*", "",52),
("DIV", "/", "",53),
("INTDIV", "//", "",54),
("POW", "**", "",55),
("PI", "pi", "",60),
("E", "e", "",61),
("PHI", "phi", "",62),
("TAU", "tau", "",63),
("MIN", "min", "",70),
("MAX", "max", "",71),
("-1", "x-1", "",80),
("+1", "x+1", "",81),
("*2", "x*2", "",82),
("/2", "x/2", "",83),
("x**2", "x**2", "",84),
]
fx = {
'SINE': sin,
'COSINE': cos,
'TANGENT': tan,
'ARCSINE': asin,
'ARCCOSINE': acos,
'ARCTANGENT': atan,
'SQRT': lambda x: sqrt(fabs(x)),
'NEG': lambda x: -x,
'DEGREES': degrees,
'RADIANS': radians,
'ABS': fabs,
'FLOOR': floor,
'CEIL': ceil,
'EXP': exp,
'LN': log,
'LOG1P': log1p,
'LOG10': log10,
'ACOSH': acosh,
'ASINH': asinh,
'COSH': cosh,
'SINH': sinh,
'TANH': tanh,
'ROUND': round,
'+1': lambda x:x+1,
'-1': lambda x:x-1,
'*2': lambda x:x*2,
'/2': lambda x:x/2,
'POW2': lambda x:x**2,
}
fxy = {
'ADD': lambda x,y : x+y,
'SUB': lambda x,y : x-y,
'DIV': lambda x,y : x/y,
'INTDIV': lambda x,y : x//y,
'MUL': lambda x,y : x*y,
'POW': lambda x,y : x**y,
'ROUND-N': lambda x,y : round(x,y),
'FMOD': lambda x,y : fmod(x,y),
'MODULO': lambda x,y : x%y,
'MIN': lambda x,y : min(x,y),
'MAX': lambda x,y : max(x,y)
}
constant = {
'PI': pi,
'TAU': pi*2,
'E': e,
'PHI': 1.61803398875,
}
items_=bpy.props.EnumProperty( items = mode_items, name="Function",
description="Function choice", default="SINE", update=updateNode)
def draw_buttons(self, context, layout):
layout.prop(self,"items_","Functions:");
def init(self, context):
self.inputs.new('StringsSocket', "X", "x")
self.outputs.new('StringsSocket', "float", "out")
def update(self):
# inputs
nrInputs = 1
if self.items_ in self.constant:
nrInputs = 0
elif self.items_ in self.fx:
nrInputs = 1
elif self.items_ in self.fxy:
nrInputs = 2
self.set_inputs(nrInputs)
self.label=self.items_
if 'X' in self.inputs and self.inputs['X'].links and \
type(self.inputs['X'].links[0].from_socket) == StringsSocket:
Number1 = SvGetSocketAnyType(self,self.inputs['X'])
else:
Number1 = []
if 'Y' in self.inputs and self.inputs['Y'].links and \
type(self.inputs['Y'].links[0].from_socket) == StringsSocket:
Number2 = SvGetSocketAnyType(self,self.inputs['Y'])
else:
Number2 = []
# outputs
if 'float' in self.outputs and self.outputs['float'].links:
result = []
if nrInputs == 0:
result = [[self.constant[self.items_]]]
if nrInputs == 1:
if len(Number1):
x = Number1
result = self.recurse_fx(x,self.fx[self.items_])
if nrInputs == 2:
if len(Number1) and len(Number2):
x = Number1
y = Number2
result = self.recurse_fxy(x,y,self.fxy[self.items_])
SvSetSocketAnyType(self,'float',result)
def set_inputs(self,n):
if n == len(self.inputs):
return
if n < len(self.inputs):
while n < len(self.inputs):
self.inputs.remove(self.inputs[-1])
if n > len(self.inputs):
if not 'X' in self.inputs:
self.inputs.new('StringsSocket', "X", "x")
if not 'Y' in self.inputs:
self.inputs.new('StringsSocket', "Y", "y")
# apply f to all values recursively
def recurse_fx(self, l,f):
if type(l) == int or type(l) == float:
t = f(l)
else:
t = []
for i in l:
i = self.recurse_fx(i,f)
t.append(i)
return t
# match length of lists,
# cases
# [1,2,3] + [1,2,3] -> [2,4,6]
# [1,2,3] + 1 -> [2,3,4]
# [1,2,3] + [1,2] -> [2,4,5] , list is expanded to match length, [-1] is repeated
# odd cases too.
# [1,2,[1,1,1]] + [[1,2,3],1,2] -> [[2,3,4],3,[3,3,3]]
def recurse_fxy(self,l1, l2, f):
if (type(l1) is int or type(l1) is float) and \
(type(l2) is int or type(l2) is float):
return f(l1,l2)
if type(l1) is list and type (l2) is list:
max_obj = max(len(l1),len(l2))
fullList(l1,max_obj)
fullList(l2,max_obj)
res = []
for i in range(len(l1)):
res.append( self.recurse_fxy(l1[i], l2[i],f))
return res
if type(l1) is list and (type(l2) is float or type(l2) is int):
return self.recurse_fxy(l1,[l2],f)
if type(l2) is list and (type(l1) is float or type(l1) is int):
return self.recurse_fxy([l1],l2,f)
def update_socket(self, context):
self.update()
def register():
bpy.utils.register_class(ScalarMathNode)
def unregister():
bpy.utils.unregister_class(ScalarMathNode)
if __name__ == "__main__":
register()