@Override public int hashCode() { return Objects.hash(relations, isDistinct()); } }
@Override public boolean equals(Object obj) { if (this == obj) { return true; } if ((obj == null) || (getClass() != obj.getClass())) { return false; } Intersect o = (Intersect) obj; return Objects.equals(relations, o.relations) && Objects.equals(isDistinct(), o.isDistinct()); }
@Override public String toString() { return toStringHelper(this) .add("relations", relations) .add("distinct", isDistinct()) .toString(); }
@Override protected Void visitIntersect(Intersect node, Integer indent) { Iterator<Relation> relations = node.getRelations().iterator(); while (relations.hasNext()) { processRelation(relations.next(), indent); if (relations.hasNext()) { builder.append("INTERSECT "); if (!node.isDistinct()) { builder.append("ALL "); } } } return null; }
@Override protected Scope visitIntersect(Intersect node, Optional<Scope> scope) { if (!node.isDistinct()) { throw new SemanticException(NOT_SUPPORTED, node, "INTERSECT ALL not yet implemented"); } return visitSetOperation(node, scope); }
@Override protected Void visitIntersect(Intersect node, Integer indent) { Iterator<Relation> relations = node.getRelations().iterator(); while (relations.hasNext()) { processRelation(relations.next(), indent); if (relations.hasNext()) { builder.append("INTERSECT "); if (!node.isDistinct()) { builder.append("ALL "); } } } return null; }
@Override public int hashCode() { return Objects.hash(relations, isDistinct()); } }
@Override public boolean equals(Object obj) { if (this == obj) { return true; } if ((obj == null) || (getClass() != obj.getClass())) { return false; } Intersect o = (Intersect) obj; return Objects.equals(relations, o.relations) && Objects.equals(isDistinct(), o.isDistinct()); }
@Override public String toString() { return toStringHelper(this) .add("relations", relations) .add("distinct", isDistinct()) .toString(); }
@Override protected Void visitIntersect(Intersect node, Integer indent) { Iterator<Relation> relations = node.getRelations().iterator(); while (relations.hasNext()) { processRelation(relations.next(), indent); if (relations.hasNext()) { builder.append("INTERSECT "); if (!node.isDistinct()) { builder.append("ALL "); } } } return null; }
@Override protected Void visitIntersect(Intersect node, Integer indent) { Iterator<Relation> relations = node.getRelations().iterator(); while (relations.hasNext()) { processRelation(relations.next(), indent); if (relations.hasNext()) { builder.append("INTERSECT "); if (!node.isDistinct()) { builder.append("ALL "); } } } return null; }
@Override protected Void visitIntersect(Intersect node, Integer indent) { Iterator<Relation> relations = node.getRelations().iterator(); while (relations.hasNext()) { processRelation(relations.next(), indent); if (relations.hasNext()) { builder.append("INTERSECT "); if (!node.isDistinct()) { builder.append("ALL "); } } } return null; }