stani/sim
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

formatting

Browse Source
This commit is contained in:
stani
2025-03-10 21:21:50 +01:00
parent b0056c9004
commit c6af7019dc
15 changed files with 266 additions and 181 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
src/services/Surplus.cpp
View File

@ -11,22 +11,25 @@
#include <vector>
void Surplus::CalculateSurplus(std::vector<std::unique_ptr<Community>>& communities) {
void Surplus::CalculateSurplus(std::vector<std::unique_ptr<Community>>& communities)
{
std::vector<float> consumptionAvailable(VALUE_COUNT, 0.0);
std::vector<float> generationAvailable(VALUE_COUNT, 0.0);
auto iterateFunc = Community::iterateBuildings(communities);
auto modifyCommunity = [](Community& c) {
auto modifyCommunity = [](Community& c)
{
std::cout << "Processing Community\n";
};
auto modifyBuilding = [](Building::Base& building) {
auto modifyBuilding = [](Building::Base& building)
{
std::cout << "Processing Building\n";
CalculateBuildingSurplus(building);
};
auto nestedFunc = iterateFunc(modifyCommunity);
nestedFunc(modifyBuilding);
iterateFunc(modifyCommunity)(modifyBuilding);
}
void Surplus::CalculateBuildingSurplus(Building::Base& building) {
void Surplus::CalculateBuildingSurplus(Building::Base& building)
{
std::vector ownCoverage(VALUE_COUNT, 0.0f);
std::vector neededConsumption(VALUE_COUNT, 0.0f);
std::vector neededGeneration(VALUE_COUNT, 0.0f);
@ -37,10 +40,11 @@ void Surplus::CalculateBuildingSurplus(Building::Base& building) {
std::transform(consumption.begin(), consumption.end(),
generation.begin(), ownCoverage.begin(),
[&](const std::unique_ptr<float>& c, const std::unique_ptr<float>& g) {
[&](const std::unique_ptr<float>& c, const std::unique_ptr<float>& g)
{
ownCoverage.push_back((c ? *c : 0.0f) - (g ? *g : 0.0f));
neededConsumption.push_back((c && *c> 0.0f?*c:0.0f));
neededGeneration.push_back((g && *g<0.0f?-*g:0.0f));
neededConsumption.push_back((c && *c > 0.0f ? *c : 0.0f));
neededGeneration.push_back((g && *g < 0.0f ? -*g : 0.0f));
ownUsage.push_back((c ? *c : 0.0f) - (neededConsumption.back()));
return 0.0f;
});