#include "okapi.h"
// #include "gpx.h"
#include "cache.h"
#include "debug.h"
#include "heat.h"
#include "ocdb.h"
#include "common.h"
#include "region.h"

#include <iostream>
#include <algorithm>
#include <numeric>
#include <unistd.h>
#include <cmath>

void show_usage() {
	std::cout << "Usage: geostat [options]\n";
	std::cout << "Generate HTML stats from Opencaching data.\n\n";
	std::cout << " * Data sources:\n";
	std::cout << "\t-o[user]\tuse Opencaching; if specified user will be a user name used for all OC instances\n";
	std::cout << "\t-p user\t\tuser for opencaching.pl\n";
	std::cout << "\t-d user\t\tuser for opencaching.de\n";
	std::cout << "\t-u user\t\tuser for opencaching.us\n";
	std::cout << "\t-n user\t\tuser for opencaching.nl\n";
	std::cout << "\t-r user\t\tuser for opencaching.ro\n";
	std::cout << "\t-k user\t\tuser for opencaching.uk\n";
// 	std::cout << "\t-g file\t\tuse specified gpx file\n";
	std::cout << "\t-q\t\tuse local SQLite file with dump of OC database\n";
	std::cout << "\t-i timestamp\tstart date\n";
	std::cout << "\t-f timestamp\tfinish date\n";
	std::cout << " * Output:\n";
	std::cout << "\t-N\t\tcompute stats for unfound caches (works only with SQLite)\n";
	std::cout << "\t-O\t\tcompute stats for owned caches (works only with SQLite)\n";
	std::cout << "\t-Q\t\texclude quiz caches from unfound caches\n";
	std::cout << "\t-H file\t\trender a heat map to a file\n";
	std::cout << "\t-s n\t\tstamp size for a heat map (default = 15)\n";
	std::cout << "\t-e\t\tuse exponential to flatten the heat map\n";
	std::cout << "\t-t\t\tdraw trail instead of heat map\n";
	std::cout << "\t-a\t\tdraw animated map instead of heat map\n";
	std::cout << "\t-m map\t\tchosen map: Poland, Poland_relief, Poland_big, Europe, World or a name of voivodeship (default = Poland)\n";
	std::cout << "\t-h\t\tdisplay this help screen\n";
	std::exit(EXIT_FAILURE);
}

int main(int argc, char** argv) {
	std::string heat_file;
	int heat_stamp_size = 15;
	std::string heat_map = "Poland";
	bool heat_exp = 0;
	bool trail = 0;
	bool anim = 0;
	bool use_oc = 0;
	bool use_ocdb = 0;
	bool get_not_found = 0;
	bool get_owned = 0;
	bool exclude_quiz = 0;
	std::time_t start_time = 0;
	std::time_t end_time = std::time(nullptr);
	bool time_filter = 0;

	std::string ocpl_user;
	std::string ocde_user;
	std::string ocus_user;
	std::string ocnl_user;
	std::string ocro_user;
	std::string ocuk_user;

	std::string ocpl_user_profile;
	std::string ocde_user_profile;
	std::string ocus_user_profile;
	std::string ocnl_user_profile;
	std::string ocro_user_profile;
	std::string ocuk_user_profile;

	std::string ocpl_url = "https://opencaching.pl/okapi/";
	std::string ocde_url = "https://www.opencaching.de/okapi/";
	std::string ocus_url = "http://www.opencaching.us/okapi/";
	std::string ocnl_url = "http://www.opencaching.nl/okapi/";
	std::string ocro_url = "http://www.opencaching.ro/okapi/";
	std::string ocuk_url = "https://opencache.uk/okapi/";

	const std::string Database_pl = "ocpl.sqlite";
	const std::string Database_de = "ocde.sqlite";
	const std::string Database_us = "ocus.sqlite";

// 	std::string gpx_file;

#include "config_user.h"

	if (argc == 1) show_usage();

	int o;
	while ((o = getopt(argc, argv, "qNOQD:o::p:d:u:n:r:k:i:f:H:s:m:etah?")) != -1)
		switch (o) {
			case 'D':
				Debug::set_debug_level(get_num('d', optarg));
				break;
// 			case 'g':
// 				gpx_file = optarg;
// 				break;
			case 'o':
				use_oc = 1;
				if (optarg) {
					ocpl_user = optarg;
					ocde_user = optarg;
					ocus_user = optarg;
					ocnl_user = optarg;
					ocro_user = optarg;
					ocuk_user = optarg;
				}
				break;
			case 'p':
				ocpl_user = optarg;
				break;
			case 'd':
				ocde_user = optarg;
				break;
			case 'u':
				ocus_user = optarg;
				break;
			case 'n':
				ocnl_user = optarg;
				break;
			case 'r':
				ocro_user = optarg;
				break;
			case 'k':
				ocuk_user = optarg;
				break;
			case 'q':
				use_ocdb = 1;
				break;
			case 'i':
				start_time = get_num('i', optarg);
				time_filter = 1;
				break;
			case 'f':
				end_time = get_num('f', optarg);
				time_filter = 1;
				break;
			case 'N':
				get_not_found = 1;
				break;
			case 'O':
				get_owned = 1;
				break;
			case 'Q':
				exclude_quiz = 1;
				break;
			case 'H':
				heat_file = optarg;
				break;
			case 's':
				heat_stamp_size = get_num('s', optarg);
				break;
			case 'm':
				heat_map = optarg;
				break;
			case 'e':
				heat_exp = 1;
				break;
			case 't':
				trail = 1;
				break;
			case 'a':
				anim = 1;
				break;
			case 'h':
			case '?':
			default:
				show_usage();
		}

	Caches cc;
	std::map<std::string, int> region_count;

	if (get_not_found || get_owned) {
		use_oc = 0;
		use_ocdb = 1;
		trail = 0;
		if (ocpl_user_uuid.empty() && ocpl_user.empty() && ocde_user_uuid.empty() && ocde_user.empty()) {
			std::cout << "Options \"-N\" or \"-O\" work only with OCpl or OCde.\n";
			std::exit(EXIT_FAILURE);
		}
		if (get_not_found && get_owned) {
			std::cout << "Options \"-N\" and \"-O\" are mutually exclusive.\n";
			std::exit(EXIT_FAILURE);
		}
	}

	if (trail && anim) {
		std::cout << "Options \"-a\" and \"-t\" are mutually exclusive.\n";
		std::exit(EXIT_FAILURE);
	}

	if (use_oc) {
		if (!ocpl_user_uuid.empty() || !ocpl_user.empty()) {
			Okapi OCpl(ocpl_url, ocpl_key);
			if (!ocpl_user.empty()) ocpl_user_uuid = OCpl.get_uuid(ocpl_user);
			Caches tmp = OCpl.get_user_caches(ocpl_user_uuid, 0);
			std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
			ocpl_user_profile = OCpl.get_profile_url(ocpl_user_uuid);
		}
		if (!ocde_user_uuid.empty() || !ocde_user.empty()) {
			Okapi OCde(ocde_url, ocde_key);
			if (!ocde_user.empty()) ocde_user_uuid = OCde.get_uuid(ocde_user);
			Caches tmp = OCde.get_user_caches(ocde_user_uuid, 0);
			std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
			ocde_user_profile = OCde.get_profile_url(ocde_user_uuid);
		}
		if (!ocus_user_uuid.empty() || !ocus_user.empty()) {
			Okapi OCus(ocus_url, ocus_key);
			if (!ocus_user.empty()) ocus_user_uuid = OCus.get_uuid(ocus_user);
			Caches tmp = OCus.get_user_caches(ocus_user_uuid, 0);
			std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
			ocus_user_profile = OCus.get_profile_url(ocus_user_uuid);
		}
		if (!ocnl_user_uuid.empty() || !ocnl_user.empty()) {
			Okapi OCnl(ocnl_url, ocnl_key);
			if (!ocnl_user.empty()) ocnl_user_uuid = OCnl.get_uuid(ocnl_user);
			Caches tmp = OCnl.get_user_caches(ocnl_user_uuid, 0);
			std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
			ocnl_user_profile = OCnl.get_profile_url(ocnl_user_uuid);
		}
		if (!ocro_user_uuid.empty() || !ocro_user.empty()) {
			Okapi OCro(ocro_url, ocro_key);
			if (!ocro_user.empty()) ocro_user_uuid = OCro.get_uuid(ocro_user);
			Caches tmp = OCro.get_user_caches(ocro_user_uuid, 0);
			std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
			ocro_user_profile = OCro.get_profile_url(ocro_user_uuid);
		}
		if (!ocuk_user_uuid.empty() || !ocuk_user.empty()) {
			Okapi OCuk(ocuk_url, ocuk_key);
			if (!ocuk_user.empty()) ocuk_user_uuid = OCuk.get_uuid(ocuk_user);
			Caches tmp = OCuk.get_user_caches(ocuk_user_uuid, 0);
			std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
			ocuk_user_profile = OCuk.get_profile_url(ocuk_user_uuid);
		}
	}

// 	if (!gpx_file.empty()) {
// 		GPX gpxfile(gpx_file);
// 		Caches tmp = gpxfile.get_user_caches();
// 		std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
// 	}

	if (use_ocdb) {
		if (!ocpl_user_uuid.empty() || !ocpl_user.empty()) {
			OCdb db(Database_pl);
			if (!ocpl_user.empty()) {
				Okapi OCpl(ocpl_url, ocpl_key);
				ocpl_user_uuid = OCpl.get_uuid(ocpl_user);
				ocpl_user_profile = OCpl.get_profile_url(ocpl_user_uuid);
			}
			if (get_not_found) {
				Caches tmp = db.get_user_caches_not_found(ocpl_user_uuid);
				Okapi OCpl(ocpl_url, ocpl_key);
				OCpl.update_caches(tmp);
				std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
				region_count = db.get_region_stats();
			} else if (get_owned) {
				Caches tmp = db.get_user_caches_owned(ocpl_user_uuid);
				Okapi OCpl(ocpl_url, ocpl_key);
				OCpl.update_caches(tmp);
				std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
			} else {
				Caches tmp = db.get_user_caches(ocpl_user_uuid, 0);
				std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
			}
		}
		if (!ocde_user_uuid.empty() || !ocde_user.empty()) {
			OCdb db(Database_de);
			if (!ocde_user.empty()) {
				Okapi OCde(ocde_url, ocde_key);
				ocde_user_uuid = OCde.get_uuid(ocde_user);
				ocde_user_profile = OCde.get_profile_url(ocde_user_uuid);
			}
			if (get_not_found) {
				Caches tmp = db.get_user_caches_not_found(ocde_user_uuid);
				Okapi OCde(ocde_url, ocde_key);
				OCde.update_caches(tmp);
				std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
// 				region_count = db.get_region_stats();
			} else if (get_owned) {
				Caches tmp = db.get_user_caches_owned(ocde_user_uuid);
				Okapi OCde(ocde_url, ocde_key);
				OCde.update_caches(tmp);
				std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
			} else {
				Caches tmp = db.get_user_caches(ocde_user_uuid, 0);
				std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
			}
		}
	}

	// TODO: some cache deduplication is needed

	Debug(2) << "Caches read: " << cc.size() << '\n';
	if (cc.size() == 0) {
		std::cout << "No caches found, aborting.\n";
		std::exit(EXIT_FAILURE);
	}

	// Prepare a set of regions
	Country poland({ "dolnoslaskie",
					 "gornoslaskie",
					 "kujawsko-pomorskie",
					 "lodzkie",
					 "lubelskie",
					 "lubuskie",
					 "malopolskie",
					 "mazowieckie",
					 "opolskie",
					 "podkarpackie",
					 "podlaskie",
					 "pomorskie",
					 "swietokrzyskie",
					 "warminsko-mazurskie",
					 "wielkopolskie",
					 "zachodniopomorskie" });

	// Prepare sorted list of caches, excluding moving caches
	std::map<std::string, int> dates;
	Date_Caches sorted_caches;
	Date_Caches sorted_fcaches;
	Date_Caches sorted_caches_by_hidden;
	pCaches caches_by_fav;
	pCaches caches_by_fav_perc;
	pCaches caches_by_finds;
	// pCaches caches_by_rating;
	pCaches fcc;

	if (!get_not_found) {
		for (auto i = cc.begin(); i != cc.end();) {
			if (time_filter && (i->date_t > end_time || i->date_t < start_time)) {
				i = cc.erase(i);
				continue;
			}

			poland.locate(*i);

			dates[i->date]++;
			sorted_caches.insert({ i->date_t, &*i });
			if ((i->type != "Moving" && i->type != "Own") || get_owned) {
				sorted_fcaches.insert({ i->date_t, &*i });
				fcc.push_back(&*i);
			}
			sorted_caches_by_hidden.insert({ i->date_hidden_t, &*i });
			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);

			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; });
	} else {
		for (auto& i : cc) {
			if (i.type != "Moving" && i.type != "Own" && (!exclude_quiz || i.type != "Quiz")) {
				fcc.push_back(&i);
				poland.locate(i);
			}
		}
	}

	header_html();

	std::cout << "<header>\n";
	std::cout << "<h1><a href=\"/geo\">Geocaching stats</a> for user profiles:</h1>\n";
	if (!ocpl_user.empty())
		std::cout << "<img alt=\"OCpl\" src=\"https://wiki.opencaching.eu/images/b/b7/Oc-pl.png\"> <a href=\"" << ocpl_user_profile << "\">" << ocpl_user << "</a><br>\n";
	if (!ocde_user.empty())
		std::cout << "<img alt=\"OCde\" src=\"https://wiki.opencaching.eu/images/c/c1/Oc-de.png\"> <a href=\"" << ocde_user_profile << "\">" << ocde_user << "</a><br>\n";
	if (!ocus_user.empty())
		std::cout << "<img alt=\"OCna\" src=\"https://wiki.opencaching.eu/images/f/fb/Oc-us.png\"> <a href=\"" << ocus_user_profile << "\">" << ocus_user << "</a><br>\n";
	if (!ocnl_user.empty())
		std::cout << "<img alt=\"OCnl\" src=\"https://wiki.opencaching.eu/images/4/4b/Oc-nl.png\"> <a href=\"" << ocnl_user_profile << "\">" << ocnl_user << "</a><br>\n";
	if (!ocro_user.empty())
		std::cout << "<img alt=\"OCro\" src=\"https://wiki.opencaching.eu/images/4/4f/Oc-ro.png\"> <a href=\"" << ocro_user_profile << "\">" << ocro_user << "</a><br>\n";
	if (!ocuk_user.empty())
		std::cout << "<img alt=\"OCuk\" src=\"https://wiki.opencaching.eu/images/5/58/Oc-org-uk.png\"> <a href=\"" << ocuk_user_profile << "\">" << ocuk_user << "</a><br>\n";

	if (time_filter) {
		std::cout << "for time range " << std::put_time(std::localtime(&start_time), "%x") << "&mdash;" << std::put_time(std::localtime(&end_time), "%x");
	}

	std::cout << "</header>\n";

	if (!heat_file.empty()) {
		const Map* chosen_map;
		if (maps.count(heat_map) > 0)
			chosen_map = &maps.at(heat_map);
		else {
			std::cout << "Map " << heat_map << " not found.\n";
			std::exit(EXIT_FAILURE);
		}
		Heat hmap(chosen_map);
		if (trail) {
			if (sorted_fcaches.size() < 2) {
				std::cout << "You need at least 2 caches for a trail.\n";
				std::exit(EXIT_FAILURE);
			}
			hmap.generate_path(heat_file, sorted_fcaches);
		} else if (anim)
			hmap.generate_anim(heat_file, sorted_fcaches, heat_stamp_size);
		else
			hmap.generate(heat_file, fcc, heat_stamp_size, (heat_exp == 1 ? "exp" : "soft"));
		if (!anim)
			std::cout << "<figure>\n<img class=\"heatmap\" src=\"" << heat_file << "\" alt=\"heat map\">\n</figure>\n";
		else {
			std::cout << "<script src=\"components/webcomponentsjs/webcomponents-loader.js\"></script>\n<script src=\"components/gif-player/dist/gif-player.es6.js\" defer async></script>";
			std::cout << "<figure class=\"heatmap\">\n<gif-player class=\"heatmap\" src=\"" << heat_file << "\" alt=\"heat map\" speed=\"1\" play prerender></gif-player>\n</figure>\n";
			std::cout << "<noscript>\n";
			std::cout << "<figure>\n<img class=\"heatmap\" src=\"" << heat_file << "\" alt=\"heat map\">\n</figure>\n";
			std::cout << "</noscript>\n";
		}
	}

	if (!get_not_found && !get_owned) {
		short count;
		std::string codes;
		int n;

		std::cout << "<div class=\"basic_stats\">\n";
		std::cout << "Number of caches found: <span class=\"value\">" << cc.size() << "</span><br>\n";

		auto best_day = std::max_element(dates.begin(), dates.end(), [&](const auto& a, const auto& b) { return a.second < b.second; });
		std::cout << "Number of caching days: <span class=\"value\">" << dates.size() << "</span><br>\n";
		std::cout << "Average caches per caching day: <span class=\"value\">" << std::setprecision(3) << (1.0 * cc.size()) / dates.size() << "</span><br>\n";
		std::cout << std::resetiosflags(std::cout.flags());
		std::cout << "Number of caches that are now archived: <span class=\"value\">" << std::count_if(cc.begin(), cc.end(), [&](const auto& a) { return a.status == archived; }) << "</span><br>\n";
		std::cout << "<details class=\"days\"><summary>Best caching day: <span class=\"value\">" << best_day->first << "</span>, found <span class=\"value\">" << best_day->second << "</span> caches</summary>\n";
		std::cout << "  <p>\n";
		for (auto& i : dates)
			std::cout << i.first << ", found " << i.second << " caches<br>\n";
		std::cout << "  </p>\n</details>\n";

		std::time_t streak;
		int longest_str = find_streak(sorted_caches, streak);
		char str_tmp[20];
		std::tm* str_tm = std::localtime(&streak);
		std::strftime(str_tmp, 20, "%F", str_tm);
		std::cout << "Longest caching streak: <span class=\"value\">" << longest_str << "</span> starting on <span class=\"value\">" << str_tmp << "</span><br>\n";

		float tot_dist = 0;
		for (auto i = sorted_fcaches.begin(); i != std::prev(sorted_fcaches.end()); i++) {
			//std::cout << "Distance between " << i->second->name << " and " << std::next(i)->second->name << " is " << cache_distance(*i->second, *std::next(i)->second) << "<br>";
			tot_dist += cache_distance(*i->second, *std::next(i)->second);
		}
		std::cout << "Total distance between caches: <span class=\"value\">" << std::fixed << tot_dist << "</span> km (equivalent to <span class=\"value\">" << tot_dist / (2 * M_PI * Earth_radius) << "x</span> trips around Earth or <span class=\"value\">" << tot_dist / Moon_dist << "x</span> trips to the Moon)<br>\n";
		std::cout << std::resetiosflags(std::cout.flags());
		if (sorted_fcaches.size() > 1)
			std::cout << "Average distance between caches: <span class=\"value\">" << tot_dist / (sorted_fcaches.size() - 1) << "</span> km<br>\n";
		std::cout << "</div>\n";

		short y_min = std::min_element(cc.begin(), cc.end(), [&](const Cache& a, const Cache& b) { return a.date_tm.tm_year < b.date_tm.tm_year; })->date_tm.tm_year;
		short y_max = std::max_element(cc.begin(), cc.end(), [&](const Cache& a, const Cache& b) { return a.date_tm.tm_year < b.date_tm.tm_year; })->date_tm.tm_year;

		long max = 0; // maximal value for histogram
		for (int i = y_min; i <= y_max; i++)
			for (int j = 1; j <= 12; j++)
				max = std::max(max, std::count_if(cc.begin(), cc.end(), [i, j](Cache c) { return (c.date_tm.tm_year == i && c.date_tm.tm_mon == j - 1); }));

		if (max > 0) {
			std::cout << "<h2>Caching timeline</h2>\n";
			std::cout << "<table class=\"calendar_tab\">\n";
			std::cout << "<tr><th></th>";
			for (int j = 1; j <= 12; j++) { // print table month headers
				std::cout << "<th>" << j << "</th>";
			}
			std::cout << "</tr>\n";

			for (int i = y_min; i <= y_max; i++) { // i -> years in rows
				std::cout << "<tr><th>" << i + 1900 << "</th> ";
				for (int j = 1; j <= 12; j++) { // j -> months in cols
					count = std::count_if(cc.begin(), cc.end(), [i, j](Cache c) { return (c.date_tm.tm_year == i && c.date_tm.tm_mon == j - 1); });
					std::cout << "<td style=\"--percent: " << count * 100 / max << "%\"><span>" << count << "</span></td>";
				}
				std::cout << "</tr>\n";
			}
			std::cout << "</table>\n";
		}

		std::cout << "<h2>Caching days per month</h2>\n";
		std::cout << "<table class=\"calendar_tab\">\n";
		std::cout << "<tr><th></th>";
		for (int j = 1; j <= 12; j++) { // print table month headers
			std::cout << "<th>" << j << "</th>";
		}
		std::cout << "</tr>\n";

		max = 31; // maximal value for histogram

		for (int i = y_min; i <= y_max; i++) { // i -> years in rows
			std::cout << "<tr><th>" << i + 1900 << "</th> ";
			for (int j = 1; j <= 12; j++) { // j -> months in cols
				std::map<int, int> days_count;
				for (auto el : cc) {
					if (el.date_tm.tm_mon == j - 1 && el.date_tm.tm_year == i)
						days_count[el.date_tm.tm_mday]++;
				}
				std::cout << "<td style=\"--percent: " << days_count.size() * 100 / max << "%\"><span>" << days_count.size() << "</span></td>";
			}
			std::cout << "</tr>\n";
		}
		std::cout << "</table>\n";

// 		auto far = std::max_element(fcc.begin(), fcc.end(), [&](const Cache& a, const Cache& b) { return a.distance() < b.distance(); });
// 		auto near = std::min_element(fcc.begin(), fcc.end(), [&](const Cache& a, const Cache& b) { return a.distance() < b.distance(); });
//
// 		std::cout << "Nearest cache: " << near->distance() << " km\n";
// 		near->show();
// 		std::cout << "Furthest cache: " << far->distance() << " km\n";
// 		far->show();

// 		show_histogram(cc, &Cache::year_month, "Caching timeline", 1, 0);
		show_histogram(cc, &Cache::owner, "Cache owners", 1);
		show_histogram(cc, &Cache::type, "Cache types", 1);
		show_histogram(cc, &Cache::size, "Cache sizes", 1);
		// 		show_histogram(fcc, &Cache::region, "Regions", 1);
		// 		show_histogram(fcc, &Cache::subregion, "Subregions", 1);
		show_histogram(fcc, &Cache::country, "Countries", 1);
		show_nested_histogram(fcc, &Cache::region, &Cache::subregion, "Regions", 1);
		show_histogram(cc, &Cache::day_of_week, "Days of the week", 1, 0);
		show_histogram(cc, &Cache::mon, "Months", 1, 0);
		show_histogram(cc, &Cache::year, "Years", 1, 0);

		auto N = *std::max_element(fcc.begin(), fcc.end(), [&](const Cache* a, const Cache* b) { return a->pos.lat < b->pos.lat; });
		auto S = *std::min_element(fcc.begin(), fcc.end(), [&](const Cache* a, const Cache* b) { return a->pos.lat < b->pos.lat; });
		auto E = *std::max_element(fcc.begin(), fcc.end(), [&](const Cache* a, const Cache* b) { return a->pos.lon < b->pos.lon; });
		auto W = *std::min_element(fcc.begin(), fcc.end(), [&](const Cache* a, const Cache* b) { return a->pos.lon < b->pos.lon; });

		std::cout << "<h2>Geographically extreme caches</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr>\n";
		std::cout << "  <th>North:</th><td>" << N->link_name() << "</td><td>" << N->region << "</td><td>" << N->pos.lat << "</td>\n";
		std::cout << "</tr><tr>\n";
		std::cout << "  <th>South:</th><td>" << S->link_name() << "</td><td>" << S->region << "</td><td>" << S->pos.lat << "</td>\n";
		std::cout << "</tr><tr>\n";
		std::cout << "  <th>East:</th> <td>" << E->link_name() << "</td><td>" << E->region << "</td><td>" << E->pos.lon << "</td>\n";
		std::cout << "</tr><tr>\n";
		std::cout << "  <th>West:</th> <td>" << W->link_name() << "</td><td>" << W->region << "</td><td>" << W->pos.lon << "</td>\n";
		std::cout << "</tr>\n";
		std::cout << "</table>\n";

		const int LIST_MAX = 15;
		n = 1;

		std::cout << "<h2>Oldest caches found</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Region</th>";
		std::cout << "<th>Date hidden</th>";
		std::cout << "<th>Date found</th>";
		std::cout << "</tr>\n";

		for (auto i = sorted_caches_by_hidden.begin(); i != sorted_caches_by_hidden.end(); i++) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << i->second->link_name() << "</td>";
			std::cout << "<td>" << i->second->type << "</td>";
			std::cout << "<td>" << i->second->region << "</td>";
			std::cout << "<td>" << i->second->date_hidden << "</td>";
			std::cout << "<td>" << i->second->date << "</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

		n = 1;

		std::cout << "<h2>Newest caches found</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Region</th>";
		std::cout << "<th>Date hidden</th>";
		std::cout << "<th>Date found</th>";
		std::cout << "</tr>\n";

		for (auto i = sorted_caches_by_hidden.rbegin(); i != sorted_caches_by_hidden.rend(); i++) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << i->second->link_name() << "</td>";
			std::cout << "<td>" << i->second->type << "</td>";
			std::cout << "<td>" << i->second->region << "</td>";
			std::cout << "<td>" << i->second->date_hidden << "</td>";
			std::cout << "<td>" << i->second->date << "</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

		std::cout << "<div class=\"basic_stats\">\n";
		std::cout << "Average age of cache at the moment of finding: <span class=\"value\">" << average(cc, &Cache::age_when_found) / 365 * 12 << "</span> months<br>\n";
		std::cout << "Number of caches found within first 24h: <span class=\"value\">" << std::count_if(cc.begin(), cc.end(), [&](const auto& a) { return a.age_when_found == 0; }) << "</span><br>\n";
		std::cout << "Number of caches found within first 48h: <span class=\"value\">" << std::count_if(cc.begin(), cc.end(), [&](const auto& a) { return a.age_when_found <= 1; }) << "</span><br>\n";
		std::cout << "Number of caches found during first week: <span class=\"value\">" << std::count_if(cc.begin(), cc.end(), [&](const auto& a) { return a.age_when_found < 7; }) << "</span><br>\n";
		std::cout << "Number of caches found during first month: <span class=\"value\">" << std::count_if(cc.begin(), cc.end(), [&](const auto& a) { return a.age_when_found < 30; }) << "</span><br>\n";
		std::cout << "Number of caches found after more than 5 years: <span class=\"value\">" << std::count_if(cc.begin(), cc.end(), [&](const auto& a) { return a.age_when_found > 365 * 5; }) << "</span><br>\n";
		std::cout << "Number of caches found after more than 10 years: <span class=\"value\">" << std::count_if(cc.begin(), cc.end(), [&](const auto& a) { return a.age_when_found > 365 * 10; }) << "</span><br>\n";
		std::cout << "</div>\n";

		n = 1;

		std::cout << "<h2>Caches with most recommendations</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Region</th>";
		std::cout << "<th>Rec.</th>";
		std::cout << "<th>Finds</th>";
		std::cout << "<th>%</th>";
		std::cout << "</tr>\n";

		for (auto i : caches_by_fav) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << i->link_name() << "</td>";
			std::cout << "<td>" << i->type << "</td>";
			std::cout << "<td>" << i->region << "</td>";
			std::cout << "<td>" << i->fav << "</td>";
			std::cout << "<td>" << i->founds << "</td>";
			std::cout << "<td>" << std::setprecision(3) << 100.0 * i->fav / i->founds << "%</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

		average_html(cc, &Cache::fav, "number of recommendations");

		n = 1;

		std::cout << "<h2>Caches with most recommendations (percentage)</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Region</th>";
		std::cout << "<th>Rec.</th>";
		std::cout << "<th>Finds</th>";
		std::cout << "<th>%</th>";
		std::cout << "</tr>\n";

		for (auto i : caches_by_fav_perc) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << i->link_name() << "</td>";
			std::cout << "<td>" << i->type << "</td>";
			std::cout << "<td>" << i->region << "</td>";
			std::cout << "<td>" << i->fav << "</td>";
			std::cout << "<td>" << i->founds << "</td>";
			std::cout << "<td>" << std::setprecision(3) << 100.0 * i->fav / i->founds << "%</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

/*
		n = 1;

		std::cout << "<h2>Caches with highest rating</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Region</th>";
		std::cout << "<th>Rating</th>";
		std::cout << "<th>Finds</th>";
		std::cout << "</tr>\n";

		for (auto i : caches_by_rating) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << i->link_name() << "</td>";
			std::cout << "<td>" << i->type << "</td>";
			std::cout << "<td>" << i->region << "</td>";
			std::cout << "<td>" << i->rating << "</td>";
			std::cout << "<td>" << i->founds << "</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

		average_html(cc, &Cache::rating, "rating");
*/

		n = 1;

		std::cout << "<h2>Caches with most finds</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Region</th>";
		std::cout << "<th>Date hidden</th>";
		std::cout << "<th>Finds</th>";
		std::cout << "</tr>\n";

		for (auto i : caches_by_finds) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << i->link_name() << "</td>";
			std::cout << "<td>" << i->type << "</td>";
			std::cout << "<td>" << i->region << "</td>";
			std::cout << "<td>" << i->date_hidden << "</td>";
			std::cout << "<td>" << i->founds << "</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

		average_html(cc, &Cache::founds, "number of finds");

		n = 1;

		std::cout << "<h2>Caches with least finds</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Region</th>";
		std::cout << "<th>Date hidden</th>";
		std::cout << "<th>Finds</th>";
		std::cout << "</tr>\n";

		for (auto i = caches_by_finds.rbegin(); i != caches_by_finds.rend(); i++) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << (*i)->link_name() << "</td>";
			std::cout << "<td>" << (*i)->type << "</td>";
			std::cout << "<td>" << (*i)->region << "</td>";
			std::cout << "<td>" << (*i)->date_hidden << "</td>";
			std::cout << "<td>" << (*i)->founds << "</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

		//		D/T matrix
		n = 0;

		std::cout << "<h2>Difficulty / terrain matrix</h2>\n";
		std::cout << "<table class=\"dt\">\n";
		std::cout << "<tr><th></th>";
		for (int j = 2; j <= 10; j++) { // print table terr headers
			std::cout << "<th>" << j / 2.0 << "</th>";
		}
		std::cout << "</tr>\n";

		for (int i = 2; i <= 10; i++) { // i -> diff in rows
			std::cout << "<tr><th>" << i / 2.0 << "</th> ";
			for (int j = 2; j <= 10; j++) { // j -> terr in cols
				count = count_caches(cc, codes, [i, j](const Cache& c) -> bool { return (c.diff == i / 2.0 && c.terr == j / 2.0); });
				if (count == 0)
					std::cout << "<td class=\"dt_zero\">" << 0 << "</td>";
				else {
					std::cout << "<td codes=\"" << codes << "\">" << count << "</td>";
					n++;
				}
			}
			std::cout << "</tr>\n";
		}
		std::cout << "</table>\n";

		std::cout << "<div class=\"basic_stats\">\n";
		std::cout << "Total <span class=\"value\">" << n << "</span> combinations found out of 81 (" << std::setprecision(3) << n / 0.81 << "%).<br>\n";
		std::cout << "Average difficulty: <span class=\"value\">" << average(cc, &Cache::diff) << "</span><br>\n";
		std::cout << "Average terrain: <span class=\"value\">" << average(cc, &Cache::terr) << "</span><br>\n";
		std::cout << "</div>\n";

		//		Days matrix
		n = 0;

		std::cout << "<h2>Caching days matrix</h2>\n";
		std::cout << "<table class=\"dt\">\n";
		std::cout << "<tr><th></th>";
		for (int j = 1; j <= 31; j++) { // print table day headers
			std::cout << "<th>" << j << "</th>";
		}
		std::cout << "<th></th></tr>\n";

		for (int i = 1; i <= 12; i++) { // i -> months in rows
			int m = 0;
			std::cout << "<tr><th>" << i << "</th> ";
			for (int j = 1; j <= 31; j++) { // j -> days in cols
				count = count_caches(cc, codes, [i, j](const Cache& c) -> bool { return (c.date_tm.tm_mon == i - 1 && c.date_tm.tm_mday == j); });
				if (count == 0) {
					if ((j == 31 && (i == 2 || i == 4 || i == 6 || i == 9 || i == 11)) || (j == 30 && i == 2))
						std::cout << "<td class=\"dt_null\"></td>";
					else
						std::cout << "<td class=\"dt_zero\">" << 0 << "</td>";
				} else {
					std::cout << "<td codes=\"" << codes << "\">" << count << "</td>";
					n++;
					m++;
				}
			}
			float perc;
			switch(i) {
				case 4:
				case 6:
				case 9:
				case 11:
					perc = m * 100.0 / 30;
					break;
				case 2:
					perc = m * 100.0 / 29;
					break;
				default:
					perc = m * 100.0 / 31;
			}
			std::cout << "<th>" << perc << "%</th>";
			std::cout << "</tr>\n";
		}
		std::cout << "</table>\n";

		std::cout << "<div class=\"basic_stats\">\n";
		std::cout << "Total <span class=\"value\">" << n << "</span> days out of 366 (" << std::setprecision(3) << n / 3.66 << "%).\n";
		std::cout << "</div>\n";

		//		Hidden months matrix
		n = 0;

		y_min = std::min_element(cc.begin(), cc.end(), [&](const Cache& a, const Cache& b) { return a.date_hidden_tm.tm_year < b.date_hidden_tm.tm_year; })->date_hidden_tm.tm_year;
		y_max = std::max_element(cc.begin(), cc.end(), [&](const Cache& a, const Cache& b) { return a.date_hidden_tm.tm_year < b.date_hidden_tm.tm_year; })->date_hidden_tm.tm_year;

		std::cout << "<h2>Caches by hidden month matrix</h2>\n";
		std::cout << "<table class=\"dt\">\n";
		std::cout << "<tr><th></th>";
		for (int j = 1; j <= 12; j++) { // print table month headers
			std::cout << "<th>" << j << "</th>";
		}
		std::cout << "<th></th></tr>\n";

		std::time_t now = std::time(nullptr);
		std::tm* now_tm = std::localtime(&now);

		for (int i = y_min; i <= y_max; i++) { // i -> years in rows
			int m = 0;
			std::cout << "<tr><th>" << i + 1900 << "</th> ";
			for (int j = 1; j <= 12; j++) { // j -> months in cols
				count = count_caches(cc, codes, [i, j](const Cache& c) -> bool { return (c.date_hidden_tm.tm_year == i && c.date_hidden_tm.tm_mon == j - 1); });
				if (count == 0) {
					if ((!ocpl_user_uuid.empty() && ocde_user_uuid.empty() && i + 1900 == 2006 && j < 5) ||
						(!ocde_user_uuid.empty() && i + 1900 == 2005 && j < 8))
						std::cout << "<td class=\"dt_null\"></td>";
					else
						std::cout << "<td class=\"dt_zero\">" << 0 << "</td>";
				}
				else {
					std::cout << "<td codes=\"" << codes << "\">" << count << "</td>";
					n++;
					m++;
				}
			}
			if (now_tm) {
				if (i == now_tm->tm_year)
					std::cout << "<th>" << m * 100.0 / (now_tm->tm_mon + 1) << "%</th>";
				else
					std::cout << "<th>" << m * 100.0 / 12 << "%</th>";
			}
			std::cout << "</tr>\n";
		}
		std::cout << "</table>\n";

		if (now_tm) {
			if (!ocpl_user_uuid.empty() && ocde_user_uuid.empty()) {
				int m_count = (now_tm->tm_year - 106 - 1) * 12 + 8 + now_tm->tm_mon + 1; // 106 corresponds to 2006, 8 is no. of months since may till dec, +1 since tm_mon starts at 0
				std::cout << "<div class=\"basic_stats\">\n";
				std::cout << "Total <span class=\"value\">" << n << "</span> months out of  " << m_count << " (" << std::setprecision(3) << n * 100.0 / m_count << "%).\n";
			std::cout << "</div>\n";
			} else if (!ocde_user_uuid.empty()) {
				int m_count = (now_tm->tm_year - 105 - 1) * 12 + 5 + now_tm->tm_mon + 1; // 106 corresponds to 2005, 8 is no. of months since aug till dec, +1 since tm_mon starts at 0
				std::cout << "<div class=\"basic_stats\">\n";
				std::cout << "Total <span class=\"value\">" << n << "</span> months out of  " << m_count << " (" << std::setprecision(3) << n * 100.0 / m_count << "%).\n";
			std::cout << "</div>\n";
			}
		}
	} // end of main if

	if (get_not_found) {
		std::cout << "<div class=\"basic_stats\">\n";
		std::cout << "Still <span class=\"value\">" << cc.size() << "</span> caches to be found...<br>\n";
		std::cout << "</div>\n";

		show_nested_histogram(fcc, &Cache::region, &Cache::subregion, "Regions", 1);

		std::map<std::string, int> region_found_count;
		for (auto el : fcc)
			region_found_count[el->region]++;
		for (auto& i : region_count)
			if (i.second != 0) i.second = region_found_count[i.first] * 100 / i.second;
		show_histogram(region_count, "Percentage", 1);
	} // end of "not found" if

	if (get_owned) {
		short count;
		std::string codes;
		int n;

		std::cout << "<div class=\"basic_stats\">\n";
		std::cout << "Number of caches created: <span class=\"value\">" << cc.size() << "</span><br>\n";
		std::cout << "Number of caches that are disabled: <span class=\"value\">" << std::count_if(cc.begin(), cc.end(), [&](const auto& a) { return a.status == disabled; }) << "</span><br>\n";
		std::cout << "Number of caches that are archived: <span class=\"value\">" << std::count_if(cc.begin(), cc.end(), [&](const auto& a) { return a.status == archived; }) << "</span><br>\n";
		std::cout << "Average finds per cache per day: <span class=\"value\">" << std::setprecision(3) << std::accumulate(cc.begin(), cc.end(), 0., [&](const float& a, const Cache& b) { return std::move(a) + 1.0 * b.founds / std::max(b.age_now, 1); }) / cc.size() << "</span><br>\n";
		std::cout << std::resetiosflags(std::cout.flags());
		std::cout << "</div>\n";

		short y_min = std::min_element(cc.begin(), cc.end(), [&](const Cache& a, const Cache& b) { return a.date_hidden_tm.tm_year < b.date_hidden_tm.tm_year; })->date_hidden_tm.tm_year;
		short y_max = std::max_element(cc.begin(), cc.end(), [&](const Cache& a, const Cache& b) { return a.date_hidden_tm.tm_year < b.date_hidden_tm.tm_year; })->date_hidden_tm.tm_year;

		long max = 0; // maximal value for histogram
		for (int i = y_min; i <= y_max; i++)
			for (int j = 1; j <= 12; j++)
				max = std::max(max, std::count_if(cc.begin(), cc.end(), [i, j](Cache c) { return (c.date_hidden_tm.tm_year == i && c.date_hidden_tm.tm_mon == j - 1); }));

		if (max > 0) {
			std::cout << "<h2>Cache creation timeline</h2>\n";
			std::cout << "<table class=\"calendar_tab\">\n";
			std::cout << "<tr><th></th>";
			for (int j = 1; j <= 12; j++) { // print table month headers
				std::cout << "<th>" << j << "</th>";
			}
			std::cout << "</tr>\n";
			for (int i = y_min; i <= y_max; i++) { // i -> years in rows
				std::cout << "<tr><th>" << i + 1900 << "</th> ";
				for (int j = 1; j <= 12; j++) { // j -> months in cols
					count = std::count_if(cc.begin(), cc.end(), [i, j](Cache c) { return (c.date_hidden_tm.tm_year == i && c.date_hidden_tm.tm_mon == j - 1); });
					std::cout << "<td style=\"--percent: " << count * 100 / max << "%\"><span>" << count << "</span></td>";
				}
				std::cout << "</tr>\n";
			}
			std::cout << "</table>\n";
		}

// 		auto far = std::max_element(fcc.begin(), fcc.end(), [&](const Cache& a, const Cache& b) { return a.distance() < b.distance(); });
// 		auto near = std::min_element(fcc.begin(), fcc.end(), [&](const Cache& a, const Cache& b) { return a.distance() < b.distance(); });
//
// 		std::cout << "Nearest cache: " << near->distance() << " km\n";
// 		near->show();
// 		std::cout << "Furthest cache: " << far->distance() << " km\n";
// 		far->show();

		show_histogram(cc, &Cache::type, "Cache types", 1);
		show_histogram(cc, &Cache::size, "Cache sizes", 1);
		show_nested_histogram(fcc, &Cache::region, &Cache::subregion, "Regions", 1);

		auto N = *std::max_element(fcc.begin(), fcc.end(), [&](const Cache* a, const Cache* b) { return a->pos.lat < b->pos.lat; });
		auto S = *std::min_element(fcc.begin(), fcc.end(), [&](const Cache* a, const Cache* b) { return a->pos.lat < b->pos.lat; });
		auto E = *std::max_element(fcc.begin(), fcc.end(), [&](const Cache* a, const Cache* b) { return a->pos.lon < b->pos.lon; });
		auto W = *std::min_element(fcc.begin(), fcc.end(), [&](const Cache* a, const Cache* b) { return a->pos.lon < b->pos.lon; });

		std::cout << "<h2>Geographically extreme caches</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr>\n";
		std::cout << "  <th>North:</th><td>" << N->link_name() << "</td><td>" << N->pos.lat << "</td>\n";
		std::cout << "</tr><tr>\n";
		std::cout << "  <th>South:</th><td>" << S->link_name() << "</td><td>" << S->pos.lat << "</td>\n";
		std::cout << "</tr><tr>\n";
		std::cout << "  <th>East:</th> <td>" << E->link_name() << "</td><td>" << E->pos.lon << "</td>\n";
		std::cout << "</tr><tr>\n";
		std::cout << "  <th>West:</th> <td>" << W->link_name() << "</td><td>" << W->pos.lon << "</td>\n";
		std::cout << "</tr>\n";
		std::cout << "</table>\n";

		const int LIST_MAX = 15;
		n = 1;

		std::cout << "<h2>Caches with most recommendations</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Rec.</th>";
		std::cout << "<th>Finds</th>";
		std::cout << "<th>%</th>";
		std::cout << "</tr>\n";

		for (auto i : caches_by_fav) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << i->link_name() << "</td>";
			std::cout << "<td>" << i->type << "</td>";
			std::cout << "<td>" << i->fav << "</td>";
			std::cout << "<td>" << i->founds << "</td>";
			if (i->founds > 0)
				std::cout << "<td>" << std::setprecision(3) << 100.0 * i->fav / i->founds << "%</td>";
			else
				std::cout << "<td>&ndash;</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

		average_html(cc, &Cache::fav, "number of recommendations");
		sum_html(cc, &Cache::fav, "number of recommendations");

		n = 1;

		std::cout << "<h2>Caches with most recommendations (percentage)</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Rec.</th>";
		std::cout << "<th>Finds</th>";
		std::cout << "<th>%</th>";
		std::cout << "</tr>\n";

		for (auto i : caches_by_fav_perc) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << i->link_name() << "</td>";
			std::cout << "<td>" << i->type << "</td>";
			std::cout << "<td>" << i->fav << "</td>";
			std::cout << "<td>" << i->founds << "</td>";
			if (i->founds > 0)
				std::cout << "<td>" << std::setprecision(3) << 100.0 * i->fav / i->founds << "%</td>";
			else
				std::cout << "<td>&ndash;</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

/*
		n = 1;

		std::cout << "<h2>Caches with highest rating</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Rating</th>";
		std::cout << "<th>Finds</th>";
		std::cout << "</tr>\n";

		for (auto i : caches_by_rating) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << i->link_name() << "</td>";
			std::cout << "<td>" << i->type << "</td>";
			std::cout << "<td>" << i->rating << "</td>";
			std::cout << "<td>" << i->founds << "</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

		average_html(cc, &Cache::rating, "rating");
*/

		n = 1;

		std::cout << "<h2>Caches with most finds</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Date hidden</th>";
		std::cout << "<th>Finds</th>";
		std::cout << "</tr>\n";

		for (auto i : caches_by_finds) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << i->link_name() << "</td>";
			std::cout << "<td>" << i->type << "</td>";
			std::cout << "<td>" << i->date_hidden << "</td>";
			std::cout << "<td>" << i->founds << "</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

		average_html(cc, &Cache::founds, "number of finds");
		sum_html(cc, &Cache::founds, "number of finds");

		n = 1;

		std::cout << "<h2>Caches with least finds</h2>\n";
		std::cout << "<table class=\"list\">\n";
		std::cout << "<tr><th></th>";
		std::cout << "<th>Cache</th>";
		std::cout << "<th>Type</th>";
		std::cout << "<th>Date hidden</th>";
		std::cout << "<th>Finds</th>";
		std::cout << "</tr>\n";

		for (auto i = caches_by_finds.rbegin(); i != caches_by_finds.rend(); i++) {
			std::cout << "<tr><th>" << n << "</th> ";
			std::cout << "<td>" << (*i)->link_name() << "</td>";
			std::cout << "<td>" << (*i)->type << "</td>";
			std::cout << "<td>" << (*i)->date_hidden << "</td>";
			std::cout << "<td>" << (*i)->founds << "</td>";
			std::cout << "</tr>\n";
			n++;
			if (n > LIST_MAX) break;
		}
		std::cout << "</table>\n";

//		D/T matrix
		n = 0;

		std::cout << "<h2>Difficulty / terrain matrix</h2>\n";
		std::cout << "<table class=\"dt\">\n";
		std::cout << "<tr><th></th>";
		for (int j = 2; j <= 10; j++) { // print table terr headers
			std::cout << "<th>" << j / 2.0 << "</th>";
		}
		std::cout << "</tr>\n";

		for (int i = 2; i <= 10; i++) { // i -> diff in rows
			std::cout << "<tr><th>" << i / 2.0 << "</th> ";
			for (int j = 2; j <= 10; j++) { // j -> terr in cols
				count = count_caches(cc, codes, [i, j](const Cache& c) -> bool { return (c.diff == i / 2.0 && c.terr == j / 2.0); });
				if (count == 0)
					std::cout << "<td class=\"dt_zero\">" << 0 << "</td>";
				else {
					std::cout << "<td codes=\"" << codes << "\">" << count << "</td>";
					n++;
				}
			}
			std::cout << "</tr>\n";
		}
		std::cout << "</table>\n";

		std::cout << "<div class=\"basic_stats\">\n";
		std::cout << "Total <span class=\"value\">" << n << "</span> combinations created out of 81 (" << std::setprecision(3) << n / 0.81 << "%).<br>\n";
		std::cout << "Average difficulty: <span class=\"value\">" << average(cc, &Cache::diff) << "</span><br>\n";
		std::cout << "Average terrain: <span class=\"value\">" << average(cc, &Cache::terr) << "</span><br>\n";
		std::cout << "</div>\n";
	} // end of "owned" if

	footer_html();
}