base_definitions.py 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764
  1. #Mantis Nodes Base
  2. import bpy
  3. from bpy.props import (BoolProperty, StringProperty, EnumProperty, CollectionProperty, \
  4. IntProperty, IntVectorProperty, PointerProperty, BoolVectorProperty)
  5. from . import ops_nodegroup
  6. from bpy.types import NodeTree, Node, PropertyGroup, Operator, UIList, Panel
  7. from .utilities import (prRed, prGreen, prPurple, prWhite,
  8. prOrange,
  9. wrapRed, wrapGreen, wrapPurple, wrapWhite,
  10. wrapOrange,)
  11. from .utilities import get_socket_maps, relink_socket_map, do_relink
  12. FLOAT_EPSILON=0.0001 # used to check against floating point inaccuracy
  13. def TellClasses():
  14. #Why use a function to do this? Because I don't need every class to register.
  15. return [ MantisTree,
  16. SchemaTree,
  17. MantisNodeGroup,
  18. SchemaGroup,
  19. ]
  20. def error_popup_draw(self, context):
  21. self.layout.label(text="Error executing tree. See Console.")
  22. mantis_root = ".".join(__name__.split('.')[:-1]) # absolute HACK
  23. # https://docs.blender.org/api/master/bpy.types.NodeTree.html#bpy.types.NodeTree.valid_socket_type
  24. # thank you, Sverchok
  25. def valid_interface_types(cls : NodeTree, socket_idname : str):
  26. from .socket_definitions import tell_valid_bl_idnames, TellClasses
  27. #TODO: do the versioning code to handle this so it can be in all versions
  28. if bpy.app.version <= (4,4,0): # should work in 4.4.1
  29. return socket_idname in [cls.bl_idname for cls in TellClasses()]
  30. else: # once versioning is finished this will be unnecesary.
  31. return socket_idname in tell_valid_bl_idnames()
  32. class MantisTree(NodeTree):
  33. '''A custom node tree type that will show up in the editor type list'''
  34. bl_idname = 'MantisTree'
  35. bl_label = "Rigging Nodes"
  36. bl_icon = 'OUTLINER_OB_ARMATURE'
  37. tree_valid:BoolProperty(default=False)
  38. do_live_update:BoolProperty(default=True) # use this to disable updates for e.g. scripts
  39. num_links:IntProperty(default=-1)
  40. filepath:StringProperty(default="", subtype='FILE_PATH')
  41. is_executing:BoolProperty(default=False)
  42. is_exporting:BoolProperty(default=False)
  43. execution_id:StringProperty(default='')
  44. mantis_version:IntVectorProperty(default=[0,9,2])
  45. # this prevents the node group from executing on the next depsgraph update
  46. # because I don't always have control over when the dg update happens.
  47. prevent_next_exec:BoolProperty(default=False)
  48. parsed_tree={}
  49. if (bpy.app.version < (4, 4, 0)): # in 4.4 this leads to a crash
  50. @classmethod
  51. def valid_socket_type(cls : NodeTree, socket_idname: str):
  52. return valid_interface_types(cls, socket_idname)
  53. def update_tree(self, context = None):
  54. if self.is_exporting:
  55. return
  56. # return
  57. self.is_executing = True
  58. from . import readtree
  59. prGreen("Validating Tree: %s" % self.name)
  60. try:
  61. self.parsed_tree = readtree.parse_tree(self)
  62. if context:
  63. self.display_update(context)
  64. self.is_executing = False
  65. self.tree_valid = True
  66. except GraphError as e:
  67. prRed("Failed to update node tree due to error.")
  68. self.tree_valid = False
  69. self.is_executing = False
  70. raise e
  71. finally:
  72. self.is_executing = False
  73. def display_update(self, context):
  74. if self.is_exporting:
  75. return
  76. self.is_executing = True
  77. current_tree = bpy.context.space_data.path[-1].node_tree
  78. for node in current_tree.nodes:
  79. if hasattr(node, "display_update"):
  80. try:
  81. node.display_update(self.parsed_tree, context)
  82. except Exception as e:
  83. print("Node \"%s\" failed to update display with error: %s" %(wrapGreen(node.name), wrapRed(e)))
  84. self.is_executing = False
  85. # TODO: deal with invalid links properly.
  86. # - Non-hierarchy links should be ignored in the circle-check and so the links should be marked valid in such a circle
  87. # - hierarchy-links should be marked invalid and prevent the tree from executing.
  88. def execute_tree(self,context, error_popups = False):
  89. self.prevent_next_exec = False
  90. if self.is_exporting:
  91. return
  92. # return
  93. prGreen("Executing Tree: %s" % self.name)
  94. self.is_executing = True
  95. from . import readtree
  96. try:
  97. readtree.execute_tree(self.parsed_tree, self, context, error_popups)
  98. except RecursionError as e:
  99. prRed("Recursion error while parsing tree.")
  100. finally:
  101. self.is_executing = False
  102. class SchemaTree(NodeTree):
  103. '''A node tree representing a schema to generate a Mantis tree'''
  104. bl_idname = 'SchemaTree'
  105. bl_label = "Rigging Nodes Schema"
  106. bl_icon = 'RIGID_BODY_CONSTRAINT'
  107. # these are only needed for consistent interface, but should not be used
  108. do_live_update:BoolProperty(default=True) # default to true so that updates work
  109. is_executing:BoolProperty(default=False)
  110. is_exporting:BoolProperty(default=False)
  111. mantis_version:IntVectorProperty(default=[0,9,2])
  112. if (bpy.app.version < (4, 4, 0)): # in 4.4 this leads to a crash
  113. @classmethod
  114. def valid_socket_type(cls : NodeTree, socket_idname: str):
  115. return valid_interface_types(cls, socket_idname)
  116. from dataclasses import dataclass, field
  117. from typing import Any
  118. @dataclass
  119. class MantisSocketTemplate():
  120. name : str = field(default="")
  121. bl_idname : str = field(default="")
  122. traverse_target : str = field(default="")
  123. identifier : str = field(default="")
  124. display_shape : str = field(default="") # for arrays
  125. category : str = field(default="") # for use in display update
  126. is_input : bool = field(default=False)
  127. hide : bool = field(default=False)
  128. use_multi_input : bool = field(default=False)
  129. default_value : Any = field(default=None)
  130. #TODO: do a better job explaining how MantisNode and MantisUINode relate.
  131. class MantisUINode:
  132. """
  133. This class contains the common user-interface features of Mantis nodes.
  134. MantisUINode objects will spawn one or more MantisNode objects when the graph is evaluated.
  135. The MantisNode objects will pull the data from the UI node and use it to generate the graph.
  136. """
  137. mantis_node_library=''
  138. mantis_node_class_name=''
  139. mantis_class=None
  140. @classmethod
  141. def poll(cls, ntree):
  142. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  143. @classmethod
  144. def set_mantis_class(self):
  145. from importlib import import_module
  146. # do not catch errors, they should cause a failure.
  147. try:
  148. module = import_module(self.mantis_node_library, package=mantis_root)
  149. self.mantis_class=getattr(module, self.mantis_node_class_name)
  150. except Exception as e:
  151. print(self)
  152. raise e
  153. def insert_link(self, link):
  154. if (bpy.app.version < (4, 4, 0)):
  155. return # this causes a crasah due to a bug.
  156. context = bpy.context
  157. if context.space_data:
  158. node_tree = context.space_data.path[0].node_tree
  159. if node_tree.do_live_update:
  160. node_tree.update_tree(context)
  161. if (link.to_socket.is_linked == False):
  162. node_tree.num_links+=1
  163. elif (link.to_socket.is_multi_input):
  164. node_tree.num_links+=1
  165. def init_sockets(self, socket_templates : tuple[MantisSocketTemplate]):
  166. for template in socket_templates:
  167. collection = self.outputs
  168. if template.is_input:
  169. collection = self.inputs
  170. identifier = template.name
  171. if template.identifier:
  172. identifier = template.identifier
  173. socket = collection.new(
  174. template.bl_idname,
  175. template.name,
  176. identifier=identifier,
  177. use_multi_input=template.use_multi_input
  178. )
  179. socket.hide= template.hide
  180. if template.category:
  181. # a custom property for the UI functions to use.
  182. socket['category'] = template.category
  183. if template.default_value is not None:
  184. socket.default_value = template.default_value
  185. # this can throw a TypeError - it is the caller's
  186. # responsibility to send the right type.
  187. class SchemaUINode(MantisUINode):
  188. mantis_node_library='.schema_containers'
  189. @classmethod
  190. def poll(cls, ntree):
  191. return (ntree.bl_idname in ['SchemaTree'])
  192. class LinkNode(MantisUINode):
  193. mantis_node_library='.link_containers'
  194. @classmethod
  195. def poll(cls, ntree):
  196. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  197. class xFormNode(MantisUINode):
  198. mantis_node_library='.xForm_containers'
  199. @classmethod
  200. def poll(cls, ntree):
  201. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  202. class DeformerNode(MantisUINode):
  203. mantis_node_library='.deformer_containers'
  204. @classmethod
  205. def poll(cls, ntree):
  206. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  207. def poll_node_tree(self, object):
  208. if isinstance(object, MantisTree):
  209. return True
  210. return False
  211. # TODO: try to check identifiers instead of name.
  212. def node_group_update(node, force = False):
  213. if not force:
  214. if (node.id_data.do_live_update == False) or (node.id_data.is_executing == True):
  215. return
  216. # note: if (node.id_data.is_exporting == True) I need to be able to update so I can make links.
  217. toggle_update = node.id_data.do_live_update
  218. node.id_data.do_live_update = False
  219. identifiers_in={socket.identifier:socket for socket in node.inputs}
  220. identifiers_out={socket.identifier:socket for socket in node.outputs}
  221. indices_in,indices_out={},{} # check by INDEX to see if the socket's name/type match.
  222. for collection, map in [(node.inputs, indices_in), (node.outputs, indices_out)]:
  223. for i, socket in enumerate(collection):
  224. map[socket.identifier]=i
  225. if node.node_tree is None:
  226. node.inputs.clear(); node.outputs.clear()
  227. node.id_data.do_live_update = toggle_update
  228. return
  229. found_in, found_out = [], []
  230. update_input, update_output = False, False
  231. for item in node.node_tree.interface.items_tree:
  232. if item.item_type != "SOCKET": continue
  233. if item.in_out == 'OUTPUT':
  234. if s:= identifiers_out.get(item.identifier): # if the requested output doesn't exist, update
  235. found_out.append(item.identifier)
  236. if (indices_out[s.identifier]!=item.index): update_output=True; continue
  237. if update_output: continue
  238. if s.bl_idname != item.socket_type: update_output = True; continue
  239. else: update_output = True; continue
  240. else:
  241. if s:= identifiers_in.get(item.identifier): # if the requested input doesn't exist, update
  242. found_in.append(item.identifier)
  243. if (indices_in[s.identifier]!=item.index): update_input=True; continue
  244. if update_input: continue # done here
  245. if s.bl_idname != item.socket_type: update_input = True; continue
  246. else: update_input = True; continue
  247. # Schema has an extra input for Length and for Extend.
  248. if node.bl_idname == 'MantisSchemaGroup':
  249. found_in.extend(['Schema Length', ''])
  250. # if we have too many elements, just get rid of the ones we don't need
  251. if len(node.inputs) > len(found_in):#
  252. for inp in node.inputs:
  253. if inp.identifier in found_in: continue
  254. node.inputs.remove(inp)
  255. if len(node.outputs) > len(found_out):
  256. for out in node.outputs:
  257. if out.identifier in found_out: continue
  258. node.outputs.remove(out)
  259. #
  260. if len(node.inputs) > 0 and (inp := node.inputs[-1]).bl_idname == 'WildcardSocket' and inp.is_linked:
  261. update_input = True
  262. if len(node.outputs) > 0 and (out := node.outputs[-1]).bl_idname == 'WildcardSocket' and out.is_linked:
  263. update_output = True
  264. #
  265. if not (update_input or update_output):
  266. node.id_data.do_live_update = toggle_update
  267. return
  268. if update_input or update_output:
  269. socket_maps = get_socket_maps(node)
  270. if socket_maps is None:
  271. node.id_data.do_live_update = toggle_update
  272. return
  273. socket_map_in, socket_map_out = socket_maps
  274. if update_input :
  275. if node.bl_idname == 'MantisSchemaGroup':
  276. schema_length=0
  277. if sl := node.inputs.get("Schema Length"):
  278. schema_length = sl.default_value
  279. # sometimes this isn't available yet # TODO not happy about this solution
  280. node.inputs.clear()
  281. if node.bl_idname == 'MantisSchemaGroup':
  282. node.inputs.new("IntSocket", "Schema Length", identifier='Schema Length')
  283. node.inputs['Schema Length'].default_value = schema_length
  284. if update_output: node.outputs.clear()
  285. for item in node.node_tree.interface.items_tree:
  286. if item.item_type != "SOCKET": continue
  287. if (item.in_out == 'INPUT' and update_input):
  288. relink_socket_map(node, node.inputs, socket_map_in, item)
  289. if (item.in_out == 'OUTPUT' and update_output):
  290. relink_socket_map(node, node.outputs, socket_map_out, item)
  291. # at this point there is no wildcard socket
  292. if '__extend__' in socket_map_in.keys():
  293. do_relink(node, None, socket_map_in, in_out='INPUT', parent_name='Constant' )
  294. node.id_data.do_live_update = toggle_update
  295. def node_tree_prop_update(self, context):
  296. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  297. return # so we check if an update is currently running.
  298. self.is_updating = True
  299. node_group_update(self)
  300. self.is_updating = False
  301. if self.bl_idname in ['MantisSchemaGroup'] and self.node_tree is not None:
  302. if len(self.inputs) == 0:
  303. self.inputs.new("IntSocket", "Schema Length", identifier='Schema Length')
  304. if self.inputs[-1].bl_idname != "WildcardSocket":
  305. self.inputs.new("WildcardSocket", "", identifier="__extend__")
  306. from bpy.types import NodeCustomGroup
  307. class MantisNodeGroup(Node, MantisUINode):
  308. bl_idname = "MantisNodeGroup"
  309. bl_label = "Node Group"
  310. node_tree:PointerProperty(type=NodeTree, poll=poll_node_tree, update=node_tree_prop_update,)
  311. is_updating:BoolProperty(default=False)
  312. def update(self):
  313. live_update = self.id_data.do_live_update
  314. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  315. return # so we check if an update is currently running.
  316. try:
  317. self.is_updating = True
  318. node_group_update(self)
  319. self.is_updating = False
  320. finally: # we need to reset this regardless of whether or not the operation succeeds!
  321. self.is_updating = False
  322. self.id_data.do_live_update = live_update # ensure this remains the same
  323. def draw_buttons(self, context, layout):
  324. row = layout.row(align=True)
  325. row.prop(self, "node_tree", text="")
  326. row.operator("mantis.edit_group", text="", icon='NODETREE', emboss=True)
  327. class GraphError(Exception):
  328. pass
  329. def get_signature_from_edited_tree(node, context):
  330. sig_path=[None,]
  331. for item in context.space_data.path[:-1]:
  332. sig_path.append(item.node_tree.nodes.active.name)
  333. return tuple(sig_path+[node.name])
  334. def poll_node_tree_schema(self, object):
  335. if isinstance(object, SchemaTree):
  336. return True
  337. return False
  338. # TODO tiny UI problem - inserting new links into the tree will not place them in the right place.
  339. class SchemaGroup(Node, MantisUINode):
  340. bl_idname = "MantisSchemaGroup"
  341. bl_label = "Node Schema"
  342. node_tree:PointerProperty(type=NodeTree, poll=poll_node_tree_schema, update=node_tree_prop_update,)
  343. is_updating:BoolProperty(default=False)
  344. def draw_buttons(self, context, layout):
  345. row = layout.row(align=True)
  346. row.prop(self, "node_tree", text="")
  347. row.operator("mantis.edit_group", text="", icon='NODETREE', emboss=True)
  348. def update(self):
  349. live_update = self.id_data.do_live_update
  350. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  351. return # so we check if an update is currently running.
  352. self.is_updating = True
  353. try:
  354. node_group_update(self)
  355. # reset things if necessary:
  356. if self.node_tree:
  357. if len(self.inputs) == 0:
  358. self.inputs.new("IntSocket", "Schema Length", identifier='Schema Length')
  359. if self.inputs[-1].bl_idname != "WildcardSocket":
  360. self.inputs.new("WildcardSocket", "", identifier="__extend__")
  361. finally: # we need to reset this regardless of whether or not the operation succeeds!
  362. self.is_updating = False
  363. self.id_data.do_live_update = live_update # ensure this remains the same
  364. NODES_REMOVED=["xFormRootNode"]
  365. # Node bl_idname, # Socket Name
  366. SOCKETS_REMOVED=[("UtilityDriverVariable", "Transform Channel"),
  367. ("xFormRootNode","World Out"),
  368. ("UtilitySwitch","xForm"),
  369. ("LinkDrivenParameter", "Enable")]
  370. # Node Class #Prior bl_idname # prior name # new bl_idname # new name, # Multi
  371. SOCKETS_RENAMED=[ ("LinkDrivenParameter", "DriverSocket", "Driver", "FloatSocket", "Value", False)]
  372. # NODE CLASS NAME IN_OUT SOCKET TYPE SOCKET NAME INDEX MULTI DEFAULT
  373. SOCKETS_ADDED=[("DeformerMorphTargetDeform", 'INPUT', 'BooleanSocket', "Use Shape Key", 1, False, False),
  374. ("DeformerMorphTargetDeform", 'INPUT', 'BooleanSocket', "Use Offset", 2, False, True),
  375. ("UtilityFCurve", 'INPUT', "eFCrvExtrapolationMode", "Extrapolation Mode", 0, False, 'CONSTANT')]
  376. # replace names with bl_idnames for reading the tree and solving schemas.
  377. replace_types = ["NodeGroupInput", "NodeGroupOutput", "SchemaIncomingConnection",
  378. "SchemaArrayInput", "SchemaConstInput", "SchemaConstOutput", "SchemaIndex",
  379. "SchemaOutgoingConnection", "SchemaConstantOutput", "SchemaArrayOutput",
  380. "SchemaArrayInputGet",]
  381. # anything that gets properties added in the graph... this is a clumsy approach but I need to watch for this
  382. # in schema generation and this is the easiest way to do it for now.
  383. custom_props_types = ["LinkArmature", "UtilityKeyframe", "UtilityFCurve", "UtilityDriver", "xFormBone"]
  384. # filters for determining if a link is a hierarchy link or a non-hierarchy (cyclic) link.
  385. from_name_filter = ["Driver",]
  386. to_name_filter = [
  387. "Custom Object xForm Override",
  388. "Custom Object",
  389. "Deform Bones",
  390. ]
  391. class MantisNode:
  392. """
  393. This class contains the basic interface for a Mantis Node.
  394. A MantisNode is used internally by Mantis to represent the final evaluated node graph.
  395. It gets generated with data from a MantisUINode when the graph is read.
  396. """
  397. def __init__(self, signature, base_tree):
  398. self.base_tree=base_tree
  399. self.signature = signature
  400. self.inputs = MantisNodeSocketCollection(node=self, is_input=True)
  401. self.outputs = MantisNodeSocketCollection(node=self, is_input=False)
  402. self.parameters = {}
  403. self.drivers = {}
  404. self.node_type='UNINITIALIZED'
  405. self.hierarchy_connections, self.connections = [], []
  406. self.hierarchy_dependencies, self.dependencies = [], []
  407. self.prepared = False
  408. self.executed = False
  409. def init_parameters(self, additional_parameters = {}):
  410. for socket in self.inputs:
  411. self.parameters[socket.name] = None
  412. for socket in self.outputs:
  413. self.parameters[socket.name] = None
  414. for key, value in additional_parameters.items():
  415. self.parameters[key]=value
  416. def set_traverse(self, traversal_pairs = [(str, str)]):
  417. for (a, b) in traversal_pairs:
  418. self.inputs[a].set_traverse_target(self.outputs[b])
  419. self.outputs[b].set_traverse_target(self.inputs[a])
  420. def flush_links(self):
  421. for inp in self.inputs.values():
  422. inp.flush_links()
  423. for out in self.outputs.values():
  424. out.flush_links()
  425. def evaluate_input(self, input_name, index=0):
  426. from .node_container_common import trace_single_line
  427. if not (self.inputs.get(input_name)): # get the named parameter if there is no input
  428. return self.parameters.get(input_name) # this will return None if the parameter does not exist.
  429. # this trace() should give a key error if there is a problem
  430. # it is NOT handled here because it should NOT happen - so I want the error message.
  431. trace = trace_single_line(self, input_name, index)
  432. prop = trace[0][-1].parameters[trace[1].name] #trace[0] = the list of traced nodes; read its parameters
  433. return prop
  434. def fill_parameters(self, ui_node=None):
  435. from .utilities import get_node_prototype
  436. from .node_container_common import get_socket_value
  437. if not ui_node:
  438. if ( (self.signature[0] in ["MANTIS_AUTOGENERATED", "SCHEMA_AUTOGENERATED" ]) or
  439. (self.signature[-1] in ["NodeGroupOutput", "NodeGroupInput"]) ): # I think this is harmless
  440. return None
  441. else:
  442. ui_node = get_node_prototype(self.signature, self.base_tree)
  443. if not ui_node:
  444. raise RuntimeError(wrapRed("No node prototype found for... %s" % ( [self.base_tree] + list(self.signature[1:]) ) ) )
  445. for key in self.parameters.keys():
  446. node_socket = ui_node.inputs.get(key)
  447. if self.parameters[key] is not None: # the parameters are usually initialized as None.
  448. continue # will be filled by the node itself
  449. if not node_socket: #maybe the node socket has no name
  450. if ( ( len(ui_node.inputs) == 0) and ( len(ui_node.outputs) == 1) ):
  451. # this is a simple input node.
  452. node_socket = ui_node.outputs[0]
  453. elif key == 'Name': # for Links we just use the Node Label, or if there is no label, the name.
  454. self.parameters[key] = ui_node.label if ui_node.label else ui_node.name
  455. continue
  456. else:
  457. pass
  458. if node_socket:
  459. if node_socket.bl_idname in ['RelationshipSocket', 'xFormSocket']:
  460. continue
  461. elif node_socket.is_linked and (not node_socket.is_output):
  462. pass # we will get the value from the link, because this is a linked input port.
  463. # very importantly, we do not pass linked outputs- fill these because they are probably Input nodes.
  464. elif hasattr(node_socket, "default_value"):
  465. if (value := get_socket_value(node_socket)) is not None:
  466. self.parameters[key] = value
  467. # TODO: try and remove the input if it is not needed (for performance speed)
  468. else:
  469. raise RuntimeError(wrapRed("No value found for " + self.__repr__() + " when filling out node parameters for " + ui_node.name + "::"+node_socket.name))
  470. else:
  471. pass
  472. def call_on_all_ancestors(self, *args, **kwargs):
  473. """Resolve the dependencies of this node with the named method and its arguments.
  474. First, dependencies are discovered by walking backwards through the tree. Once the root
  475. nodes are discovered, the method is called by each node in dependency order.
  476. The first argument MUST be the name of the method as a string.
  477. """
  478. prGreen(self)
  479. if args[0] == 'call_on_all_ancestors': raise RuntimeError("Very funny!")
  480. from .utilities import get_all_dependencies
  481. from collections import deque
  482. # get all dependencies by walking backward through the tree.
  483. all_dependencies = get_all_dependencies(self)
  484. # get just the roots
  485. can_solve = deque(filter(lambda a : len(a.hierarchy_connections) == 0, all_dependencies))
  486. solved = set()
  487. while can_solve:
  488. node = can_solve.pop()
  489. print(node)
  490. method = getattr(node, args[0])
  491. method(*args[0:], **kwargs)
  492. solved.add(node)
  493. can_solve.extendleft(filter(lambda a : a in all_dependencies, node.hierarchy_connections))
  494. # prPurple(can_solve)
  495. if self in solved:
  496. break
  497. # else:
  498. # for dep in all_dependencies:
  499. # if dep not in solved:
  500. # prOrange(dep)
  501. return
  502. def bPrepare(self, bContext=None):
  503. return
  504. def bExecute(self, bContext=None):
  505. return
  506. def bFinalize(self, bContext=None):
  507. return
  508. def __repr__(self):
  509. return self.signature.__repr__()
  510. # do I need this and the link class above?
  511. class DummyLink:
  512. #gonna use this for faking links to keep the interface consistent
  513. def __init__(self, from_socket, to_socket, nc_from=None, nc_to=None, original_from=None, multi_input_sort_id=0):
  514. self.from_socket = from_socket
  515. self.to_socket = to_socket
  516. self.nc_from = nc_from
  517. self.nc_to = nc_to
  518. self.multi_input_sort_id = multi_input_sort_id
  519. # self.from_node = from_socket.node
  520. # self.to_node = to_socket.node
  521. if (original_from):
  522. self.original_from = original_from
  523. else:
  524. self.original_from = self.from_socket
  525. def __repr__(self):
  526. return(self.nc_from.__repr__()+":"+self.from_socket.name + " -> " + self.nc_to.__repr__()+":"+self.to_socket.name)
  527. def detect_hierarchy_link(from_node, from_socket, to_node, to_socket,):
  528. if to_node.node_type in ['DUMMY_SCHEMA', 'SCHEMA']:
  529. return False
  530. if (from_socket in from_name_filter) or (to_socket in to_name_filter):
  531. return False
  532. # if from_node.__class__.__name__ in ["UtilityCombineVector", "UtilityCombineThreeBool"]:
  533. # return False
  534. return True
  535. class NodeLink:
  536. from_node = None
  537. from_socket = None
  538. to_node = None
  539. to_socket = None
  540. def __init__(self, from_node, from_socket, to_node, to_socket, multi_input_sort_id=0):
  541. if from_node.signature == to_node.signature:
  542. raise RuntimeError("Cannot connect a node to itself.")
  543. self.from_node = from_node
  544. self.from_socket = from_socket
  545. self.to_node = to_node
  546. self.to_socket = to_socket
  547. self.from_node.outputs[self.from_socket].links.append(self)
  548. # it is the responsibility of the node that uses these links to sort them correctly based on the sort_id
  549. self.multi_input_sort_id = multi_input_sort_id
  550. self.to_node.inputs[self.to_socket].links.append(self)
  551. self.is_hierarchy = detect_hierarchy_link(from_node, from_socket, to_node, to_socket,)
  552. self.is_alive = True
  553. def __repr__(self):
  554. return self.from_node.outputs[self.from_socket].__repr__() + " --> " + self.to_node.inputs[self.to_socket].__repr__()
  555. # link_string = # if I need to colorize output for debugging.
  556. # if self.is_hierarchy:
  557. # return wrapOrange(link_string)
  558. # else:
  559. # return wrapWhite(link_string)
  560. def die(self):
  561. self.is_alive = False
  562. self.to_node.inputs[self.to_socket].flush_links()
  563. self.from_node.outputs[self.from_socket].flush_links()
  564. def insert_node(self, middle_node, middle_node_in, middle_node_out, re_init_hierarchy = True):
  565. to_node = self.to_node
  566. to_socket = self.to_socket
  567. self.to_node = middle_node
  568. self.to_socket = middle_node_in
  569. middle_node.outputs[middle_node_out].connect(to_node, to_socket)
  570. if re_init_hierarchy:
  571. from .utilities import init_connections, init_dependencies
  572. init_connections(self.from_node)
  573. init_connections(middle_node)
  574. init_dependencies(middle_node)
  575. init_dependencies(to_node)
  576. class NodeSocket:
  577. # @property # this is a read-only property.
  578. # def is_linked(self):
  579. # return bool(self.links)
  580. def __init__(self, is_input = False,
  581. node = None, name = None,
  582. traverse_target = None):
  583. self.can_traverse = False # to/from the other side of the parent node
  584. self.traverse_target = None
  585. self.node = node
  586. self.name = name
  587. self.is_input = is_input
  588. self.links = []
  589. self.is_linked = False
  590. if (traverse_target):
  591. self.can_traverse = True
  592. def connect(self, node, socket, sort_id=0):
  593. if (self.is_input):
  594. to_node = self.node; from_node = node
  595. to_socket = self.name; from_socket = socket
  596. else:
  597. from_node = self.node; to_node = node
  598. from_socket = self.name; to_socket = socket
  599. from_node.outputs[from_socket].is_linked = True
  600. to_node.inputs[to_socket].is_linked = True
  601. for l in from_node.outputs[from_socket].links:
  602. if l.to_node==to_node and l.to_socket==to_socket:
  603. return None
  604. new_link = NodeLink(
  605. from_node,
  606. from_socket,
  607. to_node,
  608. to_socket,
  609. sort_id)
  610. return new_link
  611. def set_traverse_target(self, traverse_target):
  612. self.traverse_target = traverse_target
  613. self.can_traverse = True
  614. def flush_links(self):
  615. """ Removes dead links from this socket."""
  616. self.links = [l for l in self.links if l.is_alive]
  617. self.is_linked = bool(self.links)
  618. @property
  619. def is_connected(self):
  620. return len(self.links)>0
  621. def __repr__(self):
  622. return self.node.__repr__() + "::" + self.name
  623. class MantisNodeSocketCollection(dict):
  624. def __init__(self, node, is_input=False):
  625. self.is_input = is_input
  626. self.node = node
  627. def init_sockets(self, sockets):
  628. for socket in sockets:
  629. if isinstance(socket, str):
  630. self[socket] = NodeSocket(is_input=self.is_input, name=socket, node=self.node)
  631. elif isinstance(socket, MantisSocketTemplate):
  632. if socket.is_input != self.is_input: continue
  633. self[socket.name] = NodeSocket(is_input=self.is_input, name=socket.name, node=self.node)
  634. else:
  635. raise RuntimeError("NodeSocketCollection keys must be str.")
  636. def __delitem__(self, key):
  637. """Deletes a node socket by name, and all its links."""
  638. socket = self[key]
  639. for l in socket.links:
  640. l.die()
  641. super().__delitem__(key)
  642. def __iter__(self):
  643. """Makes the class iterable"""
  644. return iter(self.values())
  645. # The Mantis Solver class is used to store the execution-specific variables that are used
  646. # when executing the tree
  647. class MantisSolver():
  648. pass
  649. # GOAL: make the switch to "group overlay" paradigm