Welcome to mirror list, hosted at ThFree Co, Russian Federation.

github.com/mapsme/omim.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
path: root/openlr
diff options
context:
space:
mode:
authorVladimir Byko-Ianko <v.bykoianko@corp.mail.ru>2019-05-20 13:58:12 +0300
committerVlad Mihaylenko <vxmihaylenko@gmail.com>2019-05-21 17:22:22 +0300
commitd34076e0b02925b14482defca344f6ef6e1fd611 (patch)
tree03c07c05dbb3134bfa0493ab78937392d1f676fd /openlr
parent746115edce4d95e860b7bcb9d099201eea1382fe (diff)
Adding stats for routes which don't have enough score.
Diffstat (limited to 'openlr')
-rw-r--r--openlr/score_paths_connector.cpp1
-rw-r--r--openlr/stats.hpp3
2 files changed, 4 insertions, 0 deletions
diff --git a/openlr/score_paths_connector.cpp b/openlr/score_paths_connector.cpp
index 2f0e336a66..c9dac2ede2 100644
--- a/openlr/score_paths_connector.cpp
+++ b/openlr/score_paths_connector.cpp
@@ -191,6 +191,7 @@ bool ScorePathsConnector::FindBestPath(vector<LocationReferencePoint> const & po
if (it->m_score < kMinValidScore)
{
LOG(LINFO, ("The shortest path found but it is no good. The best score:", it->m_score));
+ ++m_stat.m_notEnoughScore;
return false;
}
diff --git a/openlr/stats.hpp b/openlr/stats.hpp
index 2461198388..4f42a11162 100644
--- a/openlr/stats.hpp
+++ b/openlr/stats.hpp
@@ -19,6 +19,7 @@ struct alignas(kCacheLineSize) Stats
m_routesFailed += s.m_routesFailed;
m_noCandidateFound += s.m_noCandidateFound;
m_noShortestPathFound += s.m_noShortestPathFound;
+ m_notEnoughScore += s.m_notEnoughScore;
m_wrongOffsets += s.m_wrongOffsets;
m_zeroDistToNextPointCount += s.m_zeroDistToNextPointCount;
}
@@ -29,6 +30,7 @@ struct alignas(kCacheLineSize) Stats
LOG(LINFO, ("Failed:", m_routesFailed));
LOG(LINFO, ("No candidate lines:", m_noCandidateFound));
LOG(LINFO, ("Wrong distance to next point:", m_zeroDistToNextPointCount));
+ LOG(LINFO, ("Not enough score for shortest path:", m_notEnoughScore));
LOG(LINFO, ("Wrong offsets:", m_wrongOffsets));
LOG(LINFO, ("No shortest path:", m_noShortestPathFound));
}
@@ -37,6 +39,7 @@ struct alignas(kCacheLineSize) Stats
uint32_t m_routesFailed = 0;
uint32_t m_noCandidateFound = 0;
uint32_t m_noShortestPathFound = 0;
+ uint32_t m_notEnoughScore = 0;
uint32_t m_wrongOffsets = 0;
// Number of zeroed distance-to-next point values in the input.
uint32_t m_zeroDistToNextPointCount = 0;