final PlanNode[] localMatches = toKeep[i]; for (final PlanNode n : localMatches) { if (n != null && !n.isPruneMarkerSet()) { n.setPruningMarker(); plans.add(n); if (!n.isPruneMarkerSet()) { n.setPruningMarker(); plans.add(n);
final PlanNode[] localMatches = toKeep[i]; for (final PlanNode n : localMatches) { if (n != null && !n.isPruneMarkerSet()) { n.setPruningMarker(); plans.add(n); if (!n.isPruneMarkerSet()) { n.setPruningMarker(); plans.add(n);
final PlanNode[] localMatches = toKeep[i]; for (final PlanNode n : localMatches) { if (n != null && !n.isPruneMarkerSet()) { n.setPruningMarker(); plans.add(n); if (!n.isPruneMarkerSet()) { n.setPruningMarker(); plans.add(n);
final PlanNode[] localMatches = toKeep[i]; for (final PlanNode n : localMatches) { if (n != null && !n.isPruneMarkerSet()) { n.setPruningMarker(); plans.add(n); if (!n.isPruneMarkerSet()) { n.setPruningMarker(); plans.add(n);
final PlanNode[] localMatches = toKeep[i]; for (final PlanNode n : localMatches) { if (n != null && !n.isPruneMarkerSet()) { n.setPruningMarker(); plans.add(n); if (!n.isPruneMarkerSet()) { n.setPruningMarker(); plans.add(n);