| 243 | } |
| 244 | |
| 245 | void QueryGraphCollection::addAndMergeQueryGraphIfConnected(QueryGraph queryGraphToAdd) { |
| 246 | auto newQueryGraphSet = std::vector<QueryGraph>(); |
| 247 | for (auto i = 0u; i < queryGraphs.size(); i++) { |
| 248 | auto queryGraph = std::move(queryGraphs[i]); |
| 249 | if (queryGraph.isConnected(queryGraphToAdd)) { |
| 250 | queryGraphToAdd.merge(queryGraph); |
| 251 | } else { |
| 252 | newQueryGraphSet.push_back(std::move(queryGraph)); |
| 253 | } |
| 254 | } |
| 255 | newQueryGraphSet.push_back(std::move(queryGraphToAdd)); |
| 256 | queryGraphs = std::move(newQueryGraphSet); |
| 257 | } |
| 258 | |
| 259 | void QueryGraphCollection::finalize() { |
| 260 | common::idx_t baseGraphIdx = 0; |
no test coverage detected