MCPcopy Create free account
hub / github.com/LadybugDB/ladybug / getJoinNodes

Function getJoinNodes

src/planner/join_order/join_tree_constructor.cpp:24–34  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

22}
23
24static std::vector<std::shared_ptr<NodeExpression>> getJoinNodes(const SubqueryGraph& subgraph,
25 const SubqueryGraph& otherSubgraph) {
26 DASSERT(&subgraph.queryGraph == &otherSubgraph.queryGraph);
27 std::vector<std::shared_ptr<NodeExpression>> joinNodes;
28 for (auto idx : subgraph.getNbrNodeIndices()) {
29 if (otherSubgraph.queryNodesSelector[idx]) {
30 joinNodes.push_back(subgraph.queryGraph.getQueryNode(idx));
31 }
32 }
33 return joinNodes;
34}
35
36static std::vector<common::idx_t> intersect(std::vector<common::idx_t> left,
37 std::vector<common::idx_t> right) {

Callers 1

constructTreeNodeMethod · 0.85

Calls 3

getNbrNodeIndicesMethod · 0.80
getQueryNodeMethod · 0.80
push_backMethod · 0.45

Tested by

no test coverage detected