/**
* @param units a HashMap in the form RepairRule -> number of units assumes that each repair rule
* has 1 result, which is simply the number of units
*/
public void setUnitsFromRepairRuleMap(
final HashMap<Unit, IntegerMap<RepairRule>> units,
final PlayerID player,
final GameData data) {
removeAll();
final Set<Unit> entries = units.keySet();
for (final Unit unit : entries) {
final IntegerMap<RepairRule> rules = units.get(unit);
final TreeSet<RepairRule> repairRules = new TreeSet<RepairRule>(repairRuleComparator);
repairRules.addAll(rules.keySet());
for (final RepairRule repairRule : repairRules) {
final int quantity = rules.getInt(repairRule);
if (games.strategy.triplea.Properties.getDamageFromBombingDoneToUnitsInsteadOfTerritories(
data)) {
// check to see if the repair rule matches the damaged unit
if (unit.getType().equals((repairRule.getResults().keySet().iterator().next())))
addUnits(
player,
data,
quantity,
unit.getType(),
Matches.UnitHasTakenSomeBombingUnitDamage.match(unit),
Matches.UnitIsDisabled.match(unit));
}
}
}
}
/**
* This will make a new IntegerMap. The Objects will be linked, but the integers mapped to them
* will not be linked.
*
* @param integerMap
*/
public IntegerMap(final IntegerMap<T> integerMap) {
/* this will also work:
m_values = new HashMap<T,Integer>(integerMap.m_values);
*/
m_values = new HashMap<T, Integer>(integerMap.size());
for (final T t : integerMap.keySet()) {
m_values.put(t, integerMap.getInt(t));
}
}
/**
* The equals method will only return true if both the keys and values match exactly. If a has
* entries that b doesn't have or vice versa, then a and b are not equal.
*/
@Override
@SuppressWarnings("unchecked")
public boolean equals(final Object o) {
if (this == o) return true;
if (o == null || !(o instanceof IntegerMap)) return false;
final IntegerMap<T> map = (IntegerMap<T>) o;
if (!map.keySet().equals(this.keySet())) return false;
if (!map.m_values.equals(this.m_values)) return false;
for (final T key : map.keySet()) {
if (!(this.getInt(key) == map.getInt(key))) return false;
}
return true;
}
private static Comparator<Unit> getCapacityComparator(
final List<Unit> transports, final boolean increasing) {
// this makes it more efficient
final IntegerMap<Unit> capacityMap = new IntegerMap<>(transports.size() + 1, 1);
for (final Unit transport : transports) {
final Collection<Unit> transporting = TripleAUnit.get(transport).getTransporting();
capacityMap.add(transport, TransportUtils.getTransportCost(transporting));
}
return (t1, t2) -> {
final int cost1 = capacityMap.getInt(t1);
final int cost2 = capacityMap.getInt(t2);
if (increasing) {
return cost1 - cost2;
} else {
return cost2 - cost1;
}
};
}
/**
* @param units a HashMap in the form ProductionRule -> number of units assumes that each
* production rule has 1 result, which is simple the number of units
*/
public void setUnitsFromProductionRuleMap(
final IntegerMap<ProductionRule> units, final PlayerID player, final GameData data) {
removeAll();
final TreeSet<ProductionRule> productionRules =
new TreeSet<ProductionRule>(productionRuleComparator);
productionRules.addAll(units.keySet());
for (final ProductionRule productionRule : productionRules) {
final int quantity = units.getInt(productionRule);
for (final NamedAttachable resourceOrUnit : productionRule.getResults().keySet()) {
addUnits(
player,
data,
quantity * productionRule.getResults().getInt(resourceOrUnit),
resourceOrUnit,
false,
false);
}
}
}
/** Add map * multiple */
public void addMultiple(final IntegerMap<T> map, final int multiple) {
for (final T key : map.keySet()) {
add(key, map.getInt(key) * multiple);
}
}
public IntegerMap<T> copy() {
final IntegerMap<T> copy = new IntegerMap<T>();
copy.add(this);
return copy;
}
/**
* By >= we mean that each of our entries is greater than or equal to each entry in the other map.
* We do not take into account entries that are in our map but not in the second map. <br>
* It is possible that for two maps a and b a.greaterThanOrEqualTo(b) is false, and
* b.greaterThanOrEqualTo(a) is false, and that a and b are not equal.
*/
public boolean greaterThanOrEqualTo(final IntegerMap<T> map) {
for (final T key : map.keySet()) {
if (!(this.getInt(key) >= map.getInt(key))) return false;
}
return true;
}
public void subtract(final IntegerMap<T> map) {
for (final T key : map.keySet()) {
add(key, -map.getInt(key));
}
}
public void add(final IntegerMap<T> map) {
for (final T key : map.keySet()) {
add(key, map.getInt(key));
}
}
private void fireRocket(
final PlayerID player,
final Territory attackedTerritory,
final IDelegateBridge bridge,
final Territory attackFrom) {
final GameData data = bridge.getData();
final PlayerID attacked = attackedTerritory.getOwner();
final Resource PUs = data.getResourceList().getResource(Constants.PUS);
final boolean DamageFromBombingDoneToUnits =
isDamageFromBombingDoneToUnitsInsteadOfTerritories(data);
// unit damage vs territory damage
final Collection<Unit> enemyUnits =
attackedTerritory
.getUnits()
.getMatches(
new CompositeMatchAnd<Unit>(
Matches.enemyUnit(player, data), Matches.unitIsBeingTransported().invert()));
final Collection<Unit> enemyTargetsTotal =
Match.getMatches(
enemyUnits, Matches.UnitIsAtMaxDamageOrNotCanBeDamaged(attackedTerritory).invert());
final Collection<Unit> targets = new ArrayList<Unit>();
final Collection<Unit> rockets;
// attackFrom could be null if WW2V1
if (attackFrom == null) rockets = null;
else
rockets =
new ArrayList<Unit>(
Match.getMatches(attackFrom.getUnits().getUnits(), rocketMatch(player, data)));
final int numberOfAttacks =
(rockets == null
? 1
: Math.min(
TechAbilityAttachment.getRocketNumberPerTerritory(player, data),
TechAbilityAttachment.getRocketDiceNumber(rockets, data)));
if (numberOfAttacks <= 0) return;
final String transcript;
if (DamageFromBombingDoneToUnits) {
// TODO: rockets needs to be completely redone to allow for multiple rockets to fire at
// different targets, etc etc.
final HashSet<UnitType> legalTargetsForTheseRockets = new HashSet<UnitType>();
if (rockets == null)
legalTargetsForTheseRockets.addAll(data.getUnitTypeList().getAllUnitTypes());
else {
// a hack for now, we let the rockets fire at anyone who could be targetted by any rocket
for (final Unit r : rockets) {
legalTargetsForTheseRockets.addAll(
UnitAttachment.get(r.getType()).getBombingTargets(data));
}
}
final Collection<Unit> enemyTargets =
Match.getMatches(enemyTargetsTotal, Matches.unitIsOfTypes(legalTargetsForTheseRockets));
if (enemyTargets.isEmpty()) return; // TODO: this sucks
Unit target = null;
if (enemyTargets.size() == 1) target = enemyTargets.iterator().next();
else {
while (target == null) {
final ITripleaPlayer iplayer = (ITripleaPlayer) bridge.getRemotePlayer(player);
target = iplayer.whatShouldBomberBomb(attackedTerritory, enemyTargets, rockets);
}
}
if (target == null)
throw new IllegalStateException("No Targets in " + attackedTerritory.getName());
targets.add(target);
}
final boolean doNotUseBombingBonus =
!games.strategy.triplea.Properties.getUseBombingMaxDiceSidesAndBonus(data)
|| rockets == null;
int cost = 0;
if (!games.strategy.triplea.Properties.getLL_DAMAGE_ONLY(data)) {
if (doNotUseBombingBonus || rockets == null) {
// no low luck, and no bonus, so just roll based on the map's dice sides
final int[] rolls =
bridge.getRandom(
data.getDiceSides(),
numberOfAttacks,
player,
DiceType.BOMBING,
"Rocket fired by " + player.getName() + " at " + attacked.getName());
for (final int r : rolls) {
cost += r + 1; // we are zero based
}
transcript =
"Rockets "
+ (attackFrom == null ? "" : "in " + attackFrom.getName())
+ " roll: "
+ MyFormatter.asDice(rolls);
} else {
// we must use bombing bonus
int highestMaxDice = 0;
int highestBonus = 0;
final int diceSides = data.getDiceSides();
for (final Unit u : rockets) {
final UnitAttachment ua = UnitAttachment.get(u.getType());
int maxDice = ua.getBombingMaxDieSides();
int bonus = ua.getBombingBonus();
// both could be -1, meaning they were not set. if they were not set, then we use default
// dice sides for the map, and zero for the bonus.
if (maxDice < 0) maxDice = diceSides;
if (bonus < 0) bonus = 0;
// we only roll once for rockets, so if there are other rockets here we just roll for the
// best rocket
if ((bonus + ((maxDice + 1) / 2)) > (highestBonus + ((highestMaxDice + 1) / 2))) {
highestMaxDice = maxDice;
highestBonus = bonus;
}
}
// now we roll, or don't if there is nothing to roll.
if (highestMaxDice > 0) {
final int[] rolls =
bridge.getRandom(
highestMaxDice,
numberOfAttacks,
player,
DiceType.BOMBING,
"Rocket fired by " + player.getName() + " at " + attacked.getName());
for (int i = 0; i < rolls.length; i++) {
final int r = rolls[i] + highestBonus;
rolls[i] = r;
cost += r + 1; // we are zero based
}
transcript =
"Rockets "
+ (attackFrom == null ? "" : "in " + attackFrom.getName())
+ " roll: "
+ MyFormatter.asDice(rolls);
} else {
cost = highestBonus * numberOfAttacks;
transcript =
"Rockets "
+ (attackFrom == null ? "" : "in " + attackFrom.getName())
+ " do "
+ highestBonus
+ " damage for each rocket";
}
}
} else {
if (doNotUseBombingBonus || rockets == null) {
// no bonus, so just roll based on the map's dice sides, but modify for LL
final int maxDice = (data.getDiceSides() + 1) / 3;
final int bonus = (data.getDiceSides() + 1) / 3;
final int[] rolls =
bridge.getRandom(
maxDice,
numberOfAttacks,
player,
DiceType.BOMBING,
"Rocket fired by " + player.getName() + " at " + attacked.getName());
for (int i = 0; i < rolls.length; i++) {
final int r = rolls[i] + bonus;
rolls[i] = r;
cost += r + 1; // we are zero based
}
transcript =
"Rockets "
+ (attackFrom == null ? "" : "in " + attackFrom.getName())
+ " roll: "
+ MyFormatter.asDice(rolls);
} else {
int highestMaxDice = 0;
int highestBonus = 0;
final int diceSides = data.getDiceSides();
for (final Unit u : rockets) {
final UnitAttachment ua = UnitAttachment.get(u.getType());
int maxDice = ua.getBombingMaxDieSides();
int bonus = ua.getBombingBonus();
// both could be -1, meaning they were not set. if they were not set, then we use default
// dice sides for the map, and zero for the bonus.
if (maxDice < 0 || doNotUseBombingBonus) maxDice = diceSides;
if (bonus < 0 || doNotUseBombingBonus) bonus = 0;
// now, regardless of whether they were set or not, we have to apply "low luck" to them,
// meaning in this case that we reduce the luck by 2/3.
if (maxDice >= 5) {
bonus += (maxDice + 1) / 3;
maxDice = (maxDice + 1) / 3;
}
// we only roll once for rockets, so if there are other rockets here we just roll for the
// best rocket
if ((bonus + ((maxDice + 1) / 2)) > (highestBonus + ((highestMaxDice + 1) / 2))) {
highestMaxDice = maxDice;
highestBonus = bonus;
}
}
// now we roll, or don't if there is nothing to roll.
if (highestMaxDice > 0) {
final int[] rolls =
bridge.getRandom(
highestMaxDice,
numberOfAttacks,
player,
DiceType.BOMBING,
"Rocket fired by " + player.getName() + " at " + attacked.getName());
for (int i = 0; i < rolls.length; i++) {
final int r = rolls[i] + highestBonus;
rolls[i] = r;
cost += r + 1; // we are zero based
}
transcript =
"Rockets "
+ (attackFrom == null ? "" : "in " + attackFrom.getName())
+ " roll: "
+ MyFormatter.asDice(rolls);
} else {
cost = highestBonus * numberOfAttacks;
transcript =
"Rockets "
+ (attackFrom == null ? "" : "in " + attackFrom.getName())
+ " do "
+ highestBonus
+ " damage for each rocket";
}
}
}
int territoryProduction = TerritoryAttachment.getProduction(attackedTerritory);
if (DamageFromBombingDoneToUnits && !targets.isEmpty()) {
// we are doing damage to 'target', not to the territory
final Unit target = targets.iterator().next();
// UnitAttachment ua = UnitAttachment.get(target.getType());
final TripleAUnit taUnit = (TripleAUnit) target;
final int damageLimit = taUnit.getHowMuchMoreDamageCanThisUnitTake(target, attackedTerritory);
cost = Math.max(0, Math.min(cost, damageLimit));
final int totalDamage = taUnit.getUnitDamage() + cost;
// Record production lost
// DelegateFinder.moveDelegate(data).PUsLost(attackedTerritory, cost);
// apply the hits to the targets
final IntegerMap<Unit> damageMap = new IntegerMap<Unit>();
damageMap.put(target, totalDamage);
bridge.addChange(ChangeFactory.bombingUnitDamage(damageMap));
// attackedTerritory.notifyChanged();
}
// in WW2V2, limit rocket attack cost to production value of factory.
else if (isWW2V2(data) || isLimitRocketDamageToProduction(data)) {
// If we are limiting total PUs lost then take that into account
if (isPUCap(data) || isLimitRocketDamagePerTurn(data)) {
final int alreadyLost = DelegateFinder.moveDelegate(data).PUsAlreadyLost(attackedTerritory);
territoryProduction -= alreadyLost;
territoryProduction = Math.max(0, territoryProduction);
}
if (cost > territoryProduction) {
cost = territoryProduction;
}
}
// Record the PUs lost
DelegateFinder.moveDelegate(data).PUsLost(attackedTerritory, cost);
if (DamageFromBombingDoneToUnits && !targets.isEmpty()) {
getRemote(bridge)
.reportMessage(
"Rocket attack in "
+ attackedTerritory.getName()
+ " does "
+ cost
+ " damage to "
+ targets.iterator().next(),
"Rocket attack in "
+ attackedTerritory.getName()
+ " does "
+ cost
+ " damage to "
+ targets.iterator().next());
bridge
.getHistoryWriter()
.startEvent(
"Rocket attack in "
+ attackedTerritory.getName()
+ " does "
+ cost
+ " damage to "
+ targets.iterator().next());
} else {
cost *= Properties.getPU_Multiplier(data);
getRemote(bridge)
.reportMessage(
"Rocket attack in " + attackedTerritory.getName() + " costs:" + cost,
"Rocket attack in " + attackedTerritory.getName() + " costs:" + cost);
// Trying to remove more PUs than the victim has is A Bad Thing[tm]
final int availForRemoval = attacked.getResources().getQuantity(PUs);
if (cost > availForRemoval) cost = availForRemoval;
final String transcriptText =
attacked.getName() + " lost " + cost + " PUs to rocket attack by " + player.getName();
bridge.getHistoryWriter().startEvent(transcriptText);
final Change rocketCharge = ChangeFactory.changeResourcesChange(attacked, PUs, -cost);
bridge.addChange(rocketCharge);
}
bridge
.getHistoryWriter()
.addChildToEvent(transcript, rockets == null ? null : new ArrayList<Unit>(rockets));
// this is null in WW2V1
if (attackFrom != null) {
if (rockets != null && !rockets.isEmpty()) {
// TODO: only a certain number fired...
final Change change =
ChangeFactory.markNoMovementChange(Collections.singleton(rockets.iterator().next()));
bridge.addChange(change);
} else {
throw new IllegalStateException("No rockets?" + attackFrom.getUnits().getUnits());
}
}
// kill any units that can die if they have reached max damage (veqryn)
if (Match.someMatch(targets, Matches.UnitCanDieFromReachingMaxDamage)) {
final List<Unit> unitsCanDie =
Match.getMatches(targets, Matches.UnitCanDieFromReachingMaxDamage);
unitsCanDie.retainAll(
Match.getMatches(
unitsCanDie, Matches.UnitIsAtMaxDamageOrNotCanBeDamaged(attackedTerritory)));
if (!unitsCanDie.isEmpty()) {
// targets.removeAll(unitsCanDie);
final Change removeDead = ChangeFactory.removeUnits(attackedTerritory, unitsCanDie);
final String transcriptText =
MyFormatter.unitsToText(unitsCanDie) + " lost in " + attackedTerritory.getName();
bridge.getHistoryWriter().addChildToEvent(transcriptText, unitsCanDie);
bridge.addChange(removeDead);
}
}
// play a sound
if (cost > 0)
bridge
.getSoundChannelBroadcaster()
.playSoundForAll(SoundPath.CLIP_BOMBING_ROCKET, player.getName());
}
