Comment out highest rating table, it's rather pointless.

master
Tomasz Golinski 2021-08-08 19:18:51 +02:00
rodzic f4dd497639
commit c133eb70ca
1 zmienionych plików z 7 dodań i 3 usunięć

Wyświetl plik

@ -327,7 +327,7 @@ int main(int argc, char** argv) {
pCaches caches_by_fav;
pCaches caches_by_fav_perc;
pCaches caches_by_finds;
pCaches caches_by_rating;
// pCaches caches_by_rating;
pCaches fcc;
if (!get_not_found) {
@ -349,14 +349,14 @@ int main(int argc, char** argv) {
caches_by_fav.push_back(&*i);
caches_by_fav_perc.push_back(&*i);
caches_by_finds.push_back(&*i);
caches_by_rating.push_back(&*i);
// caches_by_rating.push_back(&*i);
i++;
}
std::sort(caches_by_fav.begin(), caches_by_fav.end(), [&](const Cache* a, const Cache* b) { return a->fav > b->fav; });
std::sort(caches_by_fav_perc.begin(), caches_by_fav_perc.end(), [&](const Cache* a, const Cache* b) { return 1.0 * a->fav / a->founds > 1.0 * b->fav / b->founds; });
std::sort(caches_by_finds.begin(), caches_by_finds.end(), [&](const Cache* a, const Cache* b) { return a->founds > b->founds; });
std::sort(caches_by_rating.begin(), caches_by_rating.end(), [&](const Cache* a, const Cache* b) { return a->rating > b->rating; });
// std::sort(caches_by_rating.begin(), caches_by_rating.end(), [&](const Cache* a, const Cache* b) { return a->rating > b->rating; });
} else {
for (auto& i : cc) {
if (i.type != "Moving" && i.type != "Own" && (!exclude_quiz || i.type != "Quiz")) {
@ -662,6 +662,7 @@ int main(int argc, char** argv) {
}
std::cout << "</table>\n";
/*
n = 1;
std::cout << "<h2>Caches with highest rating</h2>\n";
@ -688,6 +689,7 @@ int main(int argc, char** argv) {
std::cout << "</table>\n";
average_html(cc, &Cache::rating, "rating");
*/
n = 1;
@ -1002,6 +1004,7 @@ int main(int argc, char** argv) {
}
std::cout << "</table>\n";
/*
n = 1;
std::cout << "<h2>Caches with highest rating</h2>\n";
@ -1026,6 +1029,7 @@ int main(int argc, char** argv) {
std::cout << "</table>\n";
average_html(cc, &Cache::rating, "rating");
*/
n = 1;