base_definitions.py 49 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132
  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. links_sort_key= lambda a : (-a.multi_input_sort_id, -a.sub_sort_id)
  14. def TellClasses():
  15. #Why use a function to do this? Because I don't need every class to register.
  16. return [ MantisTree,
  17. SchemaTree,
  18. MantisNodeGroup,
  19. SchemaGroup,
  20. ]
  21. def error_popup_draw(self, context):
  22. self.layout.label(text="Error executing tree. See Console.")
  23. mantis_root = ".".join(__name__.split('.')[:-1]) # absolute HACK
  24. from os import environ
  25. # https://docs.blender.org/api/master/bpy.types.NodeTree.html#bpy.types.NodeTree.valid_socket_type
  26. # thank you, Sverchok
  27. def valid_interface_types(cls : NodeTree, socket_idname : str):
  28. from .socket_definitions import tell_valid_bl_idnames, TellClasses
  29. #TODO: do the versioning code to handle this so it can be in all versions
  30. if bpy.app.version <= (4,4,0): # should work in 4.4.1
  31. return socket_idname in [cls.bl_idname for cls in TellClasses()]
  32. elif bpy.app.version == (4,5,0): # workaround for a BUG
  33. return ['NodeSocketGeometry']
  34. else: # once versioning is finished this will be unnecesary.
  35. return socket_idname in tell_valid_bl_idnames()
  36. def fix_reroute_colors(tree):
  37. context = bpy.context
  38. if any((tree.is_executing, tree.is_exporting, tree.do_live_update==False, context.space_data is None) ):
  39. return
  40. from collections import deque
  41. from .utilities import socket_seek
  42. from .socket_definitions import MantisSocket
  43. reroutes_without_color = deque()
  44. for n in tree.nodes:
  45. if n.bl_idname=='NodeReroute' and n.inputs[0].bl_idname == "NodeSocketColor":
  46. reroutes_without_color.append(n)
  47. try:
  48. while reroutes_without_color:
  49. rr = reroutes_without_color.pop()
  50. if rr.inputs[0].is_linked:
  51. link = rr.inputs[0].links[0]
  52. socket = socket_seek(link, tree.links)
  53. if isinstance(socket, MantisSocket):
  54. rr.socket_idname = socket.bl_idname
  55. except Exception as e:
  56. print(wrapOrange("WARN: Updating reroute color failed with exception: ")+wrapWhite(f"{e.__class__.__name__}"))
  57. #functions to identify the state of the system using hashes
  58. # this function runs a lot so it should be optimized as well as possible.
  59. def hash_tree(tree):
  60. trees=set(); links=[]; hash_data=""
  61. for node in tree.nodes:
  62. hash_data+=str(node.name)
  63. if hasattr(node, 'node_tree') and node.node_tree:
  64. trees.add(node.node_tree)
  65. for other_tree in trees:
  66. hash_data+=str(hash_tree(other_tree))
  67. for link in tree.links:
  68. links.append( link.from_node.name+link.from_socket.name+
  69. link.to_node.name+link.to_socket.name+
  70. str(link.multi_input_sort_id) )
  71. links.sort(); hash_data+=''.join(links)
  72. return hash(hash_data)
  73. MANTIS_VERSION_MAJOR=0
  74. MANTIS_VERSION_MINOR=12
  75. MANTIS_VERSION_SUB=27
  76. class MantisTree(NodeTree):
  77. '''A custom node tree type that will show up in the editor type list'''
  78. bl_idname = 'MantisTree'
  79. bl_label = "Rigging Nodes"
  80. bl_icon = 'OUTLINER_OB_ARMATURE'
  81. tree_valid:BoolProperty(default=False)
  82. hash:StringProperty(default='')
  83. do_live_update:BoolProperty(default=True) # use this to disable updates for e.g. scripts
  84. num_links:IntProperty(default=-1)
  85. # operator settings for re-exporting the tree.
  86. filepath:StringProperty(default="", subtype='FILE_PATH')
  87. export_all_subtrees_together:BoolProperty(default=True)
  88. #
  89. is_executing:BoolProperty(default=False)
  90. is_exporting:BoolProperty(default=False)
  91. execution_id:StringProperty(default='')
  92. # prev_execution_id:StringProperty(default='')
  93. mantis_version:IntVectorProperty(default=[
  94. MANTIS_VERSION_MAJOR, MANTIS_VERSION_MINOR, MANTIS_VERSION_SUB])
  95. # this prevents the node group from executing on the next depsgraph update
  96. # because I don't always have control over when the dg upadte happens.
  97. prevent_next_exec:BoolProperty(default=False)
  98. #added to work around a bug in 4.5.0 LTS
  99. interface_helper : StringProperty(default='')
  100. parsed_tree={}
  101. if (bpy.app.version < (4, 4, 0) or bpy.app.version >= (4,5,0)): # in 4.4 this leads to a crash
  102. @classmethod
  103. def valid_socket_type(cls : NodeTree, socket_idname: str):
  104. return valid_interface_types(cls, socket_idname)
  105. def update(self): # set the reroute colors
  106. if (bpy.app.version >= (4,4,0)):
  107. fix_reroute_colors(self)
  108. def update_tree(self, context = None, force=False, error_popups=False):
  109. if self.is_exporting:
  110. return
  111. my_hash = str( hash_tree(self) )
  112. if (my_hash != self.hash) or force:
  113. self.hash = my_hash
  114. self.is_executing = True
  115. from . import readtree
  116. prGreen("Validating Tree: %s" % self.name)
  117. try:
  118. import bpy # I am importing here so that the context passed in
  119. # is used for display update... but I always want to do this
  120. scene = bpy.context.scene
  121. scene.render.use_lock_interface = True
  122. self.parsed_tree = readtree.parse_tree(self, error_popups)
  123. if context:
  124. self.display_update(context)
  125. self.tree_valid = True
  126. except Exception as e:
  127. prRed("Failed to update node tree due to error.")
  128. self.tree_valid = False
  129. self.hash='' # unset the hash to mark the tree as un-parsed.
  130. raise e
  131. finally:
  132. scene.render.use_lock_interface = False
  133. self.is_executing = False
  134. def display_update(self, context):
  135. if self.is_exporting:
  136. return
  137. self.is_executing = True
  138. current_tree = bpy.context.space_data.path[-1].node_tree
  139. for node in current_tree.nodes:
  140. if hasattr(node, "display_update"):
  141. try:
  142. node.display_update(self.parsed_tree, context)
  143. except Exception as e:
  144. print("Node \"%s\" failed to update display with error: %s" %(wrapGreen(node.name), wrapRed(e)))
  145. self.is_executing = False
  146. # TODO: deal with invalid links properly.
  147. # - Non-hierarchy links should be ignored in the circle-check and so the links should be marked valid in such a circle
  148. # - hierarchy-links should be marked invalid and prevent the tree from executing.
  149. def execute_tree(self,context, error_popups = False):
  150. self.prevent_next_exec = False
  151. if not self.hash:
  152. return
  153. if self.is_exporting or self.is_executing:
  154. return
  155. prGreen("Executing Tree: %s" % self.name)
  156. self.is_executing = True
  157. from . import readtree
  158. try:
  159. context.scene.render.use_lock_interface = True
  160. readtree.execute_tree(self.parsed_tree, self, context, error_popups)
  161. except RecursionError as e:
  162. prRed("Recursion error while parsing tree.")
  163. finally:
  164. context.scene.render.use_lock_interface = False
  165. self.is_executing = False
  166. class SchemaTree(NodeTree):
  167. '''A node tree representing a schema to generate a Mantis tree'''
  168. bl_idname = 'SchemaTree'
  169. bl_label = "Rigging Nodes Schema"
  170. bl_icon = 'RIGID_BODY_CONSTRAINT'
  171. # these are only needed for consistent interface, but should not be used
  172. do_live_update:BoolProperty(default=True) # default to true so that updates work
  173. is_executing:BoolProperty(default=False)
  174. is_exporting:BoolProperty(default=False)
  175. mantis_version:IntVectorProperty(default=[
  176. MANTIS_VERSION_MAJOR, MANTIS_VERSION_MINOR, MANTIS_VERSION_SUB])
  177. # see the note in MantisTree
  178. interface_helper : StringProperty(default='')
  179. if (bpy.app.version < (4, 4, 0) or bpy.app.version >= (4,5,0)): # in 4.4 this leads to a crash
  180. @classmethod
  181. def valid_socket_type(cls : NodeTree, socket_idname: str):
  182. return valid_interface_types(cls, socket_idname)
  183. def update(self): # set the reroute colors
  184. if (bpy.app.version >= (4,4,0)):
  185. fix_reroute_colors(self)
  186. from dataclasses import dataclass, field
  187. from typing import Any
  188. @dataclass
  189. class MantisSocketTemplate():
  190. name : str = field(default="")
  191. bl_idname : str = field(default="")
  192. traverse_target : str = field(default="")
  193. identifier : str = field(default="")
  194. display_shape : str = field(default="") # for arrays
  195. category : str = field(default="") # for use in display update
  196. blender_property : str | tuple[str] = field(default="") # for props_sockets -> evaluate sockets
  197. is_input : bool = field(default=False)
  198. hide : bool = field(default=False)
  199. use_multi_input : bool = field(default=False)
  200. default_value : Any = field(default=None)
  201. #TODO: do a better job explaining how MantisNode and MantisUINode relate.
  202. class MantisUINode:
  203. """
  204. This class contains the common user-interface features of Mantis nodes.
  205. MantisUINode objects will spawn one or more MantisNode objects when the graph is evaluated.
  206. The MantisNode objects will pull the data from the UI node and use it to generate the graph.
  207. """
  208. mantis_node_library=''
  209. mantis_node_class_name=''
  210. mantis_class=None
  211. @classmethod
  212. def poll(cls, ntree):
  213. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  214. @classmethod
  215. def set_mantis_class(self):
  216. from importlib import import_module
  217. # do not catch errors, they should cause a failure.
  218. try:
  219. module = import_module(self.mantis_node_library, package=mantis_root)
  220. self.mantis_class=getattr(module, self.mantis_node_class_name)
  221. except Exception as e:
  222. print(self)
  223. raise e
  224. def insert_link(self, link):
  225. if (bpy.app.version >= (4, 4, 0)):
  226. return # this causes a crash due to a bug.
  227. context = bpy.context
  228. if context.space_data:
  229. node_tree = context.space_data.path[0].node_tree
  230. if node_tree.do_live_update:
  231. node_tree.update_tree(context)
  232. if (link.to_socket.is_linked == False):
  233. node_tree.num_links+=1
  234. elif (link.to_socket.is_multi_input):
  235. node_tree.num_links+=1
  236. def init_sockets(self, socket_templates : tuple[MantisSocketTemplate]):
  237. for template in socket_templates:
  238. collection = self.outputs
  239. if template.is_input:
  240. collection = self.inputs
  241. identifier = template.name
  242. if template.identifier:
  243. identifier = template.identifier
  244. use_multi_input = template.use_multi_input if template.is_input else False
  245. socket = collection.new(
  246. template.bl_idname,
  247. template.name,
  248. identifier=identifier,
  249. use_multi_input=use_multi_input
  250. )
  251. socket.hide= template.hide
  252. if template.category:
  253. # a custom property for the UI functions to use.
  254. socket['category'] = template.category
  255. if template.default_value is not None:
  256. socket.default_value = template.default_value
  257. # this can throw a TypeError - it is the caller's
  258. # responsibility to send the right type.
  259. if template.use_multi_input: # this is an array
  260. socket.display_shape = 'SQUARE_DOT'
  261. class SchemaUINode(MantisUINode):
  262. mantis_node_library='.schema_nodes'
  263. is_updating:BoolProperty(default=False)
  264. @classmethod
  265. def poll(cls, ntree):
  266. return (ntree.bl_idname in ['SchemaTree'])
  267. class LinkNode(MantisUINode):
  268. mantis_node_library='.link_nodes'
  269. @classmethod
  270. def poll(cls, ntree):
  271. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  272. class xFormNode(MantisUINode):
  273. mantis_node_library='.xForm_nodes'
  274. @classmethod
  275. def poll(cls, ntree):
  276. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  277. class DeformerNode(MantisUINode):
  278. mantis_node_library='.deformer_nodes'
  279. @classmethod
  280. def poll(cls, ntree):
  281. return (ntree.bl_idname in ['MantisTree', 'SchemaTree'])
  282. def poll_node_tree(self, object):
  283. forbid = []
  284. context = bpy.context
  285. if context.space_data:
  286. if context.space_data.path:
  287. for path_item in context.space_data.path:
  288. forbid.append(path_item.node_tree.name)
  289. if isinstance(object, MantisTree) and object.name not in forbid:
  290. return True
  291. return False
  292. # TODO: try and remove the extra loop used here... but it is OK for now
  293. def should_remove_socket(node, socket):
  294. # a function to check if the socket is in the interface
  295. id_found = False
  296. for item in node.node_tree.interface.items_tree:
  297. if item.item_type != "SOCKET": continue
  298. if item.identifier == socket.identifier:
  299. id_found = True; break
  300. return not id_found
  301. # TODO: try to check identifiers instead of name.
  302. def node_group_update(node, force = False):
  303. if not node.is_updating:
  304. raise RuntimeError("Cannot update node while it is not marked as updating.")
  305. if not force:
  306. if (node.id_data.do_live_update == False) or \
  307. (node.id_data.is_executing == True) or \
  308. (node.id_data.is_exporting == True):
  309. return
  310. # note: if (node.id_data.is_exporting == True) I need to be able to update so I can make links.
  311. if node.node_tree is None:
  312. node.inputs.clear(); node.outputs.clear()
  313. return
  314. toggle_update = node.id_data.do_live_update
  315. node.id_data.do_live_update = False
  316. identifiers_in={socket.identifier:socket for socket in node.inputs}
  317. identifiers_out={socket.identifier:socket for socket in node.outputs}
  318. interface_names_in, interface_names_out = {}, {}
  319. for interface_item in node.node_tree.interface.items_tree:
  320. if interface_item.item_type != 'SOCKET': continue
  321. if interface_item.in_out == 'INPUT':
  322. interface_names_in[interface_item.identifier] = interface_item.name
  323. else:
  324. interface_names_out[interface_item.identifier] = interface_item.name
  325. indices_in,indices_out={},{} # check by INDEX to see if the socket's name/type match.
  326. for collection, map in [(node.inputs, indices_in), (node.outputs, indices_out)]:
  327. for i, socket in enumerate(collection):
  328. map[socket.identifier]=i
  329. if node.node_tree is None:
  330. node.inputs.clear(); node.outputs.clear()
  331. node.id_data.do_live_update = toggle_update
  332. return
  333. found_in, found_out = [], []
  334. update_input, update_output = False, False
  335. for item in node.node_tree.interface.items_tree:
  336. if item.item_type != "SOCKET": continue
  337. if item.in_out == 'OUTPUT':
  338. if s:= identifiers_out.get(item.identifier): # if the requested output doesn't exist, update
  339. if interface_names_out.get(item.identifier) != s.name: update_output = True; continue
  340. found_out.append(item.identifier)
  341. if (indices_out[s.identifier]!=item.index): update_output=True; continue
  342. if update_output: continue
  343. if s.bl_idname != item.bl_socket_idname: update_output = True; continue
  344. else: update_output = True; continue
  345. else:
  346. if s:= identifiers_in.get(item.identifier): # if the requested input doesn't exist, update
  347. if interface_names_in.get(item.identifier) != s.name: update_input = True; continue
  348. found_in.append(item.identifier)
  349. if (indices_in[s.identifier]!=item.index): update_input=True; continue
  350. if update_input: continue # done here
  351. if s.bl_idname != item.bl_socket_idname: update_input = True; continue
  352. else: update_input = True; continue
  353. # Schema has an extra input for Length and for Extend.
  354. if node.bl_idname == 'MantisSchemaGroup':
  355. found_in.extend(['Schema Length', ''])
  356. # get the socket maps before modifying stuff
  357. if update_input or update_output:
  358. socket_maps = get_socket_maps(node,)
  359. if socket_maps:
  360. socket_map_in, socket_map_out = socket_maps
  361. if node.bl_idname == "MantisSchemaGroup" and \
  362. len(node.inputs)+len(node.outputs)<=2 and\
  363. len(node.node_tree.interface.items_tree) > 0:
  364. socket_map_in, socket_map_out = None, None
  365. # We have to initialize the node because it only has its base inputs.
  366. elif socket_maps is None:
  367. node.id_data.do_live_update = toggle_update
  368. # if we have too many elements, just get rid of the ones we don't need
  369. if len(node.inputs) > len(found_in):#
  370. for inp in node.inputs:
  371. if inp.identifier in found_in: continue
  372. node.inputs.remove(inp)
  373. if len(node.outputs) > len(found_out):
  374. for out in node.outputs:
  375. if out.identifier in found_out: continue
  376. node.outputs.remove(out)
  377. #
  378. if len(node.inputs) > 0 and (inp := node.inputs[-1]).bl_idname == 'WildcardSocket' and inp.is_linked:
  379. update_input = True
  380. #
  381. if not (update_input or update_output):
  382. node.id_data.do_live_update = toggle_update
  383. return
  384. if update_input or update_output and (socket_maps is not None):
  385. if update_input :
  386. if node.bl_idname == 'MantisSchemaGroup':
  387. schema_length=0
  388. if sl := node.inputs.get("Schema Length"):
  389. schema_length = sl.default_value
  390. # sometimes this isn't available yet # TODO not happy about this solution
  391. remove_me=[]
  392. # remove all found map items but the Schema Length input (reuse it)
  393. for i, socket in enumerate(node.inputs):
  394. if socket.identifier == "Schema Length" and i == 0:
  395. continue
  396. elif (socket_map_in is None) or socket.identifier in socket_map_in.keys():
  397. remove_me.append(socket)
  398. elif should_remove_socket(node, socket):
  399. remove_me.append(socket)
  400. while remove_me:
  401. node.inputs.remove(remove_me.pop())
  402. if update_output:
  403. remove_me=[]
  404. for socket in node.outputs:
  405. if (socket_map_out is None) or socket.identifier in socket_map_out.keys():
  406. remove_me.append(socket)
  407. elif should_remove_socket(node, socket):
  408. remove_me.append(socket)
  409. while remove_me:
  410. node.inputs.remove(remove_me.pop())
  411. from .utilities import relink_socket_map_add_socket
  412. reorder_me_input = []; input_index = 0
  413. reorder_me_output = []; output_index = 0
  414. def update_group_sockets(interface_item, is_input):
  415. socket_map = socket_map_in if is_input else socket_map_out
  416. socket_collection = node.inputs if is_input else node.outputs
  417. counter = input_index if is_input else output_index
  418. reorder_collection = reorder_me_input if is_input else reorder_me_output
  419. if socket_map:
  420. if item.identifier in socket_map.keys():
  421. socket = relink_socket_map_add_socket(node, socket_collection, item, item.in_out)
  422. do_relink(node, socket, socket_map, item.in_out)
  423. else:
  424. for has_socket in socket_collection:
  425. if has_socket.bl_idname == item.bl_socket_idname and \
  426. has_socket.name == item.name:
  427. reorder_collection.append((has_socket, counter))
  428. break
  429. else:
  430. socket = relink_socket_map_add_socket(node, socket_collection, item, item.in_out)
  431. else:
  432. socket = relink_socket_map_add_socket(node, socket_collection, item, item.in_out)
  433. counter += 1
  434. # TODO: de-duplicate this hideous stuff
  435. for item in node.node_tree.interface.items_tree:
  436. if item.item_type != "SOCKET": continue
  437. if (item.in_out == 'INPUT' and update_input):
  438. # check and see if it exists... should only happen in curves on startup
  439. if item.bl_socket_idname in ['EnumCurveSocket']:
  440. for exists in node.inputs: # NOTE: check if the socket was not deleted
  441. if exists.identifier == item.identifier:
  442. # this happens for curve inputs because of some shennanigans with how
  443. # blender loads IDs - I can't set the ID until the file has loaded
  444. # so I have to avoid touching the socket until then...
  445. break
  446. else:
  447. update_group_sockets(item, True)
  448. else:
  449. update_group_sockets(item, True)
  450. input_index += 1
  451. if (item.in_out == 'OUTPUT' and update_output):
  452. if item.bl_socket_idname in ['EnumCurveSocket']: # LOOK up there at the comment!
  453. for exists in node.outputs:
  454. if exists.identifier == item.identifier:
  455. break
  456. else:
  457. update_group_sockets(item, False)
  458. else:
  459. update_group_sockets(item, False)
  460. output_index += 1
  461. both_reorders = zip([reorder_me_input, reorder_me_output], [node.inputs, node.outputs])
  462. for reorder_task, collection in both_reorders:
  463. for socket, position in reorder_task:
  464. for i, s in enumerate(collection): # get the index
  465. if s.identifier == socket.identifier: break
  466. else:
  467. prRed(f"WARN: could not reorder socket {socket.name}")
  468. to_index = position
  469. if (not socket.is_output) and node.bl_idname == "MantisSchemaGroup":
  470. to_index+=1
  471. collection.move(i, to_index)
  472. # at this point there is no wildcard socket
  473. if socket_map_in and '__extend__' in socket_map_in.keys():
  474. do_relink(node, None, socket_map_in, in_out='INPUT', parent_name='Constant' )
  475. node.id_data.do_live_update = toggle_update
  476. def node_tree_prop_update(self, context):
  477. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  478. return # so we check if an update is currently running.
  479. self.is_updating = True
  480. def init_schema(self, context):
  481. if len(self.inputs) == 0:
  482. self.inputs.new("UnsignedIntSocket", "Schema Length", identifier='Schema Length')
  483. if self.inputs[-1].bl_idname != "WildcardSocket":
  484. self.inputs.new("WildcardSocket", "", identifier="__extend__")
  485. init_schema(self, context)
  486. try:
  487. node_group_update(self, force=True)
  488. finally: # ensure this line is run even if there is an error
  489. self.is_updating = False
  490. if self.bl_idname in ['MantisSchemaGroup'] and self.node_tree is not None:
  491. init_schema(self, context)
  492. from bpy.types import NodeCustomGroup
  493. def group_draw_buttons(self, context, layout):
  494. row = layout.row(align=True)
  495. row.prop(self, "node_tree", text="")
  496. if self.node_tree is None:
  497. row.operator("mantis.new_node_tree", text="", icon='PLUS', emboss=True)
  498. else:
  499. row.operator("mantis.edit_group", text="", icon='NODETREE', emboss=True)
  500. class MantisNodeGroup(Node, MantisUINode):
  501. bl_idname = "MantisNodeGroup"
  502. bl_label = "Node Group"
  503. node_tree:PointerProperty(type=NodeTree, poll=poll_node_tree, update=node_tree_prop_update,)
  504. is_updating:BoolProperty(default=False)
  505. def draw_label(self):
  506. if self.node_tree is None:
  507. return "Node Group"
  508. else:
  509. return self.node_tree.name
  510. def draw_buttons(self, context, layout):
  511. group_draw_buttons(self, context, layout)
  512. def update(self):
  513. if self.node_tree is None:
  514. return
  515. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  516. return # so we check if an update is currently running.
  517. live_update = self.id_data.do_live_update
  518. self.is_updating = True
  519. try:
  520. node_group_update(self)
  521. finally: # we need to reset this regardless of whether or not the operation succeeds!
  522. self.is_updating = False
  523. self.id_data.do_live_update = live_update # ensure this remains the same
  524. class GraphError(Exception):
  525. pass
  526. def get_signature_from_edited_tree(node, context):
  527. sig_path=[None,]
  528. for item in context.space_data.path[:-1]:
  529. sig_path.append(item.node_tree.nodes.active.name)
  530. return tuple(sig_path+[node.name])
  531. def poll_node_tree_schema(self, object):
  532. if isinstance(object, SchemaTree):
  533. return True
  534. return False
  535. # TODO tiny UI problem - inserting new links into the tree will not place them in the right place.
  536. class SchemaGroup(Node, MantisUINode):
  537. bl_idname = "MantisSchemaGroup"
  538. bl_label = "Node Schema"
  539. node_tree:PointerProperty(type=NodeTree, poll=poll_node_tree_schema, update=node_tree_prop_update,)
  540. is_updating:BoolProperty(default=False)
  541. def draw_buttons(self, context, layout):
  542. group_draw_buttons(self, context, layout)
  543. def draw_label(self):
  544. if self.node_tree is None:
  545. return "Schema Group"
  546. else:
  547. return self.node_tree.name
  548. def update(self):
  549. if self.is_updating: # update() can be called from update() and that leads to an infinite loop.
  550. return # so we check if an update is currently running.
  551. if self.node_tree is None:
  552. return
  553. live_update = self.id_data.do_live_update
  554. self.is_updating = True
  555. try:
  556. node_group_update(self)
  557. # reset things if necessary:
  558. if self.node_tree:
  559. if len(self.inputs) == 0:
  560. self.inputs.new("UnsignedIntSocket", "Schema Length", identifier='Schema Length')
  561. if self.inputs[-1].identifier != "__extend__":
  562. self.inputs.new("WildcardSocket", "", identifier="__extend__")
  563. finally: # we need to reset this regardless of whether or not the operation succeeds!
  564. self.is_updating = False
  565. self.id_data.do_live_update = live_update # ensure this remains the same
  566. # replace names with bl_idnames for reading the tree and solving schemas.
  567. replace_types = ["NodeGroupInput", "NodeGroupOutput", "SchemaIncomingConnection",
  568. "SchemaArrayInput", "SchemaArrayInputAll", "SchemaConstInput", "SchemaConstOutput",
  569. "SchemaIndex", "SchemaOutgoingConnection", "SchemaArrayOutput","SchemaArrayInputGet",
  570. ]
  571. # anything that gets properties added in the graph... this is a clumsy approach but I need to watch for this
  572. # in schema generation and this is the easiest way to do it for now.
  573. custom_props_types = ["LinkArmature", "UtilityKeyframe", "UtilityFCurve", "UtilityDriver", "xFormBone"]
  574. # filters for determining if a link is a hierarchy link or a non-hierarchy (cyclic) link.
  575. from_name_filter = ["Driver",]
  576. to_name_filter = [
  577. "Custom Object xForm Override",
  578. "Custom Object",
  579. "Deform Bones",
  580. ]
  581. # nodes that must be solved as if they were Schema because they send arrays out.
  582. array_output_types = [
  583. 'UtilityArrayGet', 'UtilityKDChoosePoint', 'UtilityKDChooseXForm',
  584. ]
  585. def can_remove_socket_for_autogen(node, socket) -> bool:
  586. """ Whether to enable socket removal optimization for the socket
  587. This should be disallowed if e.g. it is a custom property.
  588. """
  589. return False # for now! This doesn't seem to be working...
  590. # the problem is that Schema does this, and so does Readtree
  591. # and they can try and both do it. That's bad.
  592. if node.socket_templates:
  593. for s_template in node.socket_templates:
  594. if s_template.name == socket:
  595. # raise NotImplementedError
  596. return True
  597. elif node.node_type == 'UTILITY':
  598. return True # HACK because most utilities don't have socket templates yet
  599. return False
  600. # TODO:
  601. # - get the execution context in the execution code
  602. # - from there, begin to use it for stuff I can't do without it
  603. # - and slowly start transferring stuff to it
  604. # The Mantis Overlay class is used to store node-tree specific information
  605. # such as inputs and outputs
  606. # used for e.g. allowing strings to pass as $variables in node names
  607. class MantisOverlay():
  608. def __init__( self, parent, inputs, outputs, ):
  609. pass
  610. # The MantisExecutionContext class is used to store the execution-specific variables
  611. # that are used when executing the tree
  612. # Importantly, it is NOT used to store variables between solutions, these belong to the
  613. # tree itself.
  614. class MantisExecutionContext():
  615. def __init__(
  616. self,
  617. base_tree,
  618. ):
  619. self.base_tree = base_tree
  620. self.execution_id = base_tree.execution_id
  621. self.execution_failed=False
  622. self.b_objects={} # objects created by Mantis during execution
  623. class MantisNode:
  624. """
  625. This class contains the basic interface for a Mantis Node.
  626. A MantisNode is used internally by Mantis to represent the final evaluated node graph.
  627. It gets generated with data from a MantisUINode when the graph is read.
  628. """
  629. def __init__(self, signature : tuple,
  630. base_tree : bpy.types.NodeTree,
  631. socket_templates : list[MantisSocketTemplate]=[],):
  632. self.base_tree=base_tree
  633. self.signature = signature
  634. self.ui_signature = signature
  635. self.inputs = MantisNodeSocketCollection(node=self, is_input=True)
  636. self.outputs = MantisNodeSocketCollection(node=self, is_input=False)
  637. self.parameters, self.drivers = {}, {}; self.bObject=None
  638. self.node_type='UNINITIALIZED'
  639. self.hierarchy_connections, self.connections = [], []
  640. self.hierarchy_dependencies, self.dependencies = [], []
  641. self.prepared, self.executed = False, False
  642. self.execution_prepared = False
  643. # the above is for tracking prep state in execution, so that I can avoid preparing nodes
  644. # again without changing the readtree code much.
  645. self.socket_templates = socket_templates
  646. self.mContext = None # for now I am gonna set this at runtime
  647. # I know it isn't "beautiful OOP" or whatever, but it is just easier
  648. # code should be simple and do things in the simplest way.
  649. # in the future I can refactor it, but it will require changes to 100+
  650. # classes, instead of adding about 5 lines of code elsewhere.
  651. if self.socket_templates:
  652. self.init_sockets()
  653. @property
  654. def name(self):
  655. return self.ui_signature[-1]
  656. @property
  657. def bl_idname(self): # this and the above exist solely to maintain interface w/bpy.types.Node
  658. from .utilities import get_node_prototype
  659. return get_node_prototype(self.ui_signature, self.base_tree).bl_idname
  660. def reset_execution(self) -> None:
  661. """ Reset the node for additional execution without re-building the tree."""
  662. self.drivers={}; self.bObject=None
  663. self.executed = False
  664. self.execution_prepared = False
  665. def init_sockets(self) -> None:
  666. self.inputs.init_sockets(self.socket_templates)
  667. self.outputs.init_sockets(self.socket_templates)
  668. def init_parameters(self, additional_parameters = {}) -> None:
  669. for socket in self.inputs:
  670. self.parameters[socket.name] = None
  671. for socket in self.outputs:
  672. self.parameters[socket.name] = None
  673. for key, value in additional_parameters.items():
  674. self.parameters[key]=value
  675. def gen_property_socket_map(self) -> dict:
  676. props_sockets = {}
  677. for s_template in self.socket_templates:
  678. if not s_template.blender_property:
  679. continue
  680. if isinstance(s_template.blender_property, str):
  681. props_sockets[s_template.blender_property]=(s_template.name, s_template.default_value)
  682. elif isinstance(s_template.blender_property, (tuple, list)):
  683. for index, sub_prop in enumerate(s_template.blender_property):
  684. props_sockets[sub_prop]=( (s_template.name, index),s_template.default_value[index] )
  685. return props_sockets
  686. def set_traverse(self, traversal_pairs = [(str, str)]) -> None:
  687. for (a, b) in traversal_pairs:
  688. self.inputs[a].set_traverse_target(self.outputs[b])
  689. self.outputs[b].set_traverse_target(self.inputs[a])
  690. def flush_links(self) -> None:
  691. for inp in self.inputs.values():
  692. inp.flush_links()
  693. for out in self.outputs.values():
  694. out.flush_links()
  695. def update_socket_value(self, blender_property, value) -> bool:
  696. change_handled=False
  697. if self.node_type == 'LINK':
  698. if len(self.bObject) == 0: # - there are no downstream xForms
  699. return True # so there is nothing to do here
  700. for b_ob in self.bObject:
  701. try:
  702. setattr(b_ob, blender_property, value)
  703. change_handled=True
  704. except Exception as e:
  705. print("Failed to update mantis socket because of %s" % e,
  706. "Updating tree instead.")
  707. else:
  708. try:
  709. b_ob = self.bObject
  710. if self.node_type == 'XFORM': # HACK
  711. b_ob = self.bGetObject()
  712. setattr(b_ob, blender_property, value)
  713. change_handled=True
  714. except Exception as e:
  715. print("Failed to update mantis socket because of %s" % e,
  716. "Updating tree instead.")
  717. return change_handled
  718. def ui_modify_socket(self, ui_socket, socket_name=None) -> bool:
  719. """ Handle changes in the node's UI. Updates the rig if possible."""
  720. # Always update the node's data
  721. change_handled=False
  722. if socket_name is None: socket_name = ui_socket.name
  723. value = ui_socket.default_value
  724. if socket_name == 'Enable': value = not value
  725. try:
  726. self.parameters[ui_socket.name]=value
  727. except KeyError:
  728. prRed(f"Unhandled change occured in socket {ui_socket.name} in node"
  729. f" {ui_socket.node.name} in tree {ui_socket.node.id_data.name}.")
  730. for s_template in self.socket_templates:
  731. if s_template.name==ui_socket.name:
  732. change_handled = True
  733. if not s_template.blender_property: return False
  734. elif isinstance(s_template.blender_property, str):
  735. change_handled &= self.update_socket_value(
  736. s_template.blender_property, value)
  737. else: # it is a tuple
  738. for i, prop in enumerate(s_template.blender_property):
  739. try:
  740. change_handled &= self.update_socket_value(
  741. prop, value[i])
  742. except IndexError:
  743. prRed(f"{ui_socket.name} does not have enough values to unpack"
  744. " to update the Mantis tree. Please report this as a bug.")
  745. change_handled=False
  746. break # we don't have to look through any more socket templates
  747. return change_handled
  748. # the goal here is to tag the node as unprepared
  749. # but some nodes are always prepared, so we have to kick it forward.
  750. def reset_execution_recursive(self):
  751. self.reset_execution()
  752. if self.prepared==False: return # all good from here
  753. for conn in self.hierarchy_connections:
  754. conn.reset_execution_recursive()
  755. def evaluate_input(self, input_name, index=0) -> Any:
  756. from .node_container_common import trace_single_line
  757. if not (self.inputs.get(input_name)): # get the named parameter if there is no input
  758. return self.parameters.get(input_name) # this will return None if the parameter does not exist.
  759. # this trace() should give a key error if there is a problem
  760. # it is NOT handled here because it should NOT happen - so I want the error message.
  761. trace = trace_single_line(self, input_name, index)
  762. prop = trace[0][-1].parameters[trace[1].name] #trace[0] = the list of traced nodes; read its parameters
  763. return prop
  764. def fill_parameters(self, ui_node=None) -> None:
  765. from .utilities import get_node_prototype
  766. from .node_container_common import get_socket_value
  767. if not ui_node:
  768. if ( (self.signature[0] in ["MANTIS_AUTOGENERATED", "SCHEMA_AUTOGENERATED" ]) or
  769. (self.signature[-1] in ["NodeGroupOutput", "NodeGroupInput"]) ): # I think this is harmless
  770. return None
  771. else: # BUG shouldn't this use ui_signature??
  772. ui_node = get_node_prototype(self.signature, self.base_tree)
  773. if not ui_node:
  774. raise RuntimeError(wrapRed("No node prototype found for... %s" % ( [self.base_tree] + list(self.signature[1:]) ) ) )
  775. for key in self.parameters.keys():
  776. node_socket = ui_node.inputs.get(key)
  777. if self.parameters[key] is not None: # the parameters are usually initialized as None.
  778. continue # will be filled by the node itself
  779. if not node_socket: #maybe the node socket has no name
  780. if ( ( len(ui_node.inputs) == 0) and ( len(ui_node.outputs) == 1) ):
  781. node_socket = ui_node.outputs[0] # this is a simple input node.
  782. elif key == 'Name': # for Links we just use the Node Label, or if there is no label, the name.
  783. self.parameters[key] = ui_node.label if ui_node.label else ui_node.name
  784. continue
  785. if node_socket:
  786. if node_socket.bl_idname in ['RelationshipSocket', 'xFormSocket']: continue
  787. elif node_socket.is_linked and (not node_socket.is_output): continue
  788. # we will get the value from the link, because this is a linked input port.
  789. # very importantly, we do not pass linked outputs
  790. # fill these because they are probably Input nodes.
  791. elif hasattr(node_socket, "default_value"):
  792. if (value := get_socket_value(node_socket)) is not None:
  793. self.parameters[key] = value
  794. else:
  795. raise RuntimeError(wrapRed("No value found for " + self.__repr__() + " when filling out node parameters for " + ui_node.name + "::"+node_socket.name))
  796. # I don't think this works! but I like the idea
  797. def call_on_all_ancestors(self, *args, **kwargs):
  798. """Resolve the dependencies of this node with the named method and its arguments.
  799. First, dependencies are discovered by walking backwards through the tree. Once the root
  800. nodes are discovered, the method is called by each node in dependency order.
  801. The first argument MUST be the name of the method as a string.
  802. """
  803. if args[0] == 'call_on_all_ancestors': raise RuntimeError("Very funny!")
  804. from .utilities import get_all_dependencies
  805. from collections import deque
  806. # get all dependencies by walking backward through the tree.
  807. all_dependencies = get_all_dependencies(self)
  808. # get just the roots
  809. can_solve = deque(filter(lambda a : len(a.hierarchy_connections) == 0, all_dependencies))
  810. solved = set()
  811. while can_solve:
  812. node = can_solve.pop()
  813. method = getattr(node, args[0])
  814. method(*args[0:], **kwargs)
  815. solved.add(node)
  816. can_solve.extendleft(filter(lambda a : a in all_dependencies, node.hierarchy_connections))
  817. if self in solved:
  818. break
  819. return
  820. # gets targets for constraints and deformers and should handle all cases
  821. def get_target_and_subtarget(self, constraint_or_deformer, input_name = "Target"):
  822. from bpy.types import PoseBone, Object, SplineIKConstraint
  823. subtarget = ''; target = self.evaluate_input(input_name)
  824. if target:
  825. if not hasattr(target, "bGetObject"):
  826. if hasattr(constraint_or_deformer, 'name'):
  827. name = constraint_or_deformer.name
  828. else:
  829. name = 'NAME NOT FOUND'
  830. prRed(f"No {input_name} target found for {name} in {self} because there is no connected node, or node is wrong type")
  831. return
  832. if (isinstance(target.bGetObject(), PoseBone)):
  833. subtarget = target.bGetObject().name
  834. target = target.bGetParentArmature()
  835. elif (isinstance(target.bGetObject(), Object) ):
  836. target = target.bGetObject()
  837. else:
  838. raise RuntimeError("Cannot interpret constraint or deformer target!")
  839. if (isinstance(constraint_or_deformer, SplineIKConstraint)):
  840. if target and target.type not in ["CURVE"]:
  841. raise GraphError(wrapRed("Error: %s requires a Curve input, not %s" %
  842. (self, type(target))))
  843. constraint_or_deformer.target = target# don't get a subtarget
  844. if (input_name == 'Pole Target'):
  845. constraint_or_deformer.pole_target, constraint_or_deformer.pole_subtarget = target, subtarget
  846. else:
  847. if hasattr(constraint_or_deformer, "target"):
  848. constraint_or_deformer.target = target
  849. if hasattr(constraint_or_deformer, "object"):
  850. constraint_or_deformer.object = target
  851. if hasattr(constraint_or_deformer, "subtarget"):
  852. constraint_or_deformer.subtarget = subtarget
  853. # PASSES DEFINED HERE!
  854. def bPrepare(self, bContext=None):
  855. return # This one runs BEFORE anything else
  856. def bTransformPass(self, bContext=None):
  857. return # This one runs in EDIT MODE
  858. def bRelationshipPass(self, bContext=None):
  859. return # This one runs in POSE MODE
  860. def bFinalize(self, bContext=None):
  861. return
  862. def bModifierApply(self, bContext=None):
  863. return
  864. if environ.get("DOERROR"):
  865. def __repr__(self):
  866. return self.signature.__repr__()
  867. else:
  868. def __repr__(self):
  869. return self.ui_signature.__repr__()
  870. # do I need this and the link class above?
  871. class DummyLink:
  872. #gonna use this for faking links to keep the interface consistent
  873. def __init__(self, from_socket, to_socket, nc_from=None, nc_to=None, original_from=None, multi_input_sort_id=0):
  874. self.from_socket = from_socket
  875. self.to_socket = to_socket
  876. self.nc_from = nc_from
  877. self.nc_to = nc_to
  878. self.multi_input_sort_id = multi_input_sort_id
  879. # self.from_node = from_socket.node
  880. # self.to_node = to_socket.node
  881. if (original_from):
  882. self.original_from = original_from
  883. else:
  884. self.original_from = self.from_socket
  885. def __repr__(self):
  886. return(self.nc_from.__repr__()+":"+self.from_socket.name + " -> " + self.nc_to.__repr__()+":"+self.to_socket.name)
  887. def detect_hierarchy_link(from_node, from_socket, to_node, to_socket,):
  888. if to_node.node_type in ['DUMMY_SCHEMA', 'SCHEMA']:
  889. return False #TODO: find out if filtering SCHEMA types is wise
  890. if (from_socket in from_name_filter) or (to_socket in to_name_filter):
  891. return False
  892. # if from_node.__class__.__name__ in ["UtilityCombineVector", "UtilityCombineThreeBool"]:
  893. # return False
  894. return True
  895. class NodeLink:
  896. from_node = None
  897. from_socket = None
  898. to_node = None
  899. to_socket = None
  900. def __init__(self, from_node, from_socket, to_node, to_socket, multi_input_sort_id=0, sub_sort_id=0):
  901. if from_node.signature == to_node.signature:
  902. raise RuntimeError("Cannot connect a node to itself.")
  903. self.from_node = from_node
  904. self.from_socket = from_socket
  905. self.to_node = to_node
  906. self.to_socket = to_socket
  907. self.from_node.outputs[self.from_socket].links.append(self)
  908. # it is the responsibility of the node that uses these links to sort them correctly based on the sort_id
  909. self.multi_input_sort_id = multi_input_sort_id # this is the sort_id of the link in the UI
  910. self.sub_sort_id = sub_sort_id # this is for sorting within a bundled link (one link in the UI)
  911. self.to_node.inputs[self.to_socket].links.append(self)
  912. self.is_hierarchy = detect_hierarchy_link(from_node, from_socket, to_node, to_socket,)
  913. self.is_alive = True
  914. def __repr__(self):
  915. return self.from_node.outputs[self.from_socket].__repr__() + " --> " + self.to_node.inputs[self.to_socket].__repr__()
  916. # link_string = # if I need to colorize output for debugging.
  917. # if self.is_hierarchy:
  918. # return wrapOrange(link_string)
  919. # else:
  920. # return wrapWhite(link_string)
  921. def die(self):
  922. self.is_alive = False
  923. self.to_node.inputs[self.to_socket].flush_links()
  924. self.from_node.outputs[self.from_socket].flush_links()
  925. def insert_node(self, middle_node, middle_node_in, middle_node_out, re_init_hierarchy = True):
  926. to_node = self.to_node
  927. to_socket = self.to_socket
  928. self.to_node = middle_node
  929. self.to_socket = middle_node_in
  930. middle_node.outputs[middle_node_out].connect(to_node, to_socket)
  931. if re_init_hierarchy:
  932. from .utilities import init_connections, init_dependencies
  933. init_connections(self.from_node)
  934. init_connections(middle_node)
  935. init_dependencies(middle_node)
  936. init_dependencies(to_node)
  937. class NodeSocket:
  938. # @property # this is a read-only property.
  939. # def is_linked(self):
  940. # return bool(self.links)
  941. def __init__(self, is_input = False,
  942. node = None, name = None,
  943. traverse_target = None):
  944. self.can_traverse = False # to/from the other side of the parent node
  945. self.traverse_target = None
  946. self.node = node
  947. self.name = name
  948. self.is_input = is_input
  949. self.links = []
  950. self.is_linked = False
  951. if (traverse_target):
  952. self.can_traverse = True
  953. def connect(self, node, socket, sort_id=0, sub_sort_id=0):
  954. if (self.is_input):
  955. to_node = self.node; from_node = node
  956. to_socket = self.name; from_socket = socket
  957. else:
  958. from_node = self.node; to_node = node
  959. from_socket = self.name; to_socket = socket
  960. from_node.outputs[from_socket].is_linked = True
  961. to_node.inputs[to_socket].is_linked = True
  962. # NOTE: I have removed a check for duplicate links here.
  963. # Schemas sometimes have valid duplicate links.
  964. # It is conceivable that this will lead to bugs, but I judge it unlikely.
  965. new_link = NodeLink(
  966. from_node,
  967. from_socket,
  968. to_node,
  969. to_socket,
  970. sort_id,
  971. sub_sort_id)
  972. return new_link
  973. def set_traverse_target(self, traverse_target):
  974. self.traverse_target = traverse_target
  975. self.can_traverse = True
  976. def flush_links(self):
  977. """ Removes dead links from this socket."""
  978. self.links = [l for l in self.links if l.is_alive]
  979. self.links.sort(key=links_sort_key)
  980. self.is_linked = bool(self.links)
  981. @property
  982. def is_connected(self):
  983. return len(self.links)>0
  984. def __repr__(self):
  985. return self.node.__repr__() + "::" + self.name
  986. class MantisNodeSocketCollection(dict):
  987. def __init__(self, node, is_input=False):
  988. self.is_input = is_input
  989. self.node = node
  990. def init_sockets(self, sockets):
  991. for socket in sockets:
  992. if isinstance(socket, str):
  993. self[socket] = NodeSocket(is_input=self.is_input, name=socket, node=self.node)
  994. elif isinstance(socket, MantisSocketTemplate):
  995. if socket.is_input != self.is_input: continue
  996. self[socket.name] = NodeSocket(is_input=self.is_input, name=socket.name, node=self.node)
  997. else:
  998. raise RuntimeError(f"NodeSocketCollection keys must be str or MantisSocketTemplate, not {type(socket)}")
  999. def __delitem__(self, key):
  1000. """Deletes a node socket by name, and all its links."""
  1001. socket = self[key]
  1002. for l in socket.links:
  1003. l.die()
  1004. super().__delitem__(key)
  1005. def __iter__(self):
  1006. """Makes the class iterable"""
  1007. return iter(self.values())