@Override public IntersectRel copy( RelTraitSet traitSet, List<RelNode> inputs, boolean all) { assert traitSet.containsIfApplicable(Convention.NONE); return new IntersectRel( getCluster(), inputs, all); }
public RelNode convert(RelNode rel) { final IntersectRel intersect = (IntersectRel) rel; if (intersect.all) { return null; // INTERSECT ALL not implemented } final EnumerableConvention out = EnumerableConvention.INSTANCE; final RelTraitSet traitSet = intersect.getTraitSet().replace(out); return new EnumerableIntersectRel(rel.getCluster(), traitSet, convertList(intersect.getInputs(), out), intersect.all); } }
return new IntersectRel( cluster, ImmutableList.of(left, right),
public RelNode convert(RelNode rel) { final IntersectRel intersect = (IntersectRel) rel; if (intersect.all) { return null; // INTERSECT ALL not implemented } final RelTraitSet traitSet = intersect.getTraitSet().replace(out); return new JdbcIntersectRel(rel.getCluster(), traitSet, convertList(intersect.getInputs(), out), intersect.all); } }
return new IntersectRel( cluster, Arrays.asList(left, right),
public RelNode convert(RelNode rel) { final IntersectRel intersect = (IntersectRel) rel; if (intersect.all) { return null; // INTERSECT ALL not implemented } final RelTraitSet traitSet = intersect.getTraitSet().replace(out); return new JdbcIntersectRel( rel.getCluster(), traitSet, convertList(intersect.getInputs(), traitSet), intersect.all); } }
@Override public IntersectRel copy( RelTraitSet traitSet, List<RelNode> inputs, boolean all) { assert traitSet.containsIfApplicable(Convention.NONE); return new IntersectRel( getCluster(), inputs, all); } }
return new IntersectRel( cluster, ImmutableList.of(left, right),
public RelNode convert(RelNode rel) { final IntersectRel intersect = (IntersectRel) rel; if (intersect.all) { return null; // INTERSECT ALL not implemented } final RelTraitSet traitSet = intersect.getTraitSet().replace( EnumerableConvention.INSTANCE); return new EnumerableIntersectRel( rel.getCluster(), traitSet, convertList(intersect.getInputs(), traitSet), intersect.all); } }