Progress on Implementing Dungeon Packs
Completed enough of the implementation and integration to compile DD. Some portions of the code are only for testing and will be removed later. The configuration for default dungeons is hardcoded - we can parse config files once we're certain that dungeon chains work. At the moment, dungeons generate but it doesn't seem like the rules we set are being followed properly. Renamed OptimizedRule to DungeonChainRule, and renamed the old DungeonChainRule to DungeonChainRuleDefinition, to match the role of each class better. Added some hax to DungeonGenerator to get packs integrated - the implementation will be much cleaner once the new save format is done.
This commit is contained in:
@@ -1,13 +1,66 @@
|
||||
package StevenDimDoors.mod_pocketDim.dungeon.pack;
|
||||
|
||||
import java.util.ArrayList;
|
||||
import java.util.HashMap;
|
||||
|
||||
import StevenDimDoors.mod_pocketDim.util.WeightedContainer;
|
||||
|
||||
public class DungeonChainRule
|
||||
{
|
||||
private final int[] condition;
|
||||
private final ArrayList<WeightedContainer<DungeonType>> products;
|
||||
|
||||
public DungeonChainRule(DungeonChainRuleDefinition source, HashMap<String, DungeonType> nameToTypeMapping)
|
||||
{
|
||||
ArrayList<String> conditionNames = source.getCondition();
|
||||
ArrayList<WeightedContainer<String>> productNames = source.getProducts();
|
||||
|
||||
public OptimizedRule optimize(HashMap<String, DungeonType> nameToTypeMapping) {
|
||||
// TODO Auto-generated method stub
|
||||
return null;
|
||||
condition = new int[conditionNames.size()];
|
||||
for (int k = 0; k < condition.length; k++)
|
||||
{
|
||||
condition[k] = nameToTypeMapping.get(conditionNames.get(k)).ID;
|
||||
}
|
||||
products = new ArrayList<WeightedContainer<DungeonType>>();
|
||||
for (WeightedContainer<String> product : productNames)
|
||||
{
|
||||
products.add(new WeightedContainer<DungeonType>(nameToTypeMapping.get(product.getData()), product.itemWeight ));
|
||||
}
|
||||
}
|
||||
|
||||
public int length()
|
||||
{
|
||||
return condition.length;
|
||||
}
|
||||
|
||||
public boolean evaluate(int[] typeHistory)
|
||||
{
|
||||
if (typeHistory.length >= condition.length)
|
||||
{
|
||||
for (int k = 0; k < condition.length; k++)
|
||||
{
|
||||
if (condition[k] != 0 && typeHistory[k] != condition[k])
|
||||
{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
else
|
||||
{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
public ArrayList<WeightedContainer<DungeonType>> products()
|
||||
{
|
||||
//Create a deep copy of the internal list of products. That way, if the list is modified externally,
|
||||
//it won't affect the reference copy inside this rule.
|
||||
ArrayList<WeightedContainer<DungeonType>> copy = new ArrayList<WeightedContainer<DungeonType>>(products.size());
|
||||
for (WeightedContainer<DungeonType> container : products)
|
||||
{
|
||||
copy.add(container.clone());
|
||||
}
|
||||
|
||||
return copy;
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user