2019-09-08 16:42:10 +00:00
# include "okapi.h"
# include "gpx.h"
# 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"
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 " ;
std : : cout < < " Generate HTML stats from Opencaching data or GPX files. \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 " ;
std : : cout < < " \t -g file \t \t use specified gpx file \n " ;
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-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
2019-09-08 16:42:10 +00:00
std : : string gpx_file ;
# 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-02-23 01:26:23 +00:00
while ( ( o = getopt ( argc , argv , " qNQg: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-01-01 23:37:28 +00:00
// case 'd':
2020-02-23 00:41:15 +00:00
// Debug::set_debug_level(get_num('d',optarg));
// break;
2019-09-08 16:42:10 +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-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-02-16 23:37:03 +00:00
if ( get_not_found ) {
use_oc = 0 ;
use_ocpl_db = 1 ;
trail = 0 ;
if ( ocpl_user_uuid . empty ( ) & & ocpl_user . empty ( ) ) {
std : : cout < < " Option \" -N \" works only with OCpl \n " ;
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
}
}
if ( ! gpx_file . empty ( ) ) {
GPX gpxfile ( gpx_file ) ;
2020-02-29 01:04:55 +00:00
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 ) ;
}
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 ) ) ;
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-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 ;
}
dates [ i - > date ] + + ;
sorted_caches . insert ( { i - > date_t , & * i } ) ;
if ( i - > type ! = " Moving " & & i - > type ! = " Own " & & ( ! get_not_found | | ! exclude_quiz | | i - > type ! = " Quiz " ) ) {
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 ) {
if ( i . type ! = " Moving " & & i . type ! = " Own " & & ( ! get_not_found | | ! 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-02-29 01:45:35 +00:00
std : : cout < < " <!DOCTYPE html> \n " ;
std : : cout < < " <html lang= \" en \" > \n " ;
2020-01-25 11:05:38 +00:00
std : : cout < < " <head> \n " ;
std : : cout < < " <meta http-equiv= \" Content-Type \" content= \" text/html; charset=utf-8 \" > \n " ;
2020-02-29 12:38:46 +00:00
std : : cout < < " <link rel= \" stylesheet \" type= \" text/css \" href= \" geo.css?ver=8 \" > \n " ;
2020-01-25 11:05:38 +00:00
std : : cout < < " <title>Geocaching stats</title> \n " ;
std : : cout < < " </head> \n " ;
std : : cout < < " <body> \n " ;
2020-01-25 21:22:25 +00:00
std : : cout < < " <h1>Geocaching stats for user profiles: <br> \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-01-25 21:22:25 +00:00
std : : cout < < " </h1> \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-01-25 11:05:38 +00:00
std : : cout < < " <img class= \" heatmap \" src= \" " < < heat_file < < " \" alt= \" heat map \" > \n " ;
2019-11-10 20:03:11 +00:00
}
2020-01-25 11:05:38 +00:00
if ( ! get_not_found ) {
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 " ;
std : : cout < < " Best caching day: <span class= \" value \" > " < < best_day - > first < < " </span>, found <span class= \" value \" > " < < best_day - > second < < " </span> caches \n " ;
2020-01-28 04:59:34 +00:00
std : : cout < < " <input id= \" caching-days \" class= \" toggle \" type= \" checkbox \" > \n <label for= \" caching-days \" class= \" lbl-toggle \" >Details</label> \n <div class= \" collapsible-content \" > \n <div class= \" content-inner \" > \n " ;
2019-11-11 22:28:37 +00:00
for ( auto & i : dates )
std : : cout < < i . first < < " , found " < < i . second < < " caches<br> \n " ;
2020-01-28 04:59:34 +00:00
std : : cout < < " </div> \n </div> \n " ;
2019-11-10 19:59:21 +00:00
2020-01-04 17:33:53 +00:00
std : : tm streak ;
int longest_str = find_streak ( sorted_caches , streak ) ;
char str_tmp [ 20 ] ;
std : : strftime ( str_tmp , 20 , " %F " , & streak ) ;
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
2019-11-10 19:59:21 +00:00
int 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-01-04 18:27:04 +00:00
std : : cout < < " Total distance between caches: <span class= \" value \" > " < < tot_dist < < " </span> km (equivalent to <span class= \" value \" > " < < tot_dist / ( 2 * Pi * Earth_radius ) < < " x</span> trips around Earth)<br> \n " ;
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-02-29 01:04:55 +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 ; } ) ;
2019-09-08 16:42:10 +00:00
2020-01-25 11:05:38 +00:00
std : : cout < < " <h2>Geographically extreme caches</h2> \n " ;
2020-01-25 14:26:14 +00:00
std : : cout < < " <table class= \" list \" > \n " ;
2020-01-25 11:05:38 +00:00
std : : cout < < " <tr> \n " ;
2020-02-29 01:26:43 +00:00
std : : cout < < " <th>North:</th><td> " < < N - > link_name ( ) < < " </td><td> " < < N - > pos . lat < < " </td> \n " ;
2020-01-25 11:05:38 +00:00
std : : cout < < " </tr><tr> \n " ;
2020-02-29 01:26:43 +00:00
std : : cout < < " <th>South:</th><td> " < < S - > link_name ( ) < < " </td><td> " < < S - > pos . lat < < " </td> \n " ;
2020-01-25 11:05:38 +00:00
std : : cout < < " </tr><tr> \n " ;
2020-02-29 01:26:43 +00:00
std : : cout < < " <th>East:</th> <td> " < < E - > link_name ( ) < < " </td><td> " < < E - > pos . lon < < " </td> \n " ;
2020-01-25 11:05:38 +00:00
std : : cout < < " </tr><tr> \n " ;
2020-02-29 01:26:43 +00:00
std : : cout < < " <th>West:</th> <td> " < < W - > link_name ( ) < < " </td><td> " < < W - > pos . lon < < " </td> \n " ;
2020-01-25 11:05:38 +00:00
std : : cout < < " </tr> \n " ;
std : : cout < < " </table> \n " ;
2019-09-08 16:42:10 +00:00
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-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 ) ;
show_histogram ( cc , & Cache : : region , " 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 ) ;
2019-09-08 16:42:10 +00:00
2020-01-25 12:51:22 +00:00
// DT matrix
2020-01-25 14:30:57 +00:00
short count ;
2019-11-11 22:33:43 +00:00
int n = 0 ;
2019-11-04 20:13:20 +00:00
std : : cout < < " <h2>Difficulty / terrain matrix</h2> \n " ;
std : : cout < < " <table class= \" dt \" > \n " ;
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th></th> " ;
2019-11-04 20:13:20 +00:00
for ( int j = 2 ; j < = 10 ; j + + ) { // print table terr headers
2020-02-07 14:20:38 +00:00
std : : cout < < " <th> " < < j / 2.0 < < " </th> " ;
2019-11-04 20:13:20 +00:00
}
std : : cout < < " </tr> \n " ;
for ( int i = 2 ; i < = 10 ; i + + ) { // i -> diff in rows
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th> " < < i / 2.0 < < " </th> " ;
2019-11-04 20:13:20 +00:00
for ( int j = 2 ; j < = 10 ; j + + ) { // j -> terr in cols
2020-01-25 14:30:57 +00:00
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 )
2020-01-25 12:51:22 +00:00
std : : cout < < " <td class= \" dt_zero \" > " < < 0 < < " </td> " ;
2019-11-11 22:33:43 +00:00
else {
2020-01-25 14:30:57 +00:00
std : : cout < < " <td> " < < count < < " </td> " ;
2019-11-11 22:33:43 +00:00
n + + ;
}
2019-11-04 20:13:20 +00:00
}
std : : cout < < " </tr> \n " ;
}
std : : cout < < " </table> \n " ;
2020-01-25 12:51:22 +00:00
2019-11-11 22:33:43 +00:00
std : : cout < < " <div class= \" basic_stats \" > \n " ;
2020-01-04 18:27:04 +00:00
std : : cout < < " Total <span class= \" value \" > " < < n < < " </span> combinations found out of 81 ( " < < std : : setprecision ( 3 ) < < n / 0.81 < < " %). \n " ;
2019-11-11 22:33:43 +00:00
std : : cout < < " </div> \n " ;
2020-01-25 12:51:22 +00:00
// Days matrix
n = 0 ;
std : : cout < < " <h2>Caching days matrix</h2> \n " ;
std : : cout < < " <table class= \" dt \" > \n " ;
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th></th> " ;
2020-01-25 12:51:22 +00:00
for ( int j = 1 ; j < = 31 ; j + + ) { // print table day headers
2020-02-07 14:20:38 +00:00
std : : cout < < " <th> " < < j < < " </th> " ;
2020-01-25 12:51:22 +00:00
}
std : : cout < < " </tr> \n " ;
for ( int i = 1 ; i < = 12 ; i + + ) { // i -> months in rows
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th> " < < i < < " </th> " ;
2020-01-25 12:51:22 +00:00
for ( int j = 1 ; j < = 31 ; j + + ) { // j -> days in cols
2020-01-25 14:47:50 +00:00
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 ) ; } ) ;
2020-01-25 14:30:57 +00:00
if ( count = = 0 )
2020-01-25 12:51:22 +00:00
std : : cout < < " <td class= \" dt_zero \" > " < < 0 < < " </td> " ;
else {
2020-01-25 14:30:57 +00:00
std : : cout < < " <td> " < < count < < " </td> " ;
2020-01-25 12:51:22 +00:00
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-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-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 " ;
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 " ;
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-01-25 14:36:29 +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 ;
2020-02-17 20:27:51 +00:00
2020-01-25 14:36:29 +00:00
std : : cout < < " <h2>Caches by hidden day matrix</h2> \n " ;
std : : cout < < " <table class= \" dt \" > \n " ;
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th></th> " ;
2020-01-25 14:36:29 +00:00
for ( int j = 1 ; j < = 12 ; j + + ) { // print table month headers
2020-02-07 14:20:38 +00:00
std : : cout < < " <th> " < < j < < " </th> " ;
2020-01-25 14:36:29 +00:00
}
std : : cout < < " </tr> \n " ;
for ( int i = y_min ; i < = y_max ; i + + ) { // i -> years in rows
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th> " < < i + 1900 < < " </th> " ;
2020-01-25 14:36:29 +00:00
for ( int j = 1 ; j < = 12 ; j + + ) { // j -> months in cols
2020-01-25 14:47:50 +00:00
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 ) ; } ) ;
2020-01-25 14:36:29 +00:00
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 " ;
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 ;
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-02-17 20:27:51 +00:00
2020-01-25 14:36:29 +00:00
std : : cout < < " <h2>Caches by found day matrix</h2> \n " ;
std : : cout < < " <table class= \" dt \" > \n " ;
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th></th> " ;
2020-01-25 14:36:29 +00:00
for ( int j = 1 ; j < = 12 ; j + + ) { // print table month headers
2020-02-07 14:20:38 +00:00
std : : cout < < " <th> " < < j < < " </th> " ;
2020-01-25 14:36:29 +00:00
}
std : : cout < < " </tr> \n " ;
for ( int i = y_min ; i < = y_max ; i + + ) { // i -> years in rows
2020-02-07 14:20:38 +00:00
std : : cout < < " <tr><th> " < < i + 1900 < < " </th> " ;
2020-01-25 14:36:29 +00:00
for ( int j = 1 ; j < = 12 ; j + + ) { // j -> months in cols
2020-01-25 14:47:50 +00:00
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 ) ; } ) ;
2020-01-25 14:36:29 +00:00
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 " ;
} // 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-01-25 11:05:38 +00:00
std : : cout < < " <div id= \" footer \" > \n " ;
std : : cout < < " Stats generated by <a href= \" https://gitlab.com/tomaszg/geostat \" >GeoStat</a>.<br> \n " ;
std : : cout < < " Data obtained from Opencaching sites via <a href= \" https://github.com/opencaching/okapi/ \" >OKAPI</a>:<br> \n " ;
std : : cout < < " <a href= \" https://www.opencaching.pl/ \" >Opencaching.pl</a>, " ;
std : : cout < < " <a href= \" https://www.opencaching.de/ \" >Opencaching.de</a>, " ;
std : : cout < < " <a href= \" http://www.opencaching.us/ \" >Opencaching.us</a>, " ;
std : : cout < < " <a href= \" http://www.opencaching.nl/ \" >Opencaching.nl</a>, " ;
std : : cout < < " <a href= \" http://www.opencaching.ro/ \" >Opencaching.ro</a>, " ;
std : : cout < < " <a href= \" https://www.opencache.uk/ \" >Opencaching.uk</a>. " ;
std : : cout < < " </div> \n " ;
std : : cout < < " </body> \n </html> \n " ;
2019-09-08 16:42:10 +00:00
}