-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathexercise4.cpp
51 lines (44 loc) · 1.57 KB
/
exercise4.cpp
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
#include "city.h"
#include "country.h"
#include "world-util.h"
#include <map>
#include <iostream>
#include <string>
#include <memory>
#include <algorithm>
#include <numeric>
using namespace std;
using namespace world;
map<int, shared_ptr<city>> cities;
map<string, shared_ptr<country>> countries;
int main() {
create_world();
// Find the richest country in each continent
auto compareByGnp = [](auto &left, auto &right) {
return left->gnp < right->gnp;
};
auto continentRichestCountryReducer = [&compareByGnp](auto &&continentCountries, /* reduce type */ auto &entry) {
auto ctry = entry.second;
auto continent = ctry->continent;
auto continentRichestCountry = continentCountries.find(continent);
if (continentRichestCountry == continentCountries.end())
continentCountries[continent] = ctry;
else {
auto richestCountry = continentRichestCountry->second;
if (compareByGnp(richestCountry, ctry))
continentCountries[continent] = ctry;
}
return continentCountries;
};
auto continentCountries = std::accumulate(
countries.begin(),
countries.end(),
std::map<std::string, shared_ptr<country>>(), // reduce type
continentRichestCountryReducer
);
auto print_continent_richest_country = [](const auto &pair) {
std::cout << pair.first << ": " << pair.second->name << "\n";
};
std::for_each(continentCountries.cbegin(), continentCountries.cend(), print_continent_richest_country);
return 0;
}