2019-09-08 16:42:10 +00:00
# include "okapi.h"
2020-02-29 22:19:45 +00:00
// #include "gpx.h"
2019-09-08 16:42:10 +00:00
# include "cache.h"
# include "debug.h"
# include "heat.h"
2019-10-04 00:30:17 +00:00
# include "ocdb.h"
2020-01-25 11:05:38 +00:00
# include "common.h"
2020-04-03 00:23:16 +00:00
# include "region.h"
2019-09-08 16:42:10 +00:00
# include <iostream>
# include <iomanip>
# include <algorithm>
# include <unistd.h>
2019-09-11 17:48:03 +00:00
2019-11-04 20:34:29 +00:00
void show_usage ( ) {
2020-01-25 11:05:38 +00:00
std : : cout < < " Usage: geostat [options] \n " ;
2020-08-06 19:14:10 +00:00
std : : cout < < " Generate HTML stats from Opencaching data. \n \n " ;
2020-01-01 23:37:28 +00:00
std : : cout < < " * Data sources: \n " ;
std : : cout < < " \t -o[user] \t use Opencaching; if specified user will be a user name used for all OC instances \n " ;
std : : cout < < " \t -p user \t \t user for opencaching.pl \n " ;
std : : cout < < " \t -d user \t \t user for opencaching.de \n " ;
std : : cout < < " \t -u user \t \t user for opencaching.us \n " ;
std : : cout < < " \t -n user \t \t user for opencaching.nl \n " ;
std : : cout < < " \t -r user \t \t user for opencaching.ro \n " ;
std : : cout < < " \t -k user \t \t user for opencaching.uk \n " ;
2020-02-29 22:19:45 +00:00
// std::cout << "\t-g file\t\tuse specified gpx file\n";
2020-01-01 23:37:28 +00:00
std : : cout < < " \t -q \t \t use local SQLite file with dump of OC database \n " ;
2020-02-23 01:42:25 +00:00
std : : cout < < " \t -i timestamp \t start date \n " ;
std : : cout < < " \t -f timestamp \t finish date \n " ;
2019-11-04 20:34:29 +00:00
std : : cout < < " * Output: \n " ;
2020-01-01 23:37:28 +00:00
std : : cout < < " \t -N \t \t compute stats only for unfound caches (works only with SQLite) \n " ;
2020-01-25 15:34:18 +00:00
std : : cout < < " \t -Q \t \t exclude quiz caches from unfound caches \n " ;
2020-01-01 23:37:28 +00:00
std : : cout < < " \t -H file \t \t render a heat map to a file \n " ;
std : : cout < < " \t -s n \t \t stamp size for a heat map (default = 15) \n " ;
std : : cout < < " \t -e \t \t use exponential to flatten the heat map \n " ;
2020-02-02 11:27:32 +00:00
std : : cout < < " \t -t \t \t draw trail instead of heat map \n " ;
2020-01-25 11:37:00 +00:00
std : : cout < < " \t -m map \t \t chosen map: Poland, Poland_relief, Poland_big, Europe, World or a name of voivodeship (default = Poland) \n " ;
2020-01-01 23:37:28 +00:00
std : : cout < < " \t -h \t \t display this help screen \n " ;
2019-11-04 20:34:29 +00:00
std : : exit ( EXIT_FAILURE ) ;
}
2019-09-08 16:42:10 +00:00
int main ( int argc , char * * argv ) {
std : : string heat_file ;
int heat_stamp_size = 15 ;
2019-10-06 11:08:09 +00:00
std : : string heat_map = " Poland " ;
2019-09-12 12:07:46 +00:00
bool heat_exp = 0 ;
2020-02-02 11:27:32 +00:00
bool trail = 0 ;
2020-01-01 23:37:28 +00:00
bool use_oc = 0 ;
2019-10-04 00:30:17 +00:00
bool use_ocpl_db = 0 ;
bool get_not_found = 0 ;
2020-08-01 21:00:50 +00:00
bool get_owned = 0 ;
2020-01-25 15:34:18 +00:00
bool exclude_quiz = 0 ;
2020-02-23 01:26:23 +00:00
std : : time_t start_time = 0 ;
std : : time_t end_time = std : : time ( nullptr ) ;
2020-02-23 01:42:25 +00:00
bool time_filter = 0 ;
2020-01-04 18:27:04 +00:00
2019-09-08 16:42:10 +00:00
std : : string ocpl_user ;
2020-01-01 23:37:28 +00:00
std : : string ocde_user ;
std : : string ocus_user ;
std : : string ocnl_user ;
std : : string ocro_user ;
std : : string ocuk_user ;
2020-01-04 18:27:04 +00:00
2020-01-04 18:24:00 +00:00
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 ;
2020-01-04 18:27:04 +00:00
2019-09-08 16:42:10 +00:00
std : : string ocpl_url = " https://opencaching.pl/okapi/ " ;
2020-01-01 23:37:28 +00:00
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/ " ;
2020-01-04 18:27:04 +00:00
2019-10-04 00:30:17 +00:00
const std : : string Database = " ocpl.sqlite " ;
2020-01-04 18:27:04 +00:00
2020-02-29 22:19:45 +00:00
// std::string gpx_file;
2019-09-08 16:42:10 +00:00
# include "config_user.h"
2019-11-04 20:34:29 +00:00
if ( argc = = 1 ) show_usage ( ) ;
2019-09-08 16:42:10 +00:00
int o ;
2020-08-01 21:00:50 +00:00
while ( ( o = getopt ( argc , argv , " qNOQD:o::p:d:u:n:r:k:i:f:H:s:m:eth? " ) ) ! = - 1 )
2019-09-08 16:42:10 +00:00
switch ( o ) {
2020-04-03 00:18:57 +00:00
case ' D ' :
Debug : : set_debug_level ( get_num ( ' d ' , optarg ) ) ;
break ;
2020-02-29 22:19:45 +00:00
// case 'g':
// gpx_file = optarg;
// break;
2020-01-01 23:37:28 +00:00
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 ;
2019-09-08 16:42:10 +00:00
case ' p ' :
2020-01-01 23:37:28 +00:00
ocpl_user = optarg ;
break ;
case ' d ' :
ocde_user = optarg ;
2019-09-08 16:42:10 +00:00
break ;
case ' u ' :
2020-01-01 23:37:28 +00:00
ocus_user = optarg ;
break ;
case ' n ' :
ocnl_user = optarg ;
break ;
case ' r ' :
ocro_user = optarg ;
break ;
case ' k ' :
ocuk_user = optarg ;
2019-09-08 16:42:10 +00:00
break ;
2019-10-04 00:30:17 +00:00
case ' q ' :
use_ocpl_db = 1 ;
break ;
2020-02-23 01:26:23 +00:00
case ' i ' :
start_time = get_num ( ' i ' , optarg ) ;
2020-02-23 01:42:25 +00:00
time_filter = 1 ;
2020-02-23 01:26:23 +00:00
break ;
case ' f ' :
end_time = get_num ( ' f ' , optarg ) ;
2020-02-23 01:42:25 +00:00
time_filter = 1 ;
2020-02-23 01:26:23 +00:00
break ;
2020-01-01 23:37:28 +00:00
case ' N ' :
2019-10-04 00:30:17 +00:00
get_not_found = 1 ;
break ;
2020-08-01 21:00:50 +00:00
case ' O ' :
get_owned = 1 ;
break ;
2020-01-25 15:34:18 +00:00
case ' Q ' :
exclude_quiz = 1 ;
break ;
2019-09-08 16:42:10 +00:00
case ' H ' :
heat_file = optarg ;
break ;
case ' s ' :
2020-02-23 00:41:15 +00:00
heat_stamp_size = get_num ( ' s ' , optarg ) ;
2019-09-08 16:42:10 +00:00
break ;
2019-09-08 20:18:13 +00:00
case ' m ' :
heat_map = optarg ;
2019-09-08 16:42:10 +00:00
break ;
2019-09-12 12:07:46 +00:00
case ' e ' :
heat_exp = 1 ;
break ;
2020-02-02 11:53:51 +00:00
case ' t ' :
trail = 1 ;
break ;
2019-09-08 16:42:10 +00:00
case ' h ' :
case ' ? ' :
default :
2019-11-04 20:34:29 +00:00
show_usage ( ) ;
2019-09-08 16:42:10 +00:00
}
Caches cc ;
2020-06-02 22:30:05 +00:00
std : : map < std : : string , int > region_count ;
2019-09-08 16:42:10 +00:00
2020-08-01 21:00:50 +00:00
if ( get_not_found | | get_owned ) {
2020-02-16 23:37:03 +00:00
use_oc = 0 ;
use_ocpl_db = 1 ;
trail = 0 ;
if ( ocpl_user_uuid . empty ( ) & & ocpl_user . empty ( ) ) {
2020-08-01 21:00:50 +00:00
std : : cout < < " Options \" -N \" or \" -O \" work only with OCpl \n " ;
std : : exit ( EXIT_FAILURE ) ;
}
if ( get_not_found & & get_owned ) {
std : : cout < < " Options \" -N \" and \" -O \" are mutually exclusive. \n " ;
2020-02-16 23:37:03 +00:00
std : : exit ( EXIT_FAILURE ) ;
}
}
2020-01-01 23:37:28 +00:00
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 ) ;
2020-02-29 01:04:55 +00:00
Caches tmp = OCpl . get_user_caches ( ocpl_user_uuid , 0 ) ;
std : : copy ( tmp . begin ( ) , tmp . end ( ) , std : : back_inserter ( cc ) ) ;
2020-01-04 18:24:00 +00:00
ocpl_user_profile = OCpl . get_profile_url ( ocpl_user_uuid ) ;
2020-01-01 23:37:28 +00:00
}
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 ) ;
2020-02-29 01:04:55 +00:00
Caches tmp = OCde . get_user_caches ( ocde_user_uuid , 0 ) ;
std : : copy ( tmp . begin ( ) , tmp . end ( ) , std : : back_inserter ( cc ) ) ;
2020-01-31 13:37:00 +00:00
ocde_user_profile = OCde . get_profile_url ( ocde_user_uuid ) ;
2020-01-01 23:37:28 +00:00
}
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 ) ;
2020-02-29 01:04:55 +00:00
Caches tmp = OCus . get_user_caches ( ocus_user_uuid , 0 ) ;
std : : copy ( tmp . begin ( ) , tmp . end ( ) , std : : back_inserter ( cc ) ) ;
2020-01-31 13:37:00 +00:00
ocus_user_profile = OCus . get_profile_url ( ocus_user_uuid ) ;
2020-01-01 23:37:28 +00:00
}
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 ) ;
2020-02-29 01:04:55 +00:00
Caches tmp = OCnl . get_user_caches ( ocnl_user_uuid , 0 ) ;
std : : copy ( tmp . begin ( ) , tmp . end ( ) , std : : back_inserter ( cc ) ) ;
2020-01-31 13:37:00 +00:00
ocnl_user_profile = OCnl . get_profile_url ( ocnl_user_uuid ) ;
2020-01-01 23:37:28 +00:00
}
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 ) ;
2020-02-29 01:04:55 +00:00
Caches tmp = OCro . get_user_caches ( ocro_user_uuid , 0 ) ;
std : : copy ( tmp . begin ( ) , tmp . end ( ) , std : : back_inserter ( cc ) ) ;
2020-01-31 13:37:00 +00:00
ocro_user_profile = OCro . get_profile_url ( ocro_user_uuid ) ;
2020-01-01 23:37:28 +00:00
}
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 ) ;
2020-02-29 01:04:55 +00:00
Caches tmp = OCuk . get_user_caches ( ocuk_user_uuid , 0 ) ;
std : : copy ( tmp . begin ( ) , tmp . end ( ) , std : : back_inserter ( cc ) ) ;
2020-01-31 13:37:00 +00:00
ocuk_user_profile = OCuk . get_profile_url ( ocuk_user_uuid ) ;
2019-09-08 16:42:10 +00:00
}
}
2020-02-29 22:19:45 +00:00
// if (!gpx_file.empty()) {
// GPX gpxfile(gpx_file);
// Caches tmp = gpxfile.get_user_caches();
// std::copy(tmp.begin(), tmp.end(), std::back_inserter(cc));
// }
2019-09-08 16:42:10 +00:00
2019-10-04 00:30:17 +00:00
if ( use_ocpl_db ) {
OCdb db ( Database ) ;
if ( ! ocpl_user . empty ( ) ) {
2020-02-16 23:37:03 +00:00
Okapi OCpl ( ocpl_url , ocpl_key ) ;
2019-10-04 00:30:17 +00:00
ocpl_user_uuid = OCpl . get_uuid ( ocpl_user ) ;
2020-05-24 14:56:10 +00:00
ocpl_user_profile = OCpl . get_profile_url ( ocpl_user_uuid ) ;
2019-10-04 00:30:17 +00:00
}
if ( get_not_found ) {
2020-02-29 01:04:55 +00:00
Caches tmp = db . get_user_caches_not_found ( ocpl_user_uuid ) ;
std : : copy ( tmp . begin ( ) , tmp . end ( ) , std : : back_inserter ( cc ) ) ;
2020-06-02 22:30:05 +00:00
region_count = db . get_region_stats ( ) ;
2020-08-01 21:00:50 +00:00
} else if ( get_owned ) {
Caches tmp = db . get_user_caches_owned ( ocpl_user_uuid ) ;
2020-08-05 00:27:17 +00:00
Okapi OCpl ( ocpl_url , ocpl_key ) ;
OCpl . update_caches ( tmp ) ;
2020-08-01 21:00:50 +00:00
std : : copy ( tmp . begin ( ) , tmp . end ( ) , std : : back_inserter ( cc ) ) ;
2019-10-04 00:30:17 +00:00
} else {
2020-02-29 01:04:55 +00:00
Caches tmp = db . get_user_caches ( ocpl_user_uuid , 0 ) ;
std : : copy ( tmp . begin ( ) , tmp . end ( ) , std : : back_inserter ( cc ) ) ;
2019-10-04 00:30:17 +00:00
}
}
2019-09-08 16:42:10 +00:00
// TODO: some cache deduplication is needed
Debug ( 2 ) < < " Caches read: " < < cc . size ( ) < < ' \n ' ;
2019-11-04 20:34:48 +00:00
if ( cc . size ( ) = = 0 ) {
std : : cout < < " No caches found, aborting. \n " ;
std : : exit ( EXIT_FAILURE ) ;
}
2019-09-08 16:42:10 +00:00
2020-04-03 00:23:16 +00:00
// 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 "
} ) ;
2020-01-25 10:40:56 +00:00
// Prepare sorted list of caches, excluding moving caches
std : : map < std : : string , int > dates ;
Date_Caches sorted_caches ;
2020-01-25 14:26:14 +00:00
Date_Caches sorted_fcaches ;
Date_Caches sorted_caches_by_hidden ;
2020-02-29 01:04:55 +00:00
pCaches caches_by_fav ;
pCaches caches_by_fav_perc ;
pCaches caches_by_finds ;
pCaches fcc ;
2020-01-25 10:40:56 +00:00
2020-02-16 23:37:03 +00:00
if ( ! get_not_found ) {
2020-02-23 01:26:23 +00:00
for ( auto i = cc . begin ( ) ; i ! = cc . end ( ) ; ) {
2020-02-23 01:42:25 +00:00
if ( time_filter & & ( i - > date_t > end_time | | i - > date_t < start_time ) ) {
2020-02-23 01:26:23 +00:00
i = cc . erase ( i ) ;
continue ;
}
2020-04-03 00:23:16 +00:00
poland . locate ( * i ) ;
2020-02-23 01:26:23 +00:00
dates [ i - > date ] + + ;
sorted_caches . insert ( { i - > date_t , & * i } ) ;
2020-08-01 21:00:50 +00:00
if ( ( i - > type ! = " Moving " & & i - > type ! = " Own " ) | | get_owned ) {
2020-02-23 01:26:23 +00:00
sorted_fcaches . insert ( { i - > date_t , & * i } ) ;
2020-02-29 01:04:55 +00:00
fcc . push_back ( & * i ) ;
2020-02-16 23:37:03 +00:00
}
2020-02-23 01:26:23 +00:00
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 ) ;
i + + ;
2020-02-16 23:37:03 +00:00
}
std : : sort ( caches_by_fav . begin ( ) , caches_by_fav . end ( ) , [ & ] ( const Cache * a , const Cache * b ) { return a - > fav > b - > fav ; } ) ;
2020-02-17 20:27:51 +00:00
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 ; } ) ;
2020-02-16 23:37:03 +00:00
std : : sort ( caches_by_finds . begin ( ) , caches_by_finds . end ( ) , [ & ] ( const Cache * a , const Cache * b ) { return a - > founds > b - > founds ; } ) ;
} else {
for ( auto & i : cc ) {
2020-07-06 11:46:43 +00:00
if ( i . type ! = " Moving " & & i . type ! = " Own " & & ( ! exclude_quiz | | i . type ! = " Quiz " ) ) {
2020-02-29 01:04:55 +00:00
fcc . push_back ( & i ) ;
2020-02-16 23:37:03 +00:00
}
2020-01-25 10:40:56 +00:00
}
}
2020-08-06 19:13:40 +00:00
header_html ( ) ;
2020-03-19 17:31:55 +00:00
std : : cout < < " <header> \n " ;
2020-05-24 12:30:31 +00:00
std : : cout < < " <h1><a href= \" /geo \" >Geocaching stats</a> for user profiles:</h1> \n " ;
2020-02-17 20:27:51 +00:00
if ( ! ocpl_user . empty ( ) )
2020-02-29 12:40:32 +00:00
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 " ;
2020-02-17 20:27:51 +00:00
if ( ! ocde_user . empty ( ) )
2020-02-29 12:40:32 +00:00
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 " ;
2020-02-17 20:27:51 +00:00
if ( ! ocus_user . empty ( ) )
2020-02-29 12:40:32 +00:00
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 " ;
2020-02-17 20:27:51 +00:00
if ( ! ocnl_user . empty ( ) )
2020-02-29 12:40:32 +00:00
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 " ;
2020-02-17 20:27:51 +00:00
if ( ! ocro_user . empty ( ) )
2020-02-29 12:40:32 +00:00
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 " ;
2020-02-17 20:27:51 +00:00
if ( ! ocuk_user . empty ( ) )
2020-02-29 12:40:32 +00:00
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 " ;
2020-02-23 01:42:25 +00:00
if ( time_filter ) {
2020-02-23 02:05:36 +00:00
std : : cout < < " for time range " < < std : : put_time ( std : : localtime ( & start_time ) , " %x " ) < < " — " < < std : : put_time ( std : : localtime ( & end_time ) , " %x " ) ;
2020-02-23 01:42:25 +00:00
}
2020-03-19 17:31:55 +00:00
std : : cout < < " </header> \n " ;
2019-11-10 20:03:11 +00:00
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 ) ;
}
2020-02-02 11:27:32 +00:00
Heat hmap ( chosen_map ) ;
2020-02-23 02:52:30 +00:00
if ( trail ) {
if ( sorted_fcaches . size ( ) < 2 ) {
std : : cout < < " You need at least 2 caches for a trail. \n " ;
std : : exit ( EXIT_FAILURE ) ;
}
2020-02-02 11:27:32 +00:00
hmap . generate_path ( heat_file , sorted_fcaches ) ;
2020-02-23 02:52:30 +00:00
} else
2020-02-02 11:27:32 +00:00
hmap . generate ( heat_file , fcc , heat_stamp_size , ( heat_exp = = 1 ? " exp " : " soft " ) ) ;
2020-03-19 17:31:55 +00:00
std : : cout < < " <figure> \n <img class= \" heatmap \" src= \" " < < heat_file < < " \" alt= \" heat map \" > \n </figure> \n " ;
2019-11-10 20:03:11 +00:00
}
2020-08-01 21:00:50 +00:00
if ( ! get_not_found & & ! get_owned ) {
2020-03-21 03:52:52 +00:00
short count ;
2020-06-03 22:11:37 +00:00
int n ;
2020-03-21 03:52:52 +00:00
2019-11-10 19:59:21 +00:00
std : : cout < < " <div class= \" basic_stats \" > \n " ;
2020-01-04 17:41:15 +00:00
std : : cout < < " Number of caches found: <span class= \" value \" > " < < cc . size ( ) < < " </span><br> \n " ;
2020-01-25 10:40:56 +00:00
2019-11-10 19:59:21 +00:00
auto best_day = std : : max_element ( dates . begin ( ) , dates . end ( ) , [ & ] ( auto & a , auto & b ) { return a . second < b . second ; } ) ;
2020-01-04 17:41:15 +00:00
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 " ;
2020-03-13 19:53:17 +00:00
std : : cout < < std : : resetiosflags ( std : : cout . flags ( ) ) ;
2020-03-06 09:56:11 +00:00
std : : cout < < " Number of caches that are now archived: <span class= \" value \" > " < < std : : count_if ( cc . begin ( ) , cc . end ( ) , [ & ] ( auto & a ) { return a . status = = archived ; } ) < < " </span><br> \n " ;
2020-03-09 12:20:49 +00:00
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 " ;
2019-11-11 22:28:37 +00:00
for ( auto & i : dates )
std : : cout < < i . first < < " , found " < < i . second < < " caches<br> \n " ;
2020-03-09 12:20:49 +00:00
std : : cout < < " </p> \n </details> \n " ;
2019-11-10 19:59:21 +00:00
2020-07-06 16:29:23 +00:00
std : : time_t streak ;
2020-01-04 17:33:53 +00:00
int longest_str = find_streak ( sorted_caches , streak ) ;
char str_tmp [ 20 ] ;
2020-07-06 16:29:23 +00:00
std : : tm * str_tm = std : : localtime ( & streak ) ;
std : : strftime ( str_tmp , 20 , " %F " , str_tm ) ;
2020-01-04 17:41:15 +00:00
std : : cout < < " Longest caching streak: <span class= \" value \" > " < < longest_str < < " </span> starting on <span class= \" value \" > " < < str_tmp < < " </span><br> \n " ;
2020-01-04 17:33:53 +00:00
2020-03-09 19:36:08 +00:00
float tot_dist = 0 ;
2020-01-25 14:26:14 +00:00
for ( auto i = sorted_fcaches . begin ( ) ; i ! = std : : prev ( sorted_fcaches . end ( ) ) ; i + + ) {
2020-01-04 18:27:04 +00:00
//std::cout << "Distance between " << i->second->name << " and " << std::next(i)->second->name << " is " << cache_distance(*i->second, *std::next(i)->second) << "<br>";
2019-11-10 19:59:21 +00:00
tot_dist + = cache_distance ( * i - > second , * std : : next ( i ) - > second ) ;
}
2020-03-13 19:53:17 +00:00
std : : cout < < " Total distance between caches: <span class= \" value \" > " < < std : : fixed < < tot_dist < < " </span> km (equivalent to <span class= \" value \" > " < < tot_dist / ( 2 * Pi * Earth_radius ) < < " x</span> trips around Earth)<br> \n " ;
std : : cout < < std : : resetiosflags ( std : : cout . flags ( ) ) ;
2020-01-25 15:15:21 +00:00
if ( sorted_fcaches . size ( ) > 1 )
std : : cout < < " Average distance between caches: <span class= \" value \" > " < < tot_dist / ( sorted_fcaches . size ( ) - 1 ) < < " </span> km<br> \n " ;
2019-11-10 20:03:11 +00:00
std : : cout < < " </div> \n " ;
2019-11-11 20:10:58 +00:00
2020-05-03 21:14:37 +00:00
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 ;
2020-03-21 03:52:52 +00:00
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 ) ; } ) ) ;
2020-08-05 00:25:06 +00:00
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> " ;
2020-03-21 03:52:52 +00:00
}
std : : cout < < " </tr> \n " ;
2020-08-05 00:25:06 +00:00
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 " ;
2020-03-21 03:52:52 +00:00
}
2020-07-05 22:01:26 +00:00
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 > dates ;
for ( auto el : cc ) {
if ( el . date_tm . tm_mon = = j - 1 & & el . date_tm . tm_year = = i )
dates [ el . date_tm . tm_mday ] + + ;
}
std : : cout < < " <td style= \" --percent: " < < dates . size ( ) * 100 / max < < " % \" ><span> " < < dates . size ( ) < < " </span></td> " ;
}
std : : cout < < " </tr> \n " ;
}
std : : cout < < " </table> \n " ;
2020-01-25 11:05:38 +00:00
// 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();
2020-03-20 02:28:20 +00:00
// show_histogram(cc, &Cache::year_month, "Caching timeline", 1, 0);
2020-01-25 11:20:41 +00:00
show_histogram ( cc , & Cache : : owner , " Cache owners " , 1 ) ;
show_histogram ( cc , & Cache : : type , " Cache types " , 1 ) ;
show_histogram ( cc , & Cache : : size , " Cache sizes " , 1 ) ;
2020-07-17 17:57:46 +00:00
// show_histogram(fcc, &Cache::region, "Regions", 1);
// show_histogram(fcc, &Cache::subregion, "Subregions", 1);
show_nested_histogram ( fcc , & Cache : : region , & Cache : : subregion , " Regions " , 1 ) ;
2020-01-25 11:20:41 +00:00
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 ) ;
2019-09-08 16:42:10 +00:00
2020-05-03 21:14:37 +00:00
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 ; } ) ;
2020-01-25 12:51:22 +00:00
2020-05-03 21:14:37 +00:00
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 " ;
2020-01-25 12:51:22 +00:00
std : : cout < < " </tr> \n " ;
std : : cout < < " </table> \n " ;
2020-01-25 14:26:14 +00:00
const int LIST_MAX = 15 ;
n = 1 ;
std : : cout < < " <h2>Oldest caches found</h2> \n " ;
std : : cout < < " <table class= \" list \" > \n " ;
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th></th> " ;
std : : cout < < " <th>Cache</th> " ;
std : : cout < < " <th>Type</th> " ;
std : : cout < < " <th>Date hidden</th> " ;
std : : cout < < " <th>Date found</th> " ;
2020-01-25 14:26:14 +00:00
std : : cout < < " </tr> \n " ;
for ( auto i = sorted_caches_by_hidden . begin ( ) ; i ! = sorted_caches_by_hidden . end ( ) ; i + + ) {
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th> " < < n < < " </th> " ;
2020-02-29 01:26:43 +00:00
std : : cout < < " <td> " < < i - > second - > link_name ( ) < < " </td> " ;
2020-02-01 11:36:39 +00:00
std : : cout < < " <td> " < < i - > second - > type < < " </td> " ;
2020-01-25 14:26:14 +00:00
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 " ;
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th></th> " ;
std : : cout < < " <th>Cache</th> " ;
std : : cout < < " <th>Type</th> " ;
std : : cout < < " <th>Date hidden</th> " ;
std : : cout < < " <th>Date found</th> " ;
2020-01-25 14:26:14 +00:00
std : : cout < < " </tr> \n " ;
for ( auto i = sorted_caches_by_hidden . rbegin ( ) ; i ! = sorted_caches_by_hidden . rend ( ) ; i + + ) {
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th> " < < n < < " </th> " ;
2020-02-29 01:26:43 +00:00
std : : cout < < " <td> " < < i - > second - > link_name ( ) < < " </td> " ;
2020-02-01 11:36:39 +00:00
std : : cout < < " <td> " < < i - > second - > type < < " </td> " ;
2020-01-25 14:26:14 +00:00
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 " ;
2020-01-25 14:36:29 +00:00
2020-07-05 21:30:51 +00:00
std : : cout < < " <div class= \" basic_stats \" > \n " ;
2020-07-13 20:09:11 +00:00
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 " ;
2020-07-05 21:30:51 +00:00
std : : cout < < " Number of caches found within first 24h: <span class= \" value \" > " < < std : : count_if ( cc . begin ( ) , cc . end ( ) , [ & ] ( 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 ( ) , [ & ] ( 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 ( ) , [ & ] ( 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 ( ) , [ & ] ( 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 ( ) , [ & ] ( 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 ( ) , [ & ] ( auto & a ) { return a . age_when_found > 365 * 10 ; } ) < < " </span><br> \n " ;
std : : cout < < " </div> \n " ;
2020-01-25 15:12:29 +00:00
n = 1 ;
std : : cout < < " <h2>Caches with most recommendations</h2> \n " ;
std : : cout < < " <table class= \" list \" > \n " ;
2020-02-07 14:20:38 +00:00
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> " ;
2020-01-25 15:12:29 +00:00
std : : cout < < " </tr> \n " ;
for ( auto i : caches_by_fav ) {
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th> " < < n < < " </th> " ;
2020-02-29 01:26:43 +00:00
std : : cout < < " <td> " < < i - > link_name ( ) < < " </td> " ;
2020-02-01 11:36:39 +00:00
std : : cout < < " <td> " < < i - > type < < " </td> " ;
2020-01-25 15:12:29 +00:00
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 " ;
2020-07-05 21:30:51 +00:00
average_html ( cc , & Cache : : fav , " number of recommendations " ) ;
2020-01-25 15:12:29 +00:00
n = 1 ;
std : : cout < < " <h2>Caches with most recommendations (percentage)</h2> \n " ;
std : : cout < < " <table class= \" list \" > \n " ;
2020-02-07 14:20:38 +00:00
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> " ;
2020-01-25 15:12:29 +00:00
std : : cout < < " </tr> \n " ;
for ( auto i : caches_by_fav_perc ) {
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th> " < < n < < " </th> " ;
2020-02-29 01:26:43 +00:00
std : : cout < < " <td> " < < i - > link_name ( ) < < " </td> " ;
2020-02-01 11:36:39 +00:00
std : : cout < < " <td> " < < i - > type < < " </td> " ;
2020-01-25 15:12:29 +00:00
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 " ;
2020-02-01 11:36:39 +00:00
n = 1 ;
std : : cout < < " <h2>Caches with most finds</h2> \n " ;
std : : cout < < " <table class= \" list \" > \n " ;
2020-02-07 14:20:38 +00:00
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> " ;
2020-02-01 11:36:39 +00:00
std : : cout < < " </tr> \n " ;
for ( auto i : caches_by_finds ) {
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th> " < < n < < " </th> " ;
2020-02-29 01:26:43 +00:00
std : : cout < < " <td> " < < i - > link_name ( ) < < " </td> " ;
2020-02-01 11:36:39 +00:00
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 " ;
2020-07-05 21:30:51 +00:00
average_html ( cc , & Cache : : founds , " number of finds " ) ;
2020-02-01 11:36:39 +00:00
n = 1 ;
std : : cout < < " <h2>Caches with least finds</h2> \n " ;
std : : cout < < " <table class= \" list \" > \n " ;
2020-02-07 14:20:38 +00:00
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> " ;
2020-02-01 11:36:39 +00:00
std : : cout < < " </tr> \n " ;
for ( auto i = caches_by_finds . rbegin ( ) ; i ! = caches_by_finds . rend ( ) ; i + + ) {
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th> " < < n < < " </th> " ;
2020-02-29 01:26:43 +00:00
std : : cout < < " <td> " < < ( * i ) - > link_name ( ) < < " </td> " ;
2020-02-01 11:36:39 +00:00
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 " ;
2020-03-21 04:02:23 +00:00
2020-06-03 22:06:49 +00:00
// D/T matrix
n = 0 ;
2020-05-03 21:14:37 +00:00
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 = std : : count_if ( cc . begin ( ) , cc . end ( ) , [ i , j ] ( Cache c ) { 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> " < < count < < " </td> " ;
n + + ;
}
}
std : : cout < < " </tr> \n " ;
}
std : : cout < < " </table> \n " ;
std : : cout < < " <div class= \" basic_stats \" > \n " ;
2020-07-05 21:30:51 +00:00
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 " ;
2020-05-03 21:14:37 +00:00
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 < < " </tr> \n " ;
for ( int i = 1 ; i < = 12 ; i + + ) { // i -> months in rows
std : : cout < < " <tr><th> " < < i < < " </th> " ;
for ( int j = 1 ; j < = 31 ; j + + ) { // j -> days in cols
count = std : : count_if ( cc . begin ( ) , cc . end ( ) , [ i , j ] ( Cache c ) { 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> " < < 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> days out of 366 ( " < < std : : setprecision ( 3 ) < < n / 3.66 < < " %). \n " ;
std : : cout < < " </div> \n " ;
2020-03-21 04:02:23 +00:00
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 ;
2020-03-29 23:59:10 +00:00
std : : cout < < " <h2>Caches by hidden month matrix</h2> \n " ;
2020-03-21 04:02:23 +00:00
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 < < " </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 ) ; } ) ;
if ( count = = 0 )
std : : cout < < " <td class= \" dt_zero \" > " < < 0 < < " </td> " ;
else
std : : cout < < " <td> " < < count < < " </td> " ;
}
std : : cout < < " </tr> \n " ;
}
std : : cout < < " </table> \n " ;
2020-01-25 14:36:29 +00:00
} // end of main if
2019-11-04 20:13:20 +00:00
2020-02-16 23:37:03 +00:00
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 " ;
2020-05-24 14:56:10 +00:00
2020-06-02 22:30:05 +00:00
std : : map < std : : string , int > region_found_count ;
for ( auto el : cc )
region_found_count [ el . region ] + + ;
for ( auto & i : region_count )
i . second = region_found_count [ i . first ] * 100 / i . second ;
show_histogram ( region_found_count , " Regions " , 1 ) ;
show_histogram ( region_count , " Percentage " , 1 ) ;
2020-02-16 23:37:03 +00:00
}
2020-08-01 21:00:50 +00:00
if ( get_owned ) {
short count ;
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 ( ) , [ & ] ( 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 ( ) , [ & ] ( auto & a ) { return a . status = = archived ; } ) < < " </span><br> \n " ;
2020-08-04 23:48:23 +00:00
std : : cout < < " </div> \n " ;
2020-08-01 21:00:50 +00:00
2020-08-05 00:27:17 +00:00
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 " ;
}
2020-08-01 21:00:50 +00:00
// 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 " ;
2020-08-05 00:27:17 +00:00
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> " ;
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 " ) ;
2020-08-05 00:37:38 +00:00
sum_html ( cc , & Cache : : fav , " number of recommendations " ) ;
2020-08-05 00:27:17 +00:00
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> " ;
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 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 " ) ;
2020-08-05 00:37:38 +00:00
sum_html ( cc , & Cache : : founds , " number of finds " ) ;
2020-08-05 00:27:17 +00:00
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 " ;
2020-08-01 21:00:50 +00:00
// 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 = std : : count_if ( cc . begin ( ) , cc . end ( ) , [ i , j ] ( Cache c ) { 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> " < < 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 " ;
} // end of "owned" if
2020-08-06 14:54:11 +00:00
footer_html ( ) ;
2019-09-08 16:42:10 +00:00
}