/** * Constructs a new job edge, that connects an intermediate result to a consumer task. * * @param source The data set that is at the source of this edge. * @param target The operation that is at the target of this edge. * @param distributionPattern The pattern that defines how the connection behaves in parallel. */ public JobEdge(IntermediateDataSet source, JobVertex target, DistributionPattern distributionPattern) { if (source == null || target == null || distributionPattern == null) { throw new NullPointerException(); } this.target = target; this.distributionPattern = distributionPattern; this.source = source; this.sourceId = source.getId(); }
/** * Constructs a new job edge, that connects an intermediate result to a consumer task. * * @param source The data set that is at the source of this edge. * @param target The operation that is at the target of this edge. * @param distributionPattern The pattern that defines how the connection behaves in parallel. */ public JobEdge(IntermediateDataSet source, JobVertex target, DistributionPattern distributionPattern) { if (source == null || target == null || distributionPattern == null) { throw new NullPointerException(); } this.target = target; this.distributionPattern = distributionPattern; this.source = source; this.sourceId = source.getId(); }
/** * Constructs a new job edge, that connects an intermediate result to a consumer task. * * @param source The data set that is at the source of this edge. * @param target The operation that is at the target of this edge. * @param distributionPattern The pattern that defines how the connection behaves in parallel. */ public JobEdge(IntermediateDataSet source, JobVertex target, DistributionPattern distributionPattern) { if (source == null || target == null || distributionPattern == null) { throw new NullPointerException(); } this.target = target; this.distributionPattern = distributionPattern; this.source = source; this.sourceId = source.getId(); }
/** * Constructs a new job edge, that connects an intermediate result to a consumer task. * * @param source The data set that is at the source of this edge. * @param target The operation that is at the target of this edge. * @param distributionPattern The pattern that defines how the connection behaves in parallel. */ public JobEdge(IntermediateDataSet source, JobVertex target, DistributionPattern distributionPattern) { if (source == null || target == null || distributionPattern == null) { throw new NullPointerException(); } this.target = target; this.distributionPattern = distributionPattern; this.source = source; this.sourceId = source.getId(); }
public void connecDataSet(IntermediateDataSet dataSet) { if (dataSet == null) { throw new NullPointerException(); } if (this.source != null) { throw new IllegalStateException("The edge is already connected."); } if (!dataSet.getId().equals(sourceId)) { throw new IllegalArgumentException("The data set to connect does not match the sourceId."); } this.source = dataSet; }
public void connecDataSet(IntermediateDataSet dataSet) { if (dataSet == null) { throw new NullPointerException(); } if (this.source != null) { throw new IllegalStateException("The edge is already connected."); } if (!dataSet.getId().equals(sourceId)) { throw new IllegalArgumentException("The data set to connect does not match the sourceId."); } this.source = dataSet; }
public void connecDataSet(IntermediateDataSet dataSet) { if (dataSet == null) { throw new NullPointerException(); } if (this.source != null) { throw new IllegalStateException("The edge is already connected."); } if (!dataSet.getId().equals(sourceId)) { throw new IllegalArgumentException("The data set to connect does not match the sourceId."); } this.source = dataSet; }
public void connecDataSet(IntermediateDataSet dataSet) { if (dataSet == null) { throw new NullPointerException(); } if (this.source != null) { throw new IllegalStateException("The edge is already connected."); } if (!dataSet.getId().equals(sourceId)) { throw new IllegalArgumentException("The data set to connect does not match the sourceId."); } this.source = dataSet; }
public Collection<IntermediateDataSetID> getResultIDs() { // Lazy build the result map if the result is not found, as edges may be late added for (JobVertex vertex : getVertices()) { for (IntermediateDataSet result : vertex.getProducedDataSets()) { results.put(result.getId(), result); } } return results.keySet(); }
public IntermediateDataSet getResult(IntermediateDataSetID resultID) { // Lazy build the result map if the result is not found, as edges may be late added if (!results.containsKey(resultID)) { for (JobVertex vertex : getVertices()) { for (IntermediateDataSet result : vertex.getProducedDataSets()) { results.put(result.getId(), result); } } } return results.get(resultID); }
result.getId(), this, numTaskVertices,
result.getId(), this, numTaskVertices,
result.getId(), this, numTaskVertices,
result.getId(), this, numTaskVertices,