| 354 | } |
| 355 | |
| 356 | uint32_t RenderGraph::getEdge(const std::string& src, const std::string& dst) |
| 357 | { |
| 358 | str_pair srcPair = parseFieldName(src); |
| 359 | str_pair dstPair = parseFieldName(dst); |
| 360 | |
| 361 | for (uint32_t i = 0; i < mpGraph->getCurrentEdgeId(); ++i) |
| 362 | { |
| 363 | if (!mpGraph->doesEdgeExist(i)) |
| 364 | { |
| 365 | continue; |
| 366 | } |
| 367 | |
| 368 | const DirectedGraph::Edge* pEdge = mpGraph->getEdge(i); |
| 369 | if (dstPair.first == mNodeData[pEdge->getDestNode()].name && srcPair.first == mNodeData[pEdge->getSourceNode()].name) |
| 370 | { |
| 371 | if (mEdgeData[i].dstField == dstPair.second && mEdgeData[i].srcField == srcPair.second) |
| 372 | return i; |
| 373 | } |
| 374 | } |
| 375 | |
| 376 | return static_cast<uint32_t>(-1); |
| 377 | } |
| 378 | |
| 379 | bool RenderGraph::isGraphOutput(const GraphOut& graphOut) const |
| 380 | { |
no test coverage detected