Run formatter

This commit is contained in:
Nicholas Ignoffo 2017-08-15 21:30:48 -07:00
parent 61c44a831b
commit 08258fd6ef
606 changed files with 13464 additions and 22975 deletions

View file

@ -11,61 +11,48 @@ import java.util.List;
import java.util.Map;
import java.util.TreeMap;
public class IncenseAltarHandler
{
public class IncenseAltarHandler {
public static Map<Integer, List<IncenseAltarComponent>> incenseComponentMap = new TreeMap<Integer, List<IncenseAltarComponent>>();
//Incense bonus maximum applied for the tier of blocks.
public static double[] incenseBonuses = new double[] { 0.2, 0.6, 1.2, 2, 3, 4.5 };
public static double[] tranquilityRequired = new double[] { 0, 6, 14.14, 28, 44.09, 83.14 };
public static int[] roadsRequired = new int[] { 0, 1, 4, 6, 8, 10, 12 }; //TODO: Change for when the roads are fully implemented
public static double[] incenseBonuses = new double[]{0.2, 0.6, 1.2, 2, 3, 4.5};
public static double[] tranquilityRequired = new double[]{0, 6, 14.14, 28, 44.09, 83.14};
public static int[] roadsRequired = new int[]{0, 1, 4, 6, 8, 10, 12}; //TODO: Change for when the roads are fully implemented
public static void registerIncenseComponent(int altarLevel, IncenseAltarComponent component)
{
if (incenseComponentMap.containsKey(altarLevel))
{
public static void registerIncenseComponent(int altarLevel, IncenseAltarComponent component) {
if (incenseComponentMap.containsKey(altarLevel)) {
incenseComponentMap.get(altarLevel).add(component);
} else
{
} else {
List<IncenseAltarComponent> list = new ArrayList<IncenseAltarComponent>();
list.add(component);
incenseComponentMap.put(altarLevel, list);
}
}
public static void registerIncenseComponent(int altarLevel, BlockPos offsetPos, Block block, IBlockState state)
{
public static void registerIncenseComponent(int altarLevel, BlockPos offsetPos, Block block, IBlockState state) {
registerIncenseComponent(altarLevel, new IncenseAltarComponent(offsetPos, block, state));
}
public static double getMaxIncenseBonusFromComponents(World world, BlockPos pos)
{
public static double getMaxIncenseBonusFromComponents(World world, BlockPos pos) {
double accumulatedBonus = 0;
for (int i = 0; i < incenseBonuses.length; i++)
{
for (int i = 0; i < incenseBonuses.length; i++) {
double previousBonus = (i <= 0 ? 0 : incenseBonuses[i - 1]);
double nextBonus = incenseBonuses[i];
if (!incenseComponentMap.containsKey(i))
{
if (!incenseComponentMap.containsKey(i)) {
accumulatedBonus += (nextBonus - previousBonus);
} else
{
} else {
boolean hasAllComponentsThisTier = true;
for (IncenseAltarComponent component : incenseComponentMap.get(i))
{
for (IncenseAltarComponent component : incenseComponentMap.get(i)) {
BlockPos offsetPos = pos.add(component.getOffset(EnumFacing.NORTH));
IBlockState state = world.getBlockState(offsetPos);
Block block = state.getBlock();
if (component.doesBlockMatch(block, state))
{
if (component.doesBlockMatch(block, state)) {
hasAllComponentsThisTier = false;
} else
{
} else {
accumulatedBonus += (nextBonus - previousBonus) / incenseComponentMap.get(i).size();
}
}
if (!hasAllComponentsThisTier)
{
if (!hasAllComponentsThisTier) {
break;
}
}
@ -74,16 +61,12 @@ public class IncenseAltarHandler
return accumulatedBonus;
}
public static double getMaxIncenseBonusFromRoads(int roads)
{
public static double getMaxIncenseBonusFromRoads(int roads) {
double previousBonus = 0;
for (int i = 0; i < incenseBonuses.length; i++)
{
if (roads >= roadsRequired[i])
{
for (int i = 0; i < incenseBonuses.length; i++) {
if (roads >= roadsRequired[i]) {
previousBonus = incenseBonuses[i];
} else
{
} else {
return previousBonus;
}
}
@ -91,18 +74,14 @@ public class IncenseAltarHandler
return previousBonus;
}
public static double getIncenseBonusFromComponents(World world, BlockPos pos, double tranquility, int roads)
{
public static double getIncenseBonusFromComponents(World world, BlockPos pos, double tranquility, int roads) {
double maxBonus = Math.min(getMaxIncenseBonusFromComponents(world, pos), getMaxIncenseBonusFromRoads(roads));
double possibleBonus = 0;
for (int i = 0; i < incenseBonuses.length; i++)
{
if (tranquility >= tranquilityRequired[i])
{
for (int i = 0; i < incenseBonuses.length; i++) {
if (tranquility >= tranquilityRequired[i]) {
possibleBonus = incenseBonuses[i];
} else if (i >= 1)
{
} else if (i >= 1) {
possibleBonus += (incenseBonuses[i] - possibleBonus) * (tranquility - tranquilityRequired[i - 1]) / (tranquilityRequired[i] - tranquilityRequired[i - 1]);
break;
}