void Reducer::Init(std::vector<Vec2>& originalPoints)
{
points.clear();
points.insert(points.begin(), originalPoints.begin(), originalPoints.end());
numPoints = originalPoints.size();
Build();
CalculateCosts();
}
/**
** Handle AI of all players each game cycle.
*/
void PlayersEachCycle(void)
{
for (int player = 0; player < NumPlayers; ++player) {
CPlayer *p = &Players[player];
// Update rate based economy
for (int res = 0; res < MaxCosts; ++res) {
int rate = p->ProductionRate[res] - p->ActualUtilizationRate[res];
if (rate > 0) {
if (p->StoredResources[res] < p->StorageCapacity[res]) {
p->StoredResources[res] += rate;
if (p->StoredResources[res] > p->StorageCapacity[res]) {
p->StoredResources[res] = p->StorageCapacity[res];
}
}
} else if (rate < 0) {
rate = -rate;
// Assert(p->StoredResources[res] >= rate);
p->StoredResources[res] -= rate;
if (p->StoredResources[res] < 0) {
p->StoredResources[res] = 0;
}
}
p->TotalResources[res] += p->ProductionRate[res];
}
// Recalculate costs
std::map<CUnit *, int *>::iterator it;
for (it = p->UnitsConsumingResourcesActual.begin(); it != p->UnitsConsumingResourcesActual.end(); ++it) {
int costs[MaxCosts];
CalculateCosts((*it).first, costs);
p->UpdateUnitsConsumingResources((*it).first, costs);
}
// Ai
if (p->AiEnabled) {
AiEachCycle(p);
}
}
}