| 921 | } // buildTreeInternal |
| 922 | |
| 923 | static bool |
| 924 | hasNodeOutputsInList(const std::list<NodeGuiPtr> & nodes, |
| 925 | const NodeGuiPtr& node) |
| 926 | { |
| 927 | const NodesWList& outputs = node->getNode()->getGuiOutputs(); |
| 928 | bool foundOutput = false; |
| 929 | |
| 930 | for (std::list<NodeGuiPtr> ::const_iterator it = nodes.begin(); it != nodes.end(); ++it) { |
| 931 | if (*it != node) { |
| 932 | NodePtr n = (*it)->getNode(); |
| 933 | |
| 934 | for (NodesWList::const_iterator it2 = outputs.begin(); it2 != outputs.end(); ++it2) { |
| 935 | if (it2->lock() == n) { |
| 936 | foundOutput = true; |
| 937 | break; |
| 938 | } |
| 939 | } |
| 940 | if (foundOutput) { |
| 941 | break; |
| 942 | } |
| 943 | } |
| 944 | } |
| 945 | |
| 946 | return foundOutput; |
| 947 | } |
| 948 | |
| 949 | static bool |
| 950 | hasNodeInputsInList(const std::list<NodeGuiPtr> & nodes, |
no test coverage detected