diff options
author | Jacques Lucke <jacques@blender.org> | 2021-10-21 16:38:41 +0300 |
---|---|---|
committer | Jacques Lucke <jacques@blender.org> | 2021-10-21 16:50:04 +0300 |
commit | 6600ae3aa707d7e1c2728b9af50dc15e81fd7f2b (patch) | |
tree | b4ec39d95aaaee557366d7bc3719858d2626d0de /source/blender/nodes/intern | |
parent | df004637643241136a3294a63c7d4ca865cdea98 (diff) |
Nodes: add utility to find NodeRef for node
In the future `NodeTreeRef` could have a lazy initialized map,
but for now this is good enough.
Diffstat (limited to 'source/blender/nodes/intern')
-rw-r--r-- | source/blender/nodes/intern/node_tree_ref.cc | 10 |
1 files changed, 10 insertions, 0 deletions
diff --git a/source/blender/nodes/intern/node_tree_ref.cc b/source/blender/nodes/intern/node_tree_ref.cc index 43c7fbd2599..2ca797009da 100644 --- a/source/blender/nodes/intern/node_tree_ref.cc +++ b/source/blender/nodes/intern/node_tree_ref.cc @@ -576,6 +576,16 @@ Vector<const NodeRef *> NodeTreeRef::toposort(const ToposortDirection direction) return toposort; } +const NodeRef *NodeTreeRef::find_node(const bNode &bnode) const +{ + for (const NodeRef *node : this->nodes_by_type(bnode.typeinfo)) { + if (node->bnode_ == &bnode) { + return node; + } + } + return nullptr; +} + std::string NodeTreeRef::to_dot() const { dot::DirectedGraph digraph; |