Java Code Examples for org.apache.flink.optimizer.costs.Costs#addCosts()

The following examples show how to use org.apache.flink.optimizer.costs.Costs#addCosts() . You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: WorksetIterationPlanNode.java    From Flink-CEPplus with Apache License 2.0 5 votes vote down vote up 
public void setCosts(Costs nodeCosts) {
	// add the costs from the step function
	nodeCosts.addCosts(this.solutionSetDeltaPlanNode.getCumulativeCostsShare());
	nodeCosts.addCosts(this.nextWorkSetPlanNode.getCumulativeCostsShare());

	super.setCosts(nodeCosts);
}
Example 2
Source File: BulkIterationPlanNode.java    From Flink-CEPplus with Apache License 2.0 5 votes vote down vote up 
public void setCosts(Costs nodeCosts) {
	// add the costs from the step function
	nodeCosts.addCosts(this.rootOfStepFunction.getCumulativeCosts());
	
	// add the costs for the termination criterion, if it exists
	// the costs are divided at branches, so we can simply add them up
	if (rootOfTerminationCriterion != null) {
		nodeCosts.addCosts(this.rootOfTerminationCriterion.getCumulativeCosts());
	}
	
	super.setCosts(nodeCosts);
}
Example 3
Source File: SinkJoinerPlanNode.java    From Flink-CEPplus with Apache License 2.0 5 votes vote down vote up 
public void setCosts(Costs nodeCosts) {
	// the plan enumeration logic works as for regular two-input-operators, which is important
	// because of the branch handling logic. it does pick redistributing network channels
	// between the sink and the sink joiner, because sinks joiner has a different parallelism than the sink.
	// we discard any cost and simply use the sum of the costs from the two children.
	
	Costs totalCosts = getInput1().getSource().getCumulativeCosts().clone();
	totalCosts.addCosts(getInput2().getSource().getCumulativeCosts());
	super.setCosts(totalCosts);
}
Example 4
Source File: WorksetIterationPlanNode.java    From flink with Apache License 2.0 5 votes vote down vote up 
public void setCosts(Costs nodeCosts) {
	// add the costs from the step function
	nodeCosts.addCosts(this.solutionSetDeltaPlanNode.getCumulativeCostsShare());
	nodeCosts.addCosts(this.nextWorkSetPlanNode.getCumulativeCostsShare());

	super.setCosts(nodeCosts);
}
Example 5
Source File: BulkIterationPlanNode.java    From flink with Apache License 2.0 5 votes vote down vote up 
public void setCosts(Costs nodeCosts) {
	// add the costs from the step function
	nodeCosts.addCosts(this.rootOfStepFunction.getCumulativeCosts());
	
	// add the costs for the termination criterion, if it exists
	// the costs are divided at branches, so we can simply add them up
	if (rootOfTerminationCriterion != null) {
		nodeCosts.addCosts(this.rootOfTerminationCriterion.getCumulativeCosts());
	}
	
	super.setCosts(nodeCosts);
}
Example 6
Source File: SinkJoinerPlanNode.java    From flink with Apache License 2.0 5 votes vote down vote up 
public void setCosts(Costs nodeCosts) {
	// the plan enumeration logic works as for regular two-input-operators, which is important
	// because of the branch handling logic. it does pick redistributing network channels
	// between the sink and the sink joiner, because sinks joiner has a different parallelism than the sink.
	// we discard any cost and simply use the sum of the costs from the two children.
	
	Costs totalCosts = getInput1().getSource().getCumulativeCosts().clone();
	totalCosts.addCosts(getInput2().getSource().getCumulativeCosts());
	super.setCosts(totalCosts);
}
Example 7
Source File: WorksetIterationPlanNode.java    From flink with Apache License 2.0 5 votes vote down vote up 
public void setCosts(Costs nodeCosts) {
	// add the costs from the step function
	nodeCosts.addCosts(this.solutionSetDeltaPlanNode.getCumulativeCostsShare());
	nodeCosts.addCosts(this.nextWorkSetPlanNode.getCumulativeCostsShare());

	super.setCosts(nodeCosts);
}
Example 8
Source File: BulkIterationPlanNode.java    From flink with Apache License 2.0 5 votes vote down vote up 
public void setCosts(Costs nodeCosts) {
	// add the costs from the step function
	nodeCosts.addCosts(this.rootOfStepFunction.getCumulativeCosts());
	
	// add the costs for the termination criterion, if it exists
	// the costs are divided at branches, so we can simply add them up
	if (rootOfTerminationCriterion != null) {
		nodeCosts.addCosts(this.rootOfTerminationCriterion.getCumulativeCosts());
	}
	
	super.setCosts(nodeCosts);
}
Example 9
Source File: SinkJoinerPlanNode.java    From flink with Apache License 2.0 5 votes vote down vote up 
public void setCosts(Costs nodeCosts) {
	// the plan enumeration logic works as for regular two-input-operators, which is important
	// because of the branch handling logic. it does pick redistributing network channels
	// between the sink and the sink joiner, because sinks joiner has a different parallelism than the sink.
	// we discard any cost and simply use the sum of the costs from the two children.
	
	Costs totalCosts = getInput1().getSource().getCumulativeCosts().clone();
	totalCosts.addCosts(getInput2().getSource().getCumulativeCosts());
	super.setCosts(totalCosts);
}