Miko/baritone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Streams are nice

Browse Source
This commit is contained in:
Brady
2018-10-30 18:21:09 -05:00
parent 5e2ccdac08
commit f2a45b9eeb
2 changed files with 11 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/main/java/tenor/AquireItemTask.java
View File

@@ -21,7 +21,7 @@ import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class AquireItemTask extends QuantizedTaskNode implements IClaimProvider, IQuantizedDependentCostCalculator<IQuantizedChildTaskRelationship, IQuantizedParentTaskRelationship> {
public class AquireItemTask extends QuantizedTaskNode implements IClaimProvider, IQuantizedDependentCostCalculator {
HashMap<IQuantizedChildTaskRelationship, Integer> allocation; // allocation of what tasks have claim over what items in our inventory i guess

27
src/main/java/tenor/IQuantizedDependentCostCalculator.java
View File

@@ -18,28 +18,21 @@
package tenor;
public interface IQuantizedDependentCostCalculator extends IQuantizedTaskNode {
@Override
default IQuantityRelationship cost() {
switch (type()) {
case SERIAL:
case PARALLEL_ALL:
return q -> {
double sum = 0;
for (IQuantizedParentTaskRelationship relationship : childTasks()) {
sum += relationship.cost().value(q);
}
return sum;
};
return q -> childTasks().stream()
.map(IQuantizedParentTaskRelationship::cost)
.mapToDouble(relationship -> relationship.value(q))
.sum();
case ANY_ONE_OF: // TODO this could be smarter about allocating
return q -> {
double min = -1;
for (IQuantizedParentTaskRelationship relationship : childTasks()) {
double cost = relationship.cost().value(q);
if (min == -1 || cost < min) {
min = cost;
}
}
return min;
};
return q -> childTasks().stream()
.map(IQuantizedParentTaskRelationship::cost)
.mapToDouble(relationship -> relationship.value(q))
.min().orElse(-1);
default:
throw new UnsupportedOperationException();