public Void visitLocalRef(RexLocalRef localRef) { for (Integer target : targets) { graph.addEdge(localRef.getIndex(), target); } return null; } });
public Void visitLocalRef(RexLocalRef localRef) { graph.addEdge(localRef.getIndex(), expr.i); return null; } });
public Void visitLocalRef(RexLocalRef localRef) { graph.addEdge(localRef.getIndex(), expr.i); return null; } });
public Void visitLocalRef(RexLocalRef localRef) { for (Integer target : targets) { graph.addEdge(localRef.getIndex(), target); } return null; } });
public void registerConverterRule( RelOptPlanner planner, ConverterRule converterRule) { if (converterRule.isGuaranteed()) { ConversionData conversionData = getConversionData(planner); final Convention inConvention = (Convention) converterRule.getInTrait(); final Convention outConvention = (Convention) converterRule.getOutTrait(); conversionData.conversionGraph.addVertex(inConvention); conversionData.conversionGraph.addVertex(outConvention); conversionData.conversionGraph.addEdge(inConvention, outConvention); conversionData.mapArcToConverterRule.put( Pair.of(inConvention, outConvention), converterRule); } }
Edge edge = graph.getEdge(source, target); if (edge == null) { edge = graph.addEdge(source, target);
graph.addEdge(parent, preservedVertex); updateVertex(parent, parentRel);
public void registerConverterRule( RelOptPlanner planner, ConverterRule converterRule) { if (converterRule.isGuaranteed()) { ConversionData conversionData = getConversionData(planner); final Convention inConvention = (Convention) converterRule.getInTrait(); final Convention outConvention = (Convention) converterRule.getOutTrait(); conversionData.conversionGraph.addVertex(inConvention); conversionData.conversionGraph.addVertex(outConvention); conversionData.conversionGraph.addEdge(inConvention, outConvention); conversionData.mapArcToConverterRule.put( Pair.of(inConvention, outConvention), converterRule); } }
usesGraph.addVertex(qname); usesGraph.addVertex(usedTable.getQualifiedName()); usesGraph.addEdge(usedTable.getQualifiedName(), qname);
graph.addEdge(parent, preservedVertex); updateVertex(parent, parentRel);
usesGraph.addVertex(qname); usesGraph.addVertex(usedTable.getQualifiedName()); usesGraph.addEdge(usedTable.getQualifiedName(), qname);
Edge edge = graph.getEdge(source, target); if (edge == null) { edge = graph.addEdge(source, target);
edge = graph.addEdge(tRef, parentTRef);
@Test public void testOne() { DirectedGraph<String, DefaultEdge> g = DefaultDirectedGraph.create(); g.addVertex("A"); g.addVertex("B"); g.addVertex("C"); g.addVertex("D"); g.addVertex("E"); g.addVertex("F"); g.addEdge("A", "B"); g.addEdge("B", "C"); g.addEdge("D", "C"); g.addEdge("C", "D"); g.addEdge("E", "F"); g.addEdge("C", "C"); assertEquals("[A, B, C, D]", shortestPath(g, "A", "D").toString()); g.addEdge("B", "D"); assertEquals("[A, B, D]", shortestPath(g, "A", "D").toString()); assertNull("There is no path from A to E", shortestPath(g, "A", "E")); assertEquals("[]", shortestPath(g, "D", "D").toString()); assertNull("Node X is not in the graph", shortestPath(g, "X", "A")); assertEquals("[[A, B, C, D], [A, B, D]]", paths(g, "A", "D").toString()); }
edge = graph.addEdge(tRef, parentTRef);
@Test public void testOne() { DirectedGraph<String, DefaultEdge> g = DefaultDirectedGraph.create(); g.addVertex("A"); g.addVertex("B"); g.addVertex("C"); g.addVertex("D"); g.addVertex("E"); g.addVertex("F"); g.addEdge("A", "B"); g.addEdge("B", "C"); g.addEdge("D", "C"); g.addEdge("C", "D"); g.addEdge("E", "F"); g.addEdge("C", "C"); assertEquals("[A, B, C, D]", shortestPath(g, "A", "D").toString()); g.addEdge("B", "D"); assertEquals("[A, B, D]", shortestPath(g, "A", "D").toString()); assertNull("There is no path from A to E", shortestPath(g, "A", "E")); assertEquals("[]", shortestPath(g, "D", "D").toString()); assertNull("Node X is not in the graph", shortestPath(g, "X", "A")); assertEquals("[[A, B, C, D], [A, B, D]]", paths(g, "A", "D").toString()); }
graph.addEdge(newVertex, (HepRelVertex) input);
graph.addEdge(newVertex, (HepRelVertex) input);
DefaultEdge x = g.addEdge("A", "B"); fail("expected exception, got " + x); } catch (IllegalArgumentException e) { DefaultEdge x = g.addEdge("A", "B"); assertNotNull(x); DefaultEdge x2 = g.addEdge("A", "B"); assertNull(x2); try { DefaultEdge x3 = g.addEdge("Z", "A"); fail("expected exception, got " + x3); } catch (IllegalArgumentException e) { DefaultEdge x3 = g.addEdge("Z", "A"); assertNotNull(x3); DefaultEdge x4 = g.addEdge("Z", "A"); assertNull(x4);
DefaultEdge x = g.addEdge("A", "B"); fail("expected exception, got " + x); } catch (IllegalArgumentException e) { DefaultEdge x = g.addEdge("A", "B"); assertNotNull(x); DefaultEdge x2 = g.addEdge("A", "B"); assertNull(x2); try { DefaultEdge x3 = g.addEdge("Z", "A"); fail("expected exception, got " + x3); } catch (IllegalArgumentException e) { DefaultEdge x3 = g.addEdge("Z", "A"); assertNotNull(x3); DefaultEdge x4 = g.addEdge("Z", "A"); assertNull(x4);