Compare commits

...

2 Commits

Author SHA1 Message Date
Matti
8af59118c2 Implement getting most popular type in a country 2024-11-22 15:41:12 +01:00
Matti
2e4efa7833 Menu works? 2024-11-22 15:19:33 +01:00
3 changed files with 65 additions and 28 deletions

View File

@ -8,7 +8,7 @@
class ProductSale { class ProductSale {
private: public:
std::string region; std::string region;
std::string country; std::string country;
std::string itemType; std::string itemType;
@ -23,7 +23,7 @@ private:
double totalRevenue; double totalRevenue;
double totalCost; double totalCost;
double totalProfit; double totalProfit;
public:
ProductSale(std::string line); ProductSale(std::string line);
std::string toString(); std::string toString();
}; };

View File

@ -1,5 +1,6 @@
#include <fstream> #include <fstream>
#include <iostream> #include <iostream>
#include <map>
#include <string> #include <string>
#include <vector> #include <vector>
@ -36,10 +37,41 @@ void deleteAllPointers(std::vector<ProductSale*> &allSales) {
void getMostPopularTypeIn(std::string country, std::vector<ProductSale*> &allSales) { void getMostPopularTypeIn(std::string country, std::vector<ProductSale*> &allSales) {
// TODO Add Map DataType // TODO Add Map DataType
for (auto singelSale = allSales.begin(); singelSale != allSales.end(); singelSale++) { std::map<std::string, int>TypeCounter;
for (ProductSale* singelSale : allSales) {
// map.add(singleSale) // map.add(singleSale)
if (singelSale->country != country) {
continue;
} }
bool alreadyExists = false;
for (auto element : TypeCounter) {
if (element.first == singelSale->itemType) {
element.second++;
alreadyExists = true;
break;
}
}
if (!alreadyExists) {
TypeCounter[singelSale->itemType] = 1;
}
}
// return map.getMostCommon // return map.getMostCommon
std::string mostPopularType;
int counter = 0;
for (auto element : TypeCounter) {
if (element.second > counter) {
counter = element.second;
mostPopularType = element.first;
}
}
std::cout << "Most popular Type : " << mostPopularType << std::endl
<< "Occurences : " << counter << std::endl << std::endl;
} }
void Aufg8Main() { void Aufg8Main() {
@ -53,15 +85,18 @@ void Aufg8Main() {
std::cout << "==============" << std::endl; std::cout << "==============" << std::endl;
} }
deleteAllPointers(allSales); std::string selectedRegion;
std::string selectedType;
int currentMenu = 0;
std::string* selectedRegion; std::string* PselectedRegion = &selectedRegion;
std::string* selectedType; std::string* PselectedType = &selectedType;
int* currentMenu; int* PcurrentMenu = &currentMenu;
MenuManager menu{currentMenu, selectedRegion, selectedType}; MenuManager menu{PcurrentMenu, PselectedRegion, PselectedType};
menu.MainInteraction(); menu.MainInteraction();
switch (*currentMenu) { // TODO Finish these while (currentMenu) {
switch (currentMenu) { // TODO Finish these
case 0: case 0:
return; return;
case 1: case 1:
@ -71,7 +106,7 @@ void Aufg8Main() {
// getSaleCount(*selectedType, *selectedRegion); // getSaleCount(*selectedType, *selectedRegion);
break; break;
case 3: case 3:
getMostPopularTypeIn(*selectedRegion, allSales); getMostPopularTypeIn(selectedRegion, allSales);
break; break;
case 4: case 4:
// getOnlineVsOfflineIn(*selectedRegion); // getOnlineVsOfflineIn(*selectedRegion);
@ -79,4 +114,6 @@ void Aufg8Main() {
default: default:
std::cout << "You should not be able to reach this!"; std::cout << "You should not be able to reach this!";
} }
menu.MainInteraction();
}
} }