| 112 | } |
| 113 | |
| 114 | Result GraphFunction::removeNode(NodeInstance& nodeToRemove) { |
| 115 | // invalidate the cache |
| 116 | module().updateLastEditTime(); |
| 117 | |
| 118 | Result res; |
| 119 | |
| 120 | // disconnect it's connections |
| 121 | |
| 122 | // disconnect input exec |
| 123 | for (const auto& execSlot : nodeToRemove.inputExecConnections) { |
| 124 | for (const auto& pair : execSlot) { |
| 125 | if (pair.first != nullptr) { res += disconnectExec(*pair.first, pair.second); } |
| 126 | } |
| 127 | } |
| 128 | // disconnect output exec |
| 129 | auto ID = 0ull; |
| 130 | for (const auto& pair : nodeToRemove.outputExecConnections) { |
| 131 | if (pair.first != nullptr) { res += disconnectExec(nodeToRemove, ID); } |
| 132 | ++ID; |
| 133 | } |
| 134 | |
| 135 | // disconnect input data |
| 136 | for (const auto& pair : nodeToRemove.inputDataConnections) { |
| 137 | if (pair.first != nullptr) { |
| 138 | res += disconnectData(*pair.first, pair.second, nodeToRemove); |
| 139 | } |
| 140 | } |
| 141 | |
| 142 | // disconnect output data |
| 143 | ID = 0ull; |
| 144 | for (const auto& dataSlot : nodeToRemove.outputDataConnections) { |
| 145 | for (const auto& pair : dataSlot) { |
| 146 | if (pair.first != nullptr) { disconnectData(nodeToRemove, ID, *pair.first); } |
| 147 | } |
| 148 | ++ID; |
| 149 | } |
| 150 | // then delete the node |
| 151 | nodes().erase(nodeToRemove.id()); |
| 152 | |
| 153 | return res; |
| 154 | } |
| 155 | |
| 156 | Result GraphFunction::createEntryNodeType(std::unique_ptr<NodeType>* toFill) const { |
| 157 | Result res; |
no test coverage detected