/** * Registers a {@link RelNode}, which has already been registered, in a new * {@link RelSet}. * * @param set Set * @param rel Relational expression */ void reregister( RelSet set, RelNode rel) { // Is there an equivalent relational expression? (This might have // just occurred because the relational expression's child was just // found to be equivalent to another set.) RelNode equivRel = mapDigestToRel.get(rel.getDigest()); if ((equivRel != null) && (equivRel != rel)) { assert (equivRel.getClass() == rel.getClass()); assert (equivRel.getTraitSet().equals(rel.getTraitSet())); RelSubset equivRelSubset = getSubset(equivRel); ruleQueue.recompute(equivRelSubset, true); return; } // Add the relational expression into the correct set and subset. RelSubset subset2 = asd(rel, set); }
/** * Registers a {@link RelNode}, which has already been registered, in a new * {@link RelSet}. * * @param set Set * @param rel Relational expression */ void reregister( RelSet set, RelNode rel) { // Is there an equivalent relational expression? (This might have // just occurred because the relational expression's child was just // found to be equivalent to another set.) final Pair<String, RelDataType> key = key(rel); RelNode equivRel = mapDigestToRel.get(key); if (equivRel != null && equivRel != rel) { assert equivRel.getClass() == rel.getClass(); assert equivRel.getTraitSet().equals(rel.getTraitSet()); RelSubset equivRelSubset = getSubset(equivRel); ruleQueue.recompute(equivRelSubset, true); return; } // Add the relational expression into the correct set and subset. RelSubset subset2 = asd(rel, set); }
RelSubset subset = asd(rel, set);
RelSubset subset = asd(rel, set);