-
Notifications
You must be signed in to change notification settings - Fork 379
/
TransportUtils.java
203 lines (180 loc) · 7.9 KB
/
TransportUtils.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
package games.strategy.triplea.util;
import games.strategy.engine.data.Route;
import games.strategy.engine.data.Unit;
import games.strategy.triplea.attachments.UnitAttachment;
import games.strategy.triplea.delegate.Matches;
import games.strategy.triplea.delegate.TransportTracker;
import games.strategy.util.IntegerMap;
import games.strategy.util.Match;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Optional;
public class TransportUtils {
/**
* Returns a map of unit -> transport.
*/
public static Map<Unit, Unit> mapTransports(final Route route, final Collection<Unit> units,
final Collection<Unit> transportsToLoad) {
if (route.isLoad()) {
return mapTransportsToLoad(units, transportsToLoad);
}
if (route.isUnload()) {
return mapTransportsAlreadyLoaded(units, route.getStart().getUnits().getUnits());
}
return mapTransportsAlreadyLoaded(units, units);
}
/**
* Returns a map of unit -> transport. Tries to load units evenly across all transports.
*/
public static Map<Unit, Unit> mapTransportsToLoad(final Collection<Unit> units,
final Collection<Unit> transports) {
final List<Unit> canBeTransported = sortByTransportCostDescending(units);
final List<Unit> canTransport = sortByTransportCapacityAscending(transports);
// Add units to transports evenly
final Map<Unit, Unit> mapping = new HashMap<Unit, Unit>();
final IntegerMap<Unit> addedLoad = new IntegerMap<Unit>();
for (final Unit unit : canBeTransported) {
final Optional<Unit> transport = loadUnitIntoFirstAvailableTransport(unit, canTransport, mapping, addedLoad);
// Move loaded transport to end of list
if (transport.isPresent()) {
canTransport.remove(transport.get());
canTransport.add(transport.get());
}
}
return mapping;
}
/**
* Returns a map of unit -> transport. Tries load max units into each transport before moving to next.
*/
public static Map<Unit, Unit> mapTransportsToLoadUsingMinTransports(final Collection<Unit> units,
final Collection<Unit> transports) {
final List<Unit> canBeTransported = sortByTransportCostDescending(units);
final List<Unit> canTransport = sortByTransportCapacityAscending(transports);
// Add max units to each transport
final Map<Unit, Unit> mapping = new HashMap<Unit, Unit>();
for (final Unit transport : canTransport) {
int capacity = TransportTracker.getAvailableCapacity(transport);
for (final Iterator<Unit> it = canBeTransported.iterator(); it.hasNext();) {
final Unit unit = it.next();
final int cost = UnitAttachment.get((unit).getType()).getTransportCost();
if (capacity >= cost) {
capacity -= cost;
mapping.put(unit, transport);
it.remove();
}
}
}
return mapping;
}
public static List<Unit> findUnitsToLoadOnAirTransports(final Collection<Unit> units,
final Collection<Unit> transports) {
final Collection<Unit> airTransports = Match.getMatches(transports, Matches.UnitIsAirTransport);
final Comparator<Unit> c = new Comparator<Unit>() {
@Override
public int compare(final Unit o1, final Unit o2) {
final int cost1 = UnitAttachment.get((o1).getUnitType()).getTransportCost();
final int cost2 = UnitAttachment.get((o2).getUnitType()).getTransportCost();
// descending transportCost
return cost2 - cost1;
}
};
Collections.sort((List<Unit>) units, c);
// Define the max of all units that could be loaded
final List<Unit> totalLoad = new ArrayList<Unit>();
// Get a list of the unit categories
final Collection<UnitCategory> unitTypes = UnitSeperator.categorize(units, null, false, true);
final Collection<UnitCategory> transportTypes = UnitSeperator.categorize(airTransports, null, false, false);
for (final UnitCategory unitType : unitTypes) {
final int transportCost = unitType.getTransportCost();
for (final UnitCategory transportType : transportTypes) {
final int transportCapacity = UnitAttachment.get(transportType.getType()).getTransportCapacity();
if (transportCost > 0 && transportCapacity >= transportCost) {
final int transportCount = Match.countMatches(airTransports, Matches.unitIsOfType(transportType.getType()));
final int ttlTransportCapacity = transportCount * (int) Math.floor(transportCapacity / transportCost);
totalLoad.addAll(Match.getNMatches(units, ttlTransportCapacity, Matches.unitIsOfType(unitType.getType())));
}
}
}
return totalLoad;
}
public static int getTransportCost(final Collection<Unit> units) {
if (units == null) {
return 0;
}
int cost = 0;
final Iterator<Unit> iter = units.iterator();
while (iter.hasNext()) {
final Unit item = iter.next();
cost += UnitAttachment.get(item.getType()).getTransportCost();
}
return cost;
}
/**
* Returns a map of unit -> transport. Unit must already be loaded in the transport.
*/
private static Map<Unit, Unit> mapTransportsAlreadyLoaded(final Collection<Unit> units,
final Collection<Unit> transports) {
final Collection<Unit> canBeTransported = Match.getMatches(units, Matches.UnitCanBeTransported);
final Collection<Unit> canTransport = Match.getMatches(transports, Matches.UnitCanTransport);
final Map<Unit, Unit> mapping = new HashMap<Unit, Unit>();
final Iterator<Unit> land = canBeTransported.iterator();
while (land.hasNext()) {
final Unit currentTransported = land.next();
final Unit transport = TransportTracker.transportedBy(currentTransported);
// already being transported, make sure it is in transports
if (transport == null) {
continue;
}
if (!canTransport.contains(transport)) {
continue;
}
mapping.put(currentTransported, transport);
}
return mapping;
}
private static List<Unit> sortByTransportCapacityAscending(final Collection<Unit> transports) {
final Comparator<Unit> transportCapacityComparator = new Comparator<Unit>() {
@Override
public int compare(final Unit o1, final Unit o2) {
final int capacityLeft1 = TransportTracker.getAvailableCapacity(o1);
final int capacityLeft2 = TransportTracker.getAvailableCapacity(o2);
return capacityLeft1 - capacityLeft2;
}
};
final List<Unit> canTransport = Match.getMatches(transports, Matches.UnitCanTransport);
Collections.sort(canTransport, transportCapacityComparator);
return canTransport;
}
private static List<Unit> sortByTransportCostDescending(final Collection<Unit> units) {
final Comparator<Unit> transportCostComparator = new Comparator<Unit>() {
@Override
public int compare(final Unit o1, final Unit o2) {
final int cost1 = UnitAttachment.get((o1).getUnitType()).getTransportCost();
final int cost2 = UnitAttachment.get((o2).getUnitType()).getTransportCost();
return cost2 - cost1;
}
};
final List<Unit> canBeTransported = Match.getMatches(units, Matches.UnitCanBeTransported);
Collections.sort(canBeTransported, transportCostComparator);
return canBeTransported;
}
private static Optional<Unit> loadUnitIntoFirstAvailableTransport(final Unit unit, final List<Unit> canTransport,
final Map<Unit, Unit> mapping, final IntegerMap<Unit> addedLoad) {
final int cost = UnitAttachment.get((unit).getType()).getTransportCost();
for (final Unit transport : canTransport) {
final int capacity = TransportTracker.getAvailableCapacity(transport) - addedLoad.getInt(transport);
if (capacity >= cost) {
addedLoad.add(transport, cost);
mapping.put(unit, transport);
return Optional.of(transport);
}
}
return Optional.empty();
}
}